./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 53db286b74a116c4cb3fd4f087c7d403ff5102019365af3310fff7597395a239 --- Real Ultimate output --- [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-b5237d8 [2022-11-21 16:54:55,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:54:55,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:54:55,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:54:55,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:54:55,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:54:55,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:54:55,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:54:55,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:54:55,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:54:55,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:54:55,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:54:55,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:54:55,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:54:55,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:54:55,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:54:55,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:54:55,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:54:55,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:54:55,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:54:55,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:54:55,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:54:55,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:54:55,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:54:55,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:54:55,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:54:55,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:54:55,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:54:55,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:54:55,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:54:55,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:54:55,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:54:55,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:54:55,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:54:55,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:54:55,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:54:55,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:54:55,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:54:55,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:54:55,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:54:55,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:54:55,711 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:54:55,760 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:54:55,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:54:55,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:54:55,762 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:54:55,764 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:54:55,764 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:54:55,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:54:55,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:54:55,766 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:54:55,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:54:55,768 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:54:55,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:54:55,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:54:55,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:54:55,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:54:55,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:54:55,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:54:55,771 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:54:55,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:54:55,772 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:54:55,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:54:55,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:54:55,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:54:55,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:54:55,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:54:55,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:54:55,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:54:55,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:54:55,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:54:55,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:54:55,777 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:54:55,777 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:54:55,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:54:55,778 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_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/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_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 53db286b74a116c4cb3fd4f087c7d403ff5102019365af3310fff7597395a239 [2022-11-21 16:54:56,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:54:56,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:54:56,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:54:56,169 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:54:56,170 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:54:56,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2022-11-21 16:54:59,721 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:55:00,045 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:55:00,046 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2022-11-21 16:55:00,074 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/data/bd13a0edf/dce820f08f33488e8512106d9070dcbf/FLAGa26e3cd63 [2022-11-21 16:55:00,093 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/data/bd13a0edf/dce820f08f33488e8512106d9070dcbf [2022-11-21 16:55:00,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:55:00,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:55:00,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:55:00,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:55:00,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:55:00,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:55:00" (1/1) ... [2022-11-21 16:55:00,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5710aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00, skipping insertion in model container [2022-11-21 16:55:00,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:55:00" (1/1) ... [2022-11-21 16:55:00,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:55:00,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:55:00,354 WARN L237 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_da9526cd-85ab-478a-9e03-a59017e8a7f4/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[914,927] [2022-11-21 16:55:00,416 WARN L237 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_da9526cd-85ab-478a-9e03-a59017e8a7f4/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[7125,7138] [2022-11-21 16:55:00,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:55:00,553 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:55:00,569 WARN L237 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_da9526cd-85ab-478a-9e03-a59017e8a7f4/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[914,927] [2022-11-21 16:55:00,596 WARN L237 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_da9526cd-85ab-478a-9e03-a59017e8a7f4/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[7125,7138] [2022-11-21 16:55:00,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:55:00,689 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:55:00,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00 WrapperNode [2022-11-21 16:55:00,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:55:00,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:55:00,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:55:00,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:55:00,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00" (1/1) ... [2022-11-21 16:55:00,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00" (1/1) ... [2022-11-21 16:55:00,762 INFO L138 Inliner]: procedures = 63, calls = 73, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 635 [2022-11-21 16:55:00,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:55:00,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:55:00,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:55:00,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:55:00,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00" (1/1) ... [2022-11-21 16:55:00,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00" (1/1) ... [2022-11-21 16:55:00,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00" (1/1) ... [2022-11-21 16:55:00,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00" (1/1) ... [2022-11-21 16:55:00,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00" (1/1) ... [2022-11-21 16:55:00,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00" (1/1) ... [2022-11-21 16:55:00,817 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00" (1/1) ... [2022-11-21 16:55:00,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00" (1/1) ... [2022-11-21 16:55:00,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:55:00,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:55:00,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:55:00,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:55:00,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00" (1/1) ... [2022-11-21 16:55:00,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:55:00,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:55:00,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:55:00,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:55:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:55:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-21 16:55:00,960 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-21 16:55:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-21 16:55:00,968 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-21 16:55:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-21 16:55:00,968 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-21 16:55:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-21 16:55:00,970 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-21 16:55:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-21 16:55:00,970 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-21 16:55:00,971 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-21 16:55:00,971 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-21 16:55:00,971 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-21 16:55:00,971 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-21 16:55:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-21 16:55:00,972 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-21 16:55:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-21 16:55:00,972 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-21 16:55:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-21 16:55:00,973 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-21 16:55:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-21 16:55:00,973 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-21 16:55:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:55:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-21 16:55:00,974 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-21 16:55:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-21 16:55:00,975 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-21 16:55:00,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:55:00,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:55:00,976 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-21 16:55:00,976 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-21 16:55:01,117 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:55:01,133 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:55:02,122 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:55:02,135 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:55:02,136 INFO L300 CfgBuilder]: Removed 12 assume(true) statements. [2022-11-21 16:55:02,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:55:02 BoogieIcfgContainer [2022-11-21 16:55:02,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:55:02,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:55:02,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:55:02,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:55:02,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:55:00" (1/3) ... [2022-11-21 16:55:02,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7546cd84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:55:02, skipping insertion in model container [2022-11-21 16:55:02,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:00" (2/3) ... [2022-11-21 16:55:02,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7546cd84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:55:02, skipping insertion in model container [2022-11-21 16:55:02,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:55:02" (3/3) ... [2022-11-21 16:55:02,153 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2022-11-21 16:55:02,195 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:55:02,195 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-21 16:55:02,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:55:02,316 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;@5fe6f5c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:55:02,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-21 16:55:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 265 states have internal predecessors, (412), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-11-21 16:55:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 16:55:02,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:55:02,349 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-21 16:55:02,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:55:02,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:02,359 INFO L85 PathProgramCache]: Analyzing trace with hash 961710808, now seen corresponding path program 1 times [2022-11-21 16:55:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:02,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805397904] [2022-11-21 16:55:02,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:02,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:55:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:02,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:55:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:02,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:55:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:02,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:55:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:02,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:55:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:02,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 16:55:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:02,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:55:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:02,959 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-21 16:55:02,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:55:02,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805397904] [2022-11-21 16:55:02,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805397904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:55:02,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:55:02,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:55:02,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544720083] [2022-11-21 16:55:02,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:55:02,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:55:02,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:55:03,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:55:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:55:03,039 INFO L87 Difference]: Start difference. First operand has 309 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 265 states have internal predecessors, (412), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:55:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:55:04,168 INFO L93 Difference]: Finished difference Result 615 states and 953 transitions. [2022-11-21 16:55:04,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:55:04,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-11-21 16:55:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:55:04,202 INFO L225 Difference]: With dead ends: 615 [2022-11-21 16:55:04,202 INFO L226 Difference]: Without dead ends: 317 [2022-11-21 16:55:04,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:55:04,221 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 651 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:55:04,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 826 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:55:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-21 16:55:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 299. [2022-11-21 16:55:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-21 16:55:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 440 transitions. [2022-11-21 16:55:04,307 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 440 transitions. Word has length 59 [2022-11-21 16:55:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:55:04,307 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 440 transitions. [2022-11-21 16:55:04,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:55:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 440 transitions. [2022-11-21 16:55:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 16:55:04,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:55:04,312 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-21 16:55:04,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:55:04,312 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:55:04,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:04,313 INFO L85 PathProgramCache]: Analyzing trace with hash 977229526, now seen corresponding path program 1 times [2022-11-21 16:55:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:04,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166748771] [2022-11-21 16:55:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:04,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:04,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:55:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:04,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:55:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:04,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:55:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:04,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:55:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:04,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:55:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:04,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 16:55:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:04,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:55:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:04,612 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-21 16:55:04,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:55:04,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166748771] [2022-11-21 16:55:04,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166748771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:55:04,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:55:04,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:55:04,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217635230] [2022-11-21 16:55:04,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:55:04,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:55:04,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:55:04,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:55:04,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:55:04,618 INFO L87 Difference]: Start difference. First operand 299 states and 440 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:55:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:55:05,957 INFO L93 Difference]: Finished difference Result 524 states and 756 transitions. [2022-11-21 16:55:05,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:55:05,958 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-21 16:55:05,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:55:05,961 INFO L225 Difference]: With dead ends: 524 [2022-11-21 16:55:05,962 INFO L226 Difference]: Without dead ends: 435 [2022-11-21 16:55:05,963 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-21 16:55:05,964 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 797 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:55:05,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1263 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-21 16:55:05,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-11-21 16:55:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 395. [2022-11-21 16:55:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-11-21 16:55:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2022-11-21 16:55:06,018 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 59 [2022-11-21 16:55:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:55:06,019 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2022-11-21 16:55:06,019 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-21 16:55:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2022-11-21 16:55:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 16:55:06,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:55:06,022 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-21 16:55:06,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:55:06,023 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:55:06,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1739879157, now seen corresponding path program 1 times [2022-11-21 16:55:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:06,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935008192] [2022-11-21 16:55:06,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:06,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:06,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:55:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:06,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:55:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:55:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:06,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:55:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:06,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:55:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 16:55:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:06,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:55:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:06,492 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-21 16:55:06,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:55:06,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935008192] [2022-11-21 16:55:06,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935008192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:55:06,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:55:06,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:55:06,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142888419] [2022-11-21 16:55:06,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:55:06,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:55:06,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:55:06,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:55:06,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:55:06,497 INFO L87 Difference]: Start difference. First operand 395 states and 571 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:55:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:55:08,045 INFO L93 Difference]: Finished difference Result 744 states and 1049 transitions. [2022-11-21 16:55:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 16:55:08,048 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-21 16:55:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:55:08,058 INFO L225 Difference]: With dead ends: 744 [2022-11-21 16:55:08,058 INFO L226 Difference]: Without dead ends: 566 [2022-11-21 16:55:08,067 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-21 16:55:08,072 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 1111 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:55:08,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 1311 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-21 16:55:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-11-21 16:55:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 491. [2022-11-21 16:55:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 411 states have internal predecessors, (582), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-21 16:55:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 704 transitions. [2022-11-21 16:55:08,176 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 704 transitions. Word has length 59 [2022-11-21 16:55:08,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:55:08,177 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 704 transitions. [2022-11-21 16:55:08,177 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-21 16:55:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 704 transitions. [2022-11-21 16:55:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 16:55:08,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:55:08,189 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-21 16:55:08,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:55:08,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:55:08,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:08,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1661601801, now seen corresponding path program 1 times [2022-11-21 16:55:08,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:08,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897773078] [2022-11-21 16:55:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:08,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:08,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:55:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:08,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:55:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:08,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:55:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:08,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:55:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:55:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 16:55:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:55:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:08,556 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-21 16:55:08,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:55:08,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897773078] [2022-11-21 16:55:08,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897773078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:55:08,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:55:08,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:55:08,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302838384] [2022-11-21 16:55:08,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:55:08,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:55:08,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:55:08,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:55:08,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:55:08,560 INFO L87 Difference]: Start difference. First operand 491 states and 704 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:55:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:55:09,848 INFO L93 Difference]: Finished difference Result 793 states and 1119 transitions. [2022-11-21 16:55:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:55:09,849 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-21 16:55:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:55:09,859 INFO L225 Difference]: With dead ends: 793 [2022-11-21 16:55:09,859 INFO L226 Difference]: Without dead ends: 525 [2022-11-21 16:55:09,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:55:09,869 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 555 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:55:09,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1546 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-21 16:55:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-11-21 16:55:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 496. [2022-11-21 16:55:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 406 states have (on average 1.438423645320197) internal successors, (584), 415 states have internal predecessors, (584), 56 states have call successors, (56), 28 states have call predecessors, (56), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2022-11-21 16:55:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 707 transitions. [2022-11-21 16:55:09,937 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 707 transitions. Word has length 59 [2022-11-21 16:55:09,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:55:09,937 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 707 transitions. [2022-11-21 16:55:09,938 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-21 16:55:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 707 transitions. [2022-11-21 16:55:09,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 16:55:09,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:55:09,940 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-21 16:55:09,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:55:09,940 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:55:09,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:09,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1386842187, now seen corresponding path program 1 times [2022-11-21 16:55:09,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:09,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295350973] [2022-11-21 16:55:09,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:09,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:10,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:55:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:10,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:55:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:10,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:55:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:10,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:55:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:10,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:55:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:10,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 16:55:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:10,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:55:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:10,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-21 16:55:10,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:55:10,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295350973] [2022-11-21 16:55:10,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295350973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:55:10,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:55:10,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:55:10,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282358126] [2022-11-21 16:55:10,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:55:10,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:55:10,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:55:10,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:55:10,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:55:10,169 INFO L87 Difference]: Start difference. First operand 496 states and 707 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:55:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:55:11,444 INFO L93 Difference]: Finished difference Result 815 states and 1141 transitions. [2022-11-21 16:55:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:55:11,445 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-21 16:55:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:55:11,449 INFO L225 Difference]: With dead ends: 815 [2022-11-21 16:55:11,449 INFO L226 Difference]: Without dead ends: 542 [2022-11-21 16:55:11,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:55:11,452 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 377 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:55:11,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1736 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-21 16:55:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-11-21 16:55:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 511. [2022-11-21 16:55:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 427 states have internal predecessors, (596), 56 states have call successors, (56), 28 states have call predecessors, (56), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2022-11-21 16:55:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 722 transitions. [2022-11-21 16:55:11,503 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 722 transitions. Word has length 59 [2022-11-21 16:55:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:55:11,504 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 722 transitions. [2022-11-21 16:55:11,504 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-21 16:55:11,504 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 722 transitions. [2022-11-21 16:55:11,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 16:55:11,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:55:11,506 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-21 16:55:11,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:55:11,507 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:55:11,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:11,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1102686775, now seen corresponding path program 1 times [2022-11-21 16:55:11,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:11,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611553562] [2022-11-21 16:55:11,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:11,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:11,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:55:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:11,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:55:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:11,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:55:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:11,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:55:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:11,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:55:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:11,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 16:55:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:11,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:55:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:11,732 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-21 16:55:11,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:55:11,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611553562] [2022-11-21 16:55:11,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611553562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:55:11,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:55:11,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:55:11,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374525811] [2022-11-21 16:55:11,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:55:11,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:55:11,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:55:11,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:55:11,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:55:11,736 INFO L87 Difference]: Start difference. First operand 511 states and 722 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:55:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:55:13,166 INFO L93 Difference]: Finished difference Result 905 states and 1235 transitions. [2022-11-21 16:55:13,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 16:55:13,167 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-21 16:55:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:55:13,171 INFO L225 Difference]: With dead ends: 905 [2022-11-21 16:55:13,172 INFO L226 Difference]: Without dead ends: 619 [2022-11-21 16:55:13,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-21 16:55:13,174 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 1077 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:55:13,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 1123 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-21 16:55:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-11-21 16:55:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 523. [2022-11-21 16:55:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 437 states have internal predecessors, (606), 57 states have call successors, (57), 29 states have call predecessors, (57), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2022-11-21 16:55:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 732 transitions. [2022-11-21 16:55:13,240 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 732 transitions. Word has length 59 [2022-11-21 16:55:13,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:55:13,241 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 732 transitions. [2022-11-21 16:55:13,241 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-21 16:55:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 732 transitions. [2022-11-21 16:55:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 16:55:13,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:55:13,244 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-21 16:55:13,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:55:13,244 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:55:13,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:13,245 INFO L85 PathProgramCache]: Analyzing trace with hash -891457931, now seen corresponding path program 1 times [2022-11-21 16:55:13,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:13,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75338296] [2022-11-21 16:55:13,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:55:13,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:55:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:55:13,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:55:13,318 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:55:13,320 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-21 16:55:13,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-21 16:55:13,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:55:13,328 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:55:13,334 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:55:13,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:55:13 BoogieIcfgContainer [2022-11-21 16:55:13,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:55:13,470 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:55:13,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:55:13,471 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:55:13,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:55:02" (3/4) ... [2022-11-21 16:55:13,474 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 16:55:13,601 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:55:13,601 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:55:13,602 INFO L158 Benchmark]: Toolchain (without parser) took 13504.27ms. Allocated memory was 142.6MB in the beginning and 257.9MB in the end (delta: 115.3MB). Free memory was 87.0MB in the beginning and 94.4MB in the end (delta: -7.4MB). Peak memory consumption was 109.7MB. Max. memory is 16.1GB. [2022-11-21 16:55:13,602 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 142.6MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:55:13,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.21ms. Allocated memory was 142.6MB in the beginning and 213.9MB in the end (delta: 71.3MB). Free memory was 86.7MB in the beginning and 181.8MB in the end (delta: -95.1MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2022-11-21 16:55:13,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.57ms. Allocated memory is still 213.9MB. Free memory was 181.8MB in the beginning and 178.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 16:55:13,603 INFO L158 Benchmark]: Boogie Preprocessor took 63.20ms. Allocated memory is still 213.9MB. Free memory was 178.5MB in the beginning and 175.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:55:13,604 INFO L158 Benchmark]: RCFGBuilder took 1311.95ms. Allocated memory is still 213.9MB. Free memory was 175.5MB in the beginning and 137.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-21 16:55:13,605 INFO L158 Benchmark]: TraceAbstraction took 11326.88ms. Allocated memory was 213.9MB in the beginning and 257.9MB in the end (delta: 44.0MB). Free memory was 136.6MB in the beginning and 104.9MB in the end (delta: 31.7MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2022-11-21 16:55:13,605 INFO L158 Benchmark]: Witness Printer took 130.63ms. Allocated memory is still 257.9MB. Free memory was 104.9MB in the beginning and 94.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 16:55:13,609 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.26ms. Allocated memory is still 142.6MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.21ms. Allocated memory was 142.6MB in the beginning and 213.9MB in the end (delta: 71.3MB). Free memory was 86.7MB in the beginning and 181.8MB in the end (delta: -95.1MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.57ms. Allocated memory is still 213.9MB. Free memory was 181.8MB in the beginning and 178.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.20ms. Allocated memory is still 213.9MB. Free memory was 178.5MB in the beginning and 175.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1311.95ms. Allocated memory is still 213.9MB. Free memory was 175.5MB in the beginning and 137.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11326.88ms. Allocated memory was 213.9MB in the beginning and 257.9MB in the end (delta: 44.0MB). Free memory was 136.6MB in the beginning and 104.9MB in the end (delta: 31.7MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. * Witness Printer took 130.63ms. Allocated memory is still 257.9MB. Free memory was 104.9MB in the beginning and 94.4MB in the end (delta: 10.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: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int m_st ; [L507] int t1_st ; [L508] int t2_st ; [L509] int t3_st ; [L510] int t4_st ; [L511] int t5_st ; [L512] int m_i ; [L513] int t1_i ; [L514] int t2_i ; [L515] int t3_i ; [L516] int t4_i ; [L517] int t5_i ; [L518] int M_E = 2; [L519] int T1_E = 2; [L520] int T2_E = 2; [L521] int T3_E = 2; [L522] int T4_E = 2; [L523] int T5_E = 2; [L524] int E_M = 2; [L525] int E_1 = 2; [L526] int E_2 = 2; [L527] int E_3 = 2; [L528] int E_4 = 2; [L529] int E_5 = 2; [L537] int token ; [L539] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L1462] COND TRUE __VERIFIER_nondet_int() [L1463] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 309 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4633 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4568 mSDsluCounter, 7805 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6187 mSDsCounter, 823 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6116 IncrementalHoareTripleChecker+Invalid, 6939 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 823 mSolverCounterUnsat, 1618 mSDtfsCounter, 6116 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred in iteration=6, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 289 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-21 16:55:13,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da9526cd-85ab-478a-9e03-a59017e8a7f4/bin/uautomizer-vX5HgA9Q3a/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