./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro --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 e565a6b24d6424f6fb761694db85d86d72d2d2e8ff7a736ef4f3a961a69f6a07 --- 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-8393723 [2022-11-18 20:32:31,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:32:31,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:32:31,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:32:31,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:32:31,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:32:31,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:32:31,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:32:31,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:32:31,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:32:31,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:32:31,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:32:31,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:32:31,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:32:31,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:32:31,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:32:31,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:32:31,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:32:31,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:32:31,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:32:31,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:32:31,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:32:31,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:32:31,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:32:31,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:32:31,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:32:31,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:32:31,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:32:31,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:32:31,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:32:31,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:32:31,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:32:31,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:32:31,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:32:31,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:32:31,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:32:31,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:32:31,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:32:31,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:32:31,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:32:31,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:32:31,880 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:32:31,921 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:32:31,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:32:31,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:32:31,923 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:32:31,924 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:32:31,924 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:32:31,925 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:32:31,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:32:31,925 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:32:31,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:32:31,927 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:32:31,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:32:31,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:32:31,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:32:31,928 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:32:31,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:32:31,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:32:31,929 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:32:31,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:32:31,930 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:32:31,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:32:31,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:32:31,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:32:31,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:32:31,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:32:31,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:32:31,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:32:31,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:32:31,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:32:31,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:32:31,934 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:32:31,934 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:32:31,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:32:31,935 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_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/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_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro 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 -> e565a6b24d6424f6fb761694db85d86d72d2d2e8ff7a736ef4f3a961a69f6a07 [2022-11-18 20:32:32,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:32:32,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:32:32,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:32:32,318 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:32:32,319 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:32:32,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2022-11-18 20:32:32,417 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/data/be9c7cd3b/d0cd844ae64644089e8262612b5913d4/FLAG47f463348 [2022-11-18 20:32:32,928 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:32:32,929 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2022-11-18 20:32:32,943 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/data/be9c7cd3b/d0cd844ae64644089e8262612b5913d4/FLAG47f463348 [2022-11-18 20:32:33,255 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/data/be9c7cd3b/d0cd844ae64644089e8262612b5913d4 [2022-11-18 20:32:33,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:32:33,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:32:33,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:32:33,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:32:33,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:32:33,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f003487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33, skipping insertion in model container [2022-11-18 20:32:33,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:32:33,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:32:33,530 WARN L234 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_3fdc0508-8a7d-46df-83e6-46e8160096ea/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c[914,927] [2022-11-18 20:32:33,601 WARN L234 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_3fdc0508-8a7d-46df-83e6-46e8160096ea/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c[7125,7138] [2022-11-18 20:32:33,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:32:33,721 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:32:33,735 WARN L234 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_3fdc0508-8a7d-46df-83e6-46e8160096ea/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c[914,927] [2022-11-18 20:32:33,765 WARN L234 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_3fdc0508-8a7d-46df-83e6-46e8160096ea/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c[7125,7138] [2022-11-18 20:32:33,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:32:33,881 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:32:33,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33 WrapperNode [2022-11-18 20:32:33,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:32:33,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:32:33,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:32:33,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:32:33,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,958 INFO L138 Inliner]: procedures = 65, calls = 76, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 693 [2022-11-18 20:32:33,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:32:33,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:32:33,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:32:33,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:32:33,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:34,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:34,008 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:34,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:34,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:32:34,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:32:34,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:32:34,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:32:34,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:34,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:32:34,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:34,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:32:34,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:32:34,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:32:34,147 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-18 20:32:34,148 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-18 20:32:34,148 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-18 20:32:34,150 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-18 20:32:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-18 20:32:34,151 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-18 20:32:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-18 20:32:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-18 20:32:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-18 20:32:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-18 20:32:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-18 20:32:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-18 20:32:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-18 20:32:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-18 20:32:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-18 20:32:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-18 20:32:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-18 20:32:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-18 20:32:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-18 20:32:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-18 20:32:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-18 20:32:34,155 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-18 20:32:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:32:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-18 20:32:34,155 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-18 20:32:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-18 20:32:34,155 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-18 20:32:34,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:32:34,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:32:34,156 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-18 20:32:34,156 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-18 20:32:34,371 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:32:34,373 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:32:35,320 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:32:35,333 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:32:35,334 INFO L300 CfgBuilder]: Removed 13 assume(true) statements. [2022-11-18 20:32:35,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:32:35 BoogieIcfgContainer [2022-11-18 20:32:35,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:32:35,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:32:35,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:32:35,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:32:35,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:32:33" (1/3) ... [2022-11-18 20:32:35,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dcae7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:32:35, skipping insertion in model container [2022-11-18 20:32:35,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (2/3) ... [2022-11-18 20:32:35,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dcae7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:32:35, skipping insertion in model container [2022-11-18 20:32:35,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:32:35" (3/3) ... [2022-11-18 20:32:35,348 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2022-11-18 20:32:35,371 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:32:35,371 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 20:32:35,447 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:32:35,455 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;@23276767, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:32:35,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-18 20:32:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 282 states have (on average 1.6063829787234043) internal successors, (453), 289 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-18 20:32:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:32:35,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:35,492 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-18 20:32:35,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:35,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:35,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1975408481, now seen corresponding path program 1 times [2022-11-18 20:32:35,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:35,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097872020] [2022-11-18 20:32:35,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:32:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:32:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 20:32:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:32:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 20:32:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:32:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,229 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-18 20:32:36,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:36,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097872020] [2022-11-18 20:32:36,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097872020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:36,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:36,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:32:36,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700420373] [2022-11-18 20:32:36,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:36,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:32:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:36,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:32:36,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:32:36,286 INFO L87 Difference]: Start difference. First operand has 334 states, 282 states have (on average 1.6063829787234043) internal successors, (453), 289 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) 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-18 20:32:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:37,626 INFO L93 Difference]: Finished difference Result 782 states and 1218 transitions. [2022-11-18 20:32:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:32:37,629 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-18 20:32:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:37,643 INFO L225 Difference]: With dead ends: 782 [2022-11-18 20:32:37,643 INFO L226 Difference]: Without dead ends: 460 [2022-11-18 20:32:37,648 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-18 20:32:37,652 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 850 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:37,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1210 Invalid, 1150 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [179 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-18 20:32:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-11-18 20:32:37,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 420. [2022-11-18 20:32:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-18 20:32:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 614 transitions. [2022-11-18 20:32:37,747 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 614 transitions. Word has length 59 [2022-11-18 20:32:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:37,748 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 614 transitions. [2022-11-18 20:32:37,749 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-18 20:32:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 614 transitions. [2022-11-18 20:32:37,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:32:37,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:37,752 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-18 20:32:37,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:32:37,753 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:37,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2080229855, now seen corresponding path program 1 times [2022-11-18 20:32:37,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:37,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899821100] [2022-11-18 20:32:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:37,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:37,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:32:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:37,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:32:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 20:32:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:32:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 20:32:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:32:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,075 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-18 20:32:38,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:38,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899821100] [2022-11-18 20:32:38,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899821100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:38,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:38,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:32:38,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335019916] [2022-11-18 20:32:38,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:38,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:32:38,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:38,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:32:38,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:32:38,086 INFO L87 Difference]: Start difference. First operand 420 states and 614 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-18 20:32:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:39,359 INFO L93 Difference]: Finished difference Result 769 states and 1093 transitions. [2022-11-18 20:32:39,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:32:39,360 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-18 20:32:39,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:39,372 INFO L225 Difference]: With dead ends: 769 [2022-11-18 20:32:39,372 INFO L226 Difference]: Without dead ends: 591 [2022-11-18 20:32:39,378 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-18 20:32:39,380 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 962 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:39,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 1670 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-18 20:32:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-11-18 20:32:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 516. [2022-11-18 20:32:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 435 states have internal predecessors, (624), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-11-18 20:32:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 748 transitions. [2022-11-18 20:32:39,498 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 748 transitions. Word has length 59 [2022-11-18 20:32:39,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:39,498 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 748 transitions. [2022-11-18 20:32:39,499 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-18 20:32:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 748 transitions. [2022-11-18 20:32:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:32:39,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:39,512 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-18 20:32:39,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:32:39,513 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:39,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:39,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1186743517, now seen corresponding path program 1 times [2022-11-18 20:32:39,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:39,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542230958] [2022-11-18 20:32:39,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:39,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:32:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:32:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 20:32:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:32:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 20:32:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:32:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,728 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-18 20:32:39,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:39,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542230958] [2022-11-18 20:32:39,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542230958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:39,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:39,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:32:39,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204378936] [2022-11-18 20:32:39,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:39,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:32:39,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:39,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:32:39,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:32:39,732 INFO L87 Difference]: Start difference. First operand 516 states and 748 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-18 20:32:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:42,002 INFO L93 Difference]: Finished difference Result 1862 states and 2604 transitions. [2022-11-18 20:32:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-18 20:32:42,003 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-18 20:32:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:42,011 INFO L225 Difference]: With dead ends: 1862 [2022-11-18 20:32:42,011 INFO L226 Difference]: Without dead ends: 1576 [2022-11-18 20:32:42,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-18 20:32:42,015 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 2905 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2919 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:42,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2919 Valid, 1655 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-18 20:32:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-11-18 20:32:42,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1402. [2022-11-18 20:32:42,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1153 states have internal predecessors, (1559), 145 states have call successors, (145), 111 states have call predecessors, (145), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-11-18 20:32:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1882 transitions. [2022-11-18 20:32:42,177 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1882 transitions. Word has length 59 [2022-11-18 20:32:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:42,177 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 1882 transitions. [2022-11-18 20:32:42,178 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-18 20:32:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1882 transitions. [2022-11-18 20:32:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:32:42,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:42,179 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-18 20:32:42,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:32:42,179 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2136549092, now seen corresponding path program 1 times [2022-11-18 20:32:42,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:42,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651933475] [2022-11-18 20:32:42,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:42,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:42,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:32:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:42,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:32:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:42,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 20:32:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:42,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:42,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:32:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:42,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 20:32:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:42,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:32:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:42,353 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-18 20:32:42,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:42,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651933475] [2022-11-18 20:32:42,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651933475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:42,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:42,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:32:42,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457635593] [2022-11-18 20:32:42,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:42,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:32:42,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:42,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:32:42,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:32:42,356 INFO L87 Difference]: Start difference. First operand 1402 states and 1882 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-18 20:32:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:43,806 INFO L93 Difference]: Finished difference Result 2732 states and 3633 transitions. [2022-11-18 20:32:43,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:32:43,807 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-18 20:32:43,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:43,816 INFO L225 Difference]: With dead ends: 2732 [2022-11-18 20:32:43,816 INFO L226 Difference]: Without dead ends: 1566 [2022-11-18 20:32:43,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:32:43,820 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 416 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:43,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1901 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-18 20:32:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2022-11-18 20:32:43,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1432. [2022-11-18 20:32:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1177 states have internal predecessors, (1575), 145 states have call successors, (145), 111 states have call predecessors, (145), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-11-18 20:32:43,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1904 transitions. [2022-11-18 20:32:43,975 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1904 transitions. Word has length 59 [2022-11-18 20:32:43,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:43,976 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1904 transitions. [2022-11-18 20:32:43,976 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-18 20:32:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1904 transitions. [2022-11-18 20:32:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:32:43,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:43,978 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-18 20:32:43,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:32:43,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:43,979 INFO L85 PathProgramCache]: Analyzing trace with hash 331110758, now seen corresponding path program 1 times [2022-11-18 20:32:43,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:43,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581474120] [2022-11-18 20:32:43,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:43,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:32:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:32:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 20:32:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:32:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 20:32:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:32:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,165 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-18 20:32:44,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:44,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581474120] [2022-11-18 20:32:44,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581474120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:44,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:44,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:32:44,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578269656] [2022-11-18 20:32:44,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:44,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:32:44,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:44,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:32:44,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:32:44,168 INFO L87 Difference]: Start difference. First operand 1432 states and 1904 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-18 20:32:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:45,624 INFO L93 Difference]: Finished difference Result 2783 states and 3608 transitions. [2022-11-18 20:32:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 20:32:45,625 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-18 20:32:45,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:45,633 INFO L225 Difference]: With dead ends: 2783 [2022-11-18 20:32:45,634 INFO L226 Difference]: Without dead ends: 1810 [2022-11-18 20:32:45,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:32:45,637 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 971 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:45,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1411 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-18 20:32:45,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2022-11-18 20:32:45,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1374. [2022-11-18 20:32:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1130 states have internal predecessors, (1515), 139 states have call successors, (139), 106 states have call predecessors, (139), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-11-18 20:32:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1823 transitions. [2022-11-18 20:32:45,763 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1823 transitions. Word has length 59 [2022-11-18 20:32:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:45,763 INFO L495 AbstractCegarLoop]: Abstraction has 1374 states and 1823 transitions. [2022-11-18 20:32:45,763 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-18 20:32:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1823 transitions. [2022-11-18 20:32:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:32:45,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:45,765 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-18 20:32:45,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:32:45,765 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:45,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:45,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1663033948, now seen corresponding path program 1 times [2022-11-18 20:32:45,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:45,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007603543] [2022-11-18 20:32:45,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:45,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:32:45,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:32:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:32:45,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:32:45,835 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:32:45,836 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-18 20:32:45,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-18 20:32:45,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:32:45,843 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-18 20:32:45,848 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:32:45,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:32:45 BoogieIcfgContainer [2022-11-18 20:32:45,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:32:45,992 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:32:45,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:32:45,992 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:32:45,993 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:32:35" (3/4) ... [2022-11-18 20:32:45,995 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:32:46,133 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:32:46,134 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:32:46,134 INFO L158 Benchmark]: Toolchain (without parser) took 12875.15ms. Allocated memory was 111.1MB in the beginning and 224.4MB in the end (delta: 113.2MB). Free memory was 76.2MB in the beginning and 176.0MB in the end (delta: -99.8MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2022-11-18 20:32:46,135 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 86.0MB. Free memory was 59.4MB in the beginning and 59.4MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:32:46,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 615.02ms. Allocated memory is still 111.1MB. Free memory was 75.9MB in the beginning and 77.7MB in the end (delta: -1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:32:46,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.40ms. Allocated memory is still 111.1MB. Free memory was 77.7MB in the beginning and 74.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:32:46,136 INFO L158 Benchmark]: Boogie Preprocessor took 58.02ms. Allocated memory is still 111.1MB. Free memory was 74.3MB in the beginning and 70.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:32:46,138 INFO L158 Benchmark]: RCFGBuilder took 1319.28ms. Allocated memory is still 111.1MB. Free memory was 70.8MB in the beginning and 78.0MB in the end (delta: -7.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-18 20:32:46,138 INFO L158 Benchmark]: TraceAbstraction took 10651.69ms. Allocated memory was 111.1MB in the beginning and 224.4MB in the end (delta: 113.2MB). Free memory was 77.1MB in the beginning and 187.5MB in the end (delta: -110.4MB). Peak memory consumption was 130.9MB. Max. memory is 16.1GB. [2022-11-18 20:32:46,139 INFO L158 Benchmark]: Witness Printer took 141.75ms. Allocated memory is still 224.4MB. Free memory was 187.5MB in the beginning and 176.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:32:46,143 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.32ms. Allocated memory is still 86.0MB. Free memory was 59.4MB in the beginning and 59.4MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 615.02ms. Allocated memory is still 111.1MB. Free memory was 75.9MB in the beginning and 77.7MB in the end (delta: -1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.40ms. Allocated memory is still 111.1MB. Free memory was 77.7MB in the beginning and 74.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.02ms. Allocated memory is still 111.1MB. Free memory was 74.3MB in the beginning and 70.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1319.28ms. Allocated memory is still 111.1MB. Free memory was 70.8MB in the beginning and 78.0MB in the end (delta: -7.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10651.69ms. Allocated memory was 111.1MB in the beginning and 224.4MB in the end (delta: 113.2MB). Free memory was 77.1MB in the beginning and 187.5MB in the end (delta: -110.4MB). Peak memory consumption was 130.9MB. Max. memory is 16.1GB. * Witness Printer took 141.75ms. Allocated memory is still 224.4MB. Free memory was 187.5MB in the beginning and 176.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: [L525] int T4_E = 2; [L513] int t6_st ; [L523] int T2_E = 2; [L35] int q_read_ev ; [L503] int t3_pc = 0; [L38] int q_ev ; [L66] int c_dr_st ; [L68] int c_dr_i ; [L527] int T6_E = 2; [L514] int m_i ; [L172] static int a_t ; [L520] int t6_i ; [L510] int t3_st ; [L516] int t2_i ; [L62] int p_dw_pc ; [L518] int t4_i ; [L63] int p_dw_i ; [L504] int t4_pc = 0; [L67] int c_dr_pc ; [L529] int E_1 = 2; [L500] int m_pc = 0; [L531] int E_3 = 2; [L530] int E_2 = 2; [L533] int E_5 = 2; [L511] int t4_st ; [L532] int E_4 = 2; [L64] int c_num_read ; [L534] int E_6 = 2; [L526] int T5_E = 2; [L507] int m_st ; [L524] int T3_E = 2; [L34] int q_free ; [L522] int T1_E = 2; [L37] int q_req_up ; [L505] int t5_pc = 0; [L33] int q_buf_0 ; [L545] int local ; [L501] int t1_pc = 0; [L59] int p_num_write ; [L515] int t1_i ; [L521] int M_E = 2; [L528] int E_M = 2; [L508] int t1_st ; [L517] int t3_i ; [L36] int q_write_ev ; [L519] int t5_i ; [L512] int t5_st ; [L506] int t6_pc = 0; [L502] int t2_pc = 0; [L543] int token ; [L61] int p_dw_st ; [L65] int c_last_read ; [L509] int t2_st ; [L60] int p_last_write ; 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_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, token=0] [L1587] COND TRUE __VERIFIER_nondet_int() [L1588] 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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, 334 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6174 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6104 mSDsluCounter, 7847 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6326 mSDsCounter, 1162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6540 IncrementalHoareTripleChecker+Invalid, 7702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1162 mSolverCounterUnsat, 1521 mSDtfsCounter, 6540 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1432occurred in iteration=4, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 5 MinimizatonAttempts, 859 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-18 20:32:46,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fdc0508-8a7d-46df-83e6-46e8160096ea/bin/uautomizer-TMbwUNV5ro/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