./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc --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 fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:33:12,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:33:12,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:33:12,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:33:12,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:33:12,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:33:12,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:33:12,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:33:12,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:33:12,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:33:12,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:33:12,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:33:12,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:33:12,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:33:12,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:33:12,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:33:12,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:33:12,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:33:12,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:33:12,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:33:12,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:33:12,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:33:12,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:33:12,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:33:12,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:33:12,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:33:12,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:33:12,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:33:12,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:33:12,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:33:12,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:33:12,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:33:12,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:33:12,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:33:12,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:33:12,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:33:12,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:33:12,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:33:12,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:33:12,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:33:12,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:33:12,126 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:33:12,152 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:33:12,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:33:12,153 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:33:12,153 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:33:12,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:33:12,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:33:12,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:33:12,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:33:12,156 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:33:12,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:33:12,157 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:33:12,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:33:12,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:33:12,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:33:12,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:33:12,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:33:12,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:33:12,159 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:33:12,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:33:12,159 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:33:12,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:33:12,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:33:12,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:33:12,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:33:12,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:33:12,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:33:12,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:33:12,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:33:12,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:33:12,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:33:12,163 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:33:12,163 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:33:12,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:33:12,164 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_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/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_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc 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 -> fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e [2022-11-02 20:33:12,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:33:12,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:33:12,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:33:12,560 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:33:12,561 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:33:12,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2022-11-02 20:33:12,664 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/data/db7071995/ca48defcc0b04fa68f65ded4284cf928/FLAG053ff0058 [2022-11-02 20:33:13,312 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:33:13,313 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2022-11-02 20:33:13,330 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/data/db7071995/ca48defcc0b04fa68f65ded4284cf928/FLAG053ff0058 [2022-11-02 20:33:13,594 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/data/db7071995/ca48defcc0b04fa68f65ded4284cf928 [2022-11-02 20:33:13,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:33:13,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:33:13,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:33:13,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:33:13,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:33:13,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:33:13" (1/1) ... [2022-11-02 20:33:13,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14204adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:13, skipping insertion in model container [2022-11-02 20:33:13,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:33:13" (1/1) ... [2022-11-02 20:33:13,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:33:13,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:33:13,962 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_5aa2dfde-cf80-417d-8036-33255d354380/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[914,927] [2022-11-02 20:33:14,063 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_5aa2dfde-cf80-417d-8036-33255d354380/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[7125,7138] [2022-11-02 20:33:14,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:33:14,224 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:33:14,245 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_5aa2dfde-cf80-417d-8036-33255d354380/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[914,927] [2022-11-02 20:33:14,270 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_5aa2dfde-cf80-417d-8036-33255d354380/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[7125,7138] [2022-11-02 20:33:14,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:33:14,332 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:33:14,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:14 WrapperNode [2022-11-02 20:33:14,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:33:14,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:33:14,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:33:14,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:33:14,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:14" (1/1) ... [2022-11-02 20:33:14,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:14" (1/1) ... [2022-11-02 20:33:14,408 INFO L138 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 751 [2022-11-02 20:33:14,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:33:14,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:33:14,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:33:14,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:33:14,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:14" (1/1) ... [2022-11-02 20:33:14,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:14" (1/1) ... [2022-11-02 20:33:14,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:14" (1/1) ... [2022-11-02 20:33:14,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:14" (1/1) ... [2022-11-02 20:33:14,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:14" (1/1) ... [2022-11-02 20:33:14,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:14" (1/1) ... [2022-11-02 20:33:14,478 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:14" (1/1) ... [2022-11-02 20:33:14,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:14" (1/1) ... [2022-11-02 20:33:14,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:33:14,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:33:14,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:33:14,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:33:14,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:14" (1/1) ... [2022-11-02 20:33:14,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:33:14,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:14,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:14,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:33:14,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:33:14,634 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-02 20:33:14,634 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-02 20:33:14,634 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-02 20:33:14,636 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-02 20:33:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-02 20:33:14,637 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-02 20:33:14,637 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-02 20:33:14,637 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-02 20:33:14,637 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-02 20:33:14,637 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-02 20:33:14,638 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-02 20:33:14,639 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-02 20:33:14,639 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-02 20:33:14,640 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-02 20:33:14,640 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-02 20:33:14,640 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-02 20:33:14,640 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-02 20:33:14,640 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-02 20:33:14,640 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-02 20:33:14,640 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-02 20:33:14,641 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-02 20:33:14,641 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-02 20:33:14,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:33:14,641 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-02 20:33:14,641 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-02 20:33:14,641 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-02 20:33:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-02 20:33:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:33:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:33:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-02 20:33:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-02 20:33:14,827 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:33:14,831 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:33:15,920 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:33:15,935 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:33:15,938 INFO L300 CfgBuilder]: Removed 14 assume(true) statements. [2022-11-02 20:33:15,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:33:15 BoogieIcfgContainer [2022-11-02 20:33:15,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:33:15,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:33:15,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:33:15,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:33:15,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:33:13" (1/3) ... [2022-11-02 20:33:15,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb8b470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:33:15, skipping insertion in model container [2022-11-02 20:33:15,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:14" (2/3) ... [2022-11-02 20:33:15,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb8b470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:33:15, skipping insertion in model container [2022-11-02 20:33:15,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:33:15" (3/3) ... [2022-11-02 20:33:15,958 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2022-11-02 20:33:15,981 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:33:15,982 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:33:16,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:33:16,076 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4bce03f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:33:16,077 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:33:16,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 359 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 313 states have internal predecessors, (494), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-02 20:33:16,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:33:16,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:16,113 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:33:16,114 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:16,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1357445742, now seen corresponding path program 1 times [2022-11-02 20:33:16,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:16,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348263737] [2022-11-02 20:33:16,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:16,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:16,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:33:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:16,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:33:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:16,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:33:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:33:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:33:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:16,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:33:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:16,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:16,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348263737] [2022-11-02 20:33:16,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348263737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:16,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:16,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:33:16,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336779877] [2022-11-02 20:33:16,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:16,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:33:16,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:16,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:33:16,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:33:16,609 INFO L87 Difference]: Start difference. First operand has 359 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 313 states have internal predecessors, (494), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) 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) [2022-11-02 20:33:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:17,648 INFO L93 Difference]: Finished difference Result 714 states and 1123 transitions. [2022-11-02 20:33:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:33:17,652 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 [2022-11-02 20:33:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:17,683 INFO L225 Difference]: With dead ends: 714 [2022-11-02 20:33:17,683 INFO L226 Difference]: Without dead ends: 367 [2022-11-02 20:33:17,694 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:33:17,697 INFO L413 NwaCegarLoop]: 524 mSDtfsCounter, 771 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:17,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 1198 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:33:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-02 20:33:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 349. [2022-11-02 20:33:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-11-02 20:33:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 522 transitions. [2022-11-02 20:33:17,817 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 522 transitions. Word has length 59 [2022-11-02 20:33:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:17,817 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 522 transitions. [2022-11-02 20:33:17,818 INFO L496 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) [2022-11-02 20:33:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 522 transitions. [2022-11-02 20:33:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:33:17,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:17,822 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:33:17,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:33:17,823 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:17,829 INFO L85 PathProgramCache]: Analyzing trace with hash -876365484, now seen corresponding path program 1 times [2022-11-02 20:33:17,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:17,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899249486] [2022-11-02 20:33:17,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:17,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:33:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:18,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:33:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:18,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:33:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:18,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:18,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:33:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:18,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:33:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:18,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:33:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:18,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:18,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899249486] [2022-11-02 20:33:18,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899249486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:18,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:18,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:33:18,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911945369] [2022-11-02 20:33:18,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:18,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:33:18,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:18,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:33:18,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:33:18,312 INFO L87 Difference]: Start difference. First operand 349 states and 522 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) [2022-11-02 20:33:19,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:19,708 INFO L93 Difference]: Finished difference Result 574 states and 838 transitions. [2022-11-02 20:33:19,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:33:19,709 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 [2022-11-02 20:33:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:19,713 INFO L225 Difference]: With dead ends: 574 [2022-11-02 20:33:19,713 INFO L226 Difference]: Without dead ends: 485 [2022-11-02 20:33:19,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:33:19,720 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 1138 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:19,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 1484 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:33:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-11-02 20:33:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 445. [2022-11-02 20:33:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-11-02 20:33:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 653 transitions. [2022-11-02 20:33:19,808 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 653 transitions. Word has length 59 [2022-11-02 20:33:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:19,809 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 653 transitions. [2022-11-02 20:33:19,809 INFO L496 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) [2022-11-02 20:33:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 653 transitions. [2022-11-02 20:33:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:33:19,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:19,822 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:33:19,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:33:19,823 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:19,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:19,823 INFO L85 PathProgramCache]: Analyzing trace with hash -637036524, now seen corresponding path program 1 times [2022-11-02 20:33:19,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:19,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365011471] [2022-11-02 20:33:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:19,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:19,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:33:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:33:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:33:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:33:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:33:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:33:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:20,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:20,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365011471] [2022-11-02 20:33:20,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365011471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:20,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:20,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:33:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600470119] [2022-11-02 20:33:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:20,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:33:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:33:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:33:20,123 INFO L87 Difference]: Start difference. First operand 445 states and 653 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) [2022-11-02 20:33:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:21,808 INFO L93 Difference]: Finished difference Result 794 states and 1131 transitions. [2022-11-02 20:33:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:33:21,809 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 [2022-11-02 20:33:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:21,814 INFO L225 Difference]: With dead ends: 794 [2022-11-02 20:33:21,814 INFO L226 Difference]: Without dead ends: 616 [2022-11-02 20:33:21,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:33:21,817 INFO L413 NwaCegarLoop]: 577 mSDtfsCounter, 1018 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:21,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 2010 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:33:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-11-02 20:33:21,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 541. [2022-11-02 20:33:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 459 states have internal predecessors, (660), 58 states have call successors, (58), 28 states have call predecessors, (58), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-11-02 20:33:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 786 transitions. [2022-11-02 20:33:21,908 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 786 transitions. Word has length 59 [2022-11-02 20:33:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:21,909 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 786 transitions. [2022-11-02 20:33:21,909 INFO L496 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) [2022-11-02 20:33:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 786 transitions. [2022-11-02 20:33:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:33:21,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:21,911 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:33:21,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:33:21,912 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:21,913 INFO L85 PathProgramCache]: Analyzing trace with hash 256449814, now seen corresponding path program 1 times [2022-11-02 20:33:21,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:21,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807548272] [2022-11-02 20:33:21,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:21,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:33:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:21,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:33:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:22,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:33:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:22,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:22,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:33:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:22,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:33:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:22,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:33:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:22,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:22,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807548272] [2022-11-02 20:33:22,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807548272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:22,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:22,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:33:22,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408351287] [2022-11-02 20:33:22,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:22,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:33:22,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:22,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:33:22,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:33:22,093 INFO L87 Difference]: Start difference. First operand 541 states and 786 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) [2022-11-02 20:33:23,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:23,560 INFO L93 Difference]: Finished difference Result 869 states and 1241 transitions. [2022-11-02 20:33:23,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:33:23,561 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 [2022-11-02 20:33:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:23,565 INFO L225 Difference]: With dead ends: 869 [2022-11-02 20:33:23,565 INFO L226 Difference]: Without dead ends: 601 [2022-11-02 20:33:23,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:33:23,568 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 447 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:23,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 2264 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:33:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-11-02 20:33:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 556. [2022-11-02 20:33:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 471 states have internal predecessors, (672), 58 states have call successors, (58), 28 states have call predecessors, (58), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-11-02 20:33:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 801 transitions. [2022-11-02 20:33:23,644 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 801 transitions. Word has length 59 [2022-11-02 20:33:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:23,645 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 801 transitions. [2022-11-02 20:33:23,645 INFO L496 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) [2022-11-02 20:33:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 801 transitions. [2022-11-02 20:33:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:33:23,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:23,647 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:33:23,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:33:23,648 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:23,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:23,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2061888148, now seen corresponding path program 1 times [2022-11-02 20:33:23,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:23,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536061386] [2022-11-02 20:33:23,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:23,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:23,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:33:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:23,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:33:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:23,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:33:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:23,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:23,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:33:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:23,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:33:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:23,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:33:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:23,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:23,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536061386] [2022-11-02 20:33:23,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536061386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:23,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:23,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:33:23,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959996055] [2022-11-02 20:33:23,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:23,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:33:23,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:23,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:33:23,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:33:23,908 INFO L87 Difference]: Start difference. First operand 556 states and 801 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) [2022-11-02 20:33:25,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:25,390 INFO L93 Difference]: Finished difference Result 875 states and 1234 transitions. [2022-11-02 20:33:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:33:25,391 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 [2022-11-02 20:33:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:25,399 INFO L225 Difference]: With dead ends: 875 [2022-11-02 20:33:25,399 INFO L226 Difference]: Without dead ends: 592 [2022-11-02 20:33:25,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:33:25,408 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 668 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:25,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 2031 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:33:25,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-11-02 20:33:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 561. [2022-11-02 20:33:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 466 states have (on average 1.446351931330472) internal successors, (674), 475 states have internal predecessors, (674), 58 states have call successors, (58), 28 states have call predecessors, (58), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-11-02 20:33:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 804 transitions. [2022-11-02 20:33:25,480 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 804 transitions. Word has length 59 [2022-11-02 20:33:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:25,483 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 804 transitions. [2022-11-02 20:33:25,483 INFO L496 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) [2022-11-02 20:33:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 804 transitions. [2022-11-02 20:33:25,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:33:25,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:25,485 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:33:25,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:33:25,486 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:25,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1958319534, now seen corresponding path program 1 times [2022-11-02 20:33:25,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:25,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829223151] [2022-11-02 20:33:25,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:25,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:25,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:33:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:25,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:33:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:25,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:33:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:25,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:25,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:33:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:25,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:33:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:25,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:33:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:25,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:25,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829223151] [2022-11-02 20:33:25,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829223151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:25,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:25,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:33:25,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330378789] [2022-11-02 20:33:25,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:25,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:33:25,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:25,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:33:25,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:33:25,734 INFO L87 Difference]: Start difference. First operand 561 states and 804 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-02 20:33:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:28,400 INFO L93 Difference]: Finished difference Result 1931 states and 2655 transitions. [2022-11-02 20:33:28,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:33:28,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-11-02 20:33:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:28,414 INFO L225 Difference]: With dead ends: 1931 [2022-11-02 20:33:28,414 INFO L226 Difference]: Without dead ends: 1625 [2022-11-02 20:33:28,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:33:28,418 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 2735 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 603 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2750 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:28,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2750 Valid, 2290 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [603 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 20:33:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2022-11-02 20:33:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1477. [2022-11-02 20:33:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1217 states have internal predecessors, (1627), 146 states have call successors, (146), 111 states have call predecessors, (146), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-11-02 20:33:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1962 transitions. [2022-11-02 20:33:28,586 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1962 transitions. Word has length 59 [2022-11-02 20:33:28,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:28,587 INFO L495 AbstractCegarLoop]: Abstraction has 1477 states and 1962 transitions. [2022-11-02 20:33:28,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-02 20:33:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1962 transitions. [2022-11-02 20:33:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:33:28,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:28,589 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:33:28,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:33:28,589 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:28,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:28,590 INFO L85 PathProgramCache]: Analyzing trace with hash -440465259, now seen corresponding path program 1 times [2022-11-02 20:33:28,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:28,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368768525] [2022-11-02 20:33:28,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:28,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:28,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:33:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:28,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:33:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:28,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:33:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:28,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:28,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:33:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:28,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:33:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:28,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:33:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:28,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:28,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368768525] [2022-11-02 20:33:28,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368768525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:28,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:28,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:33:28,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631764992] [2022-11-02 20:33:28,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:28,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:33:28,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:28,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:33:28,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:33:28,790 INFO L87 Difference]: Start difference. First operand 1477 states and 1962 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) [2022-11-02 20:33:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:30,411 INFO L93 Difference]: Finished difference Result 2758 states and 3550 transitions. [2022-11-02 20:33:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:33:30,412 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 [2022-11-02 20:33:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:30,422 INFO L225 Difference]: With dead ends: 2758 [2022-11-02 20:33:30,422 INFO L226 Difference]: Without dead ends: 1765 [2022-11-02 20:33:30,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:33:30,426 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 1273 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:30,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 1517 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:33:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2022-11-02 20:33:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1419. [2022-11-02 20:33:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1151 states have (on average 1.3596872284969592) internal successors, (1565), 1170 states have internal predecessors, (1565), 140 states have call successors, (140), 106 states have call predecessors, (140), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) [2022-11-02 20:33:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1879 transitions. [2022-11-02 20:33:30,595 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1879 transitions. Word has length 59 [2022-11-02 20:33:30,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:30,595 INFO L495 AbstractCegarLoop]: Abstraction has 1419 states and 1879 transitions. [2022-11-02 20:33:30,595 INFO L496 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) [2022-11-02 20:33:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1879 transitions. [2022-11-02 20:33:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:33:30,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:30,597 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:33:30,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:33:30,597 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:30,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:30,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1860357331, now seen corresponding path program 1 times [2022-11-02 20:33:30,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:30,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775840679] [2022-11-02 20:33:30,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:30,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:30,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:30,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:30,696 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:33:30,697 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-02 20:33:30,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-02 20:33:30,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:33:30,704 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:30,710 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:33:30,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:33:30 BoogieIcfgContainer [2022-11-02 20:33:30,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:33:30,899 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:33:30,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:33:30,900 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:33:30,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:33:15" (3/4) ... [2022-11-02 20:33:30,903 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:33:31,002 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:33:31,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:33:31,003 INFO L158 Benchmark]: Toolchain (without parser) took 17404.07ms. Allocated memory was 127.9MB in the beginning and 232.8MB in the end (delta: 104.9MB). Free memory was 89.9MB in the beginning and 161.6MB in the end (delta: -71.7MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2022-11-02 20:33:31,003 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 127.9MB. Free memory is still 108.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:33:31,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 732.70ms. Allocated memory is still 127.9MB. Free memory was 89.6MB in the beginning and 94.3MB in the end (delta: -4.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:33:31,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.38ms. Allocated memory is still 127.9MB. Free memory was 94.3MB in the beginning and 90.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:33:31,005 INFO L158 Benchmark]: Boogie Preprocessor took 94.78ms. Allocated memory is still 127.9MB. Free memory was 90.7MB in the beginning and 86.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:33:31,005 INFO L158 Benchmark]: RCFGBuilder took 1434.02ms. Allocated memory is still 127.9MB. Free memory was 86.9MB in the beginning and 95.1MB in the end (delta: -8.2MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2022-11-02 20:33:31,006 INFO L158 Benchmark]: TraceAbstraction took 14950.49ms. Allocated memory was 127.9MB in the beginning and 232.8MB in the end (delta: 104.9MB). Free memory was 94.3MB in the beginning and 174.1MB in the end (delta: -79.9MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2022-11-02 20:33:31,006 INFO L158 Benchmark]: Witness Printer took 102.88ms. Allocated memory is still 232.8MB. Free memory was 174.1MB in the beginning and 161.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:33:31,008 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.34ms. Allocated memory is still 127.9MB. Free memory is still 108.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 732.70ms. Allocated memory is still 127.9MB. Free memory was 89.6MB in the beginning and 94.3MB in the end (delta: -4.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.38ms. Allocated memory is still 127.9MB. Free memory was 94.3MB in the beginning and 90.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.78ms. Allocated memory is still 127.9MB. Free memory was 90.7MB in the beginning and 86.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1434.02ms. Allocated memory is still 127.9MB. Free memory was 86.9MB in the beginning and 95.1MB in the end (delta: -8.2MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14950.49ms. Allocated memory was 127.9MB in the beginning and 232.8MB in the end (delta: 104.9MB). Free memory was 94.3MB in the beginning and 174.1MB in the end (delta: -79.9MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Witness Printer took 102.88ms. Allocated memory is still 232.8MB. Free memory was 174.1MB in the beginning and 161.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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 t6_pc = 0; [L507] int t7_pc = 0; [L508] int m_st ; [L509] int t1_st ; [L510] int t2_st ; [L511] int t3_st ; [L512] int t4_st ; [L513] int t5_st ; [L514] int t6_st ; [L515] int t7_st ; [L516] int m_i ; [L517] int t1_i ; [L518] int t2_i ; [L519] int t3_i ; [L520] int t4_i ; [L521] int t5_i ; [L522] int t6_i ; [L523] int t7_i ; [L524] int M_E = 2; [L525] int T1_E = 2; [L526] int T2_E = 2; [L527] int T3_E = 2; [L528] int T4_E = 2; [L529] int T5_E = 2; [L530] int T6_E = 2; [L531] int T7_E = 2; [L532] int E_M = 2; [L533] int E_1 = 2; [L534] int E_2 = 2; [L535] int E_3 = 2; [L536] int E_4 = 2; [L537] int E_5 = 2; [L538] int E_6 = 2; [L539] int E_7 = 2; [L549] int token ; [L551] 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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L1712] COND TRUE __VERIFIER_nondet_int() [L1713] 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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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_6=2, E_7=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, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_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, 359 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8134 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8050 mSDsluCounter, 12794 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9006 mSDsCounter, 1510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7279 IncrementalHoareTripleChecker+Invalid, 8789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1510 mSolverCounterUnsat, 3788 mSDtfsCounter, 7279 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1477occurred in iteration=6, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 7 MinimizatonAttempts, 703 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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! [2022-11-02 20:33:31,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aa2dfde-cf80-417d-8036-33255d354380/bin/uautomizer-Dbtcem3rbc/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