./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN --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 c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c --- 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-6b4ec56 [2022-11-20 12:07:37,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:07:37,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:07:37,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:07:37,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:07:37,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:07:37,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:07:37,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:07:37,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:07:37,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:07:37,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:07:37,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:07:37,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:07:37,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:07:37,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:07:37,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:07:37,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:07:37,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:07:37,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:07:37,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:07:37,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:07:37,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:07:37,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:07:37,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:07:37,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:07:37,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:07:37,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:07:37,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:07:37,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:07:37,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:07:37,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:07:37,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:07:37,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:07:37,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:07:37,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:07:37,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:07:37,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:07:37,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:07:37,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:07:37,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:07:37,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:07:37,135 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:07:37,189 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:07:37,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:07:37,191 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:07:37,191 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:07:37,192 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:07:37,192 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:07:37,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:07:37,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:07:37,194 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:07:37,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:07:37,195 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:07:37,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:07:37,196 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:07:37,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:07:37,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:07:37,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:07:37,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:07:37,197 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:07:37,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:07:37,197 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:07:37,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:07:37,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:07:37,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:07:37,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:07:37,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:07:37,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:07:37,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:07:37,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:07:37,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:07:37,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:07:37,200 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:07:37,201 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:07:37,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:07:37,201 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_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/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_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN 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 -> c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c [2022-11-20 12:07:37,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:07:37,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:07:37,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:07:37,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:07:37,527 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:07:37,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2022-11-20 12:07:41,163 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:07:41,414 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:07:41,427 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2022-11-20 12:07:41,450 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/data/d239c0999/7967f763cd2c4db9ad5a0a93ee25ab4f/FLAGb0e175144 [2022-11-20 12:07:41,469 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/data/d239c0999/7967f763cd2c4db9ad5a0a93ee25ab4f [2022-11-20 12:07:41,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:07:41,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:07:41,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:07:41,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:07:41,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:07:41,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:07:41" (1/1) ... [2022-11-20 12:07:41,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bfaac9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41, skipping insertion in model container [2022-11-20 12:07:41,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:07:41" (1/1) ... [2022-11-20 12:07:41,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:07:41,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:07:41,715 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_c847a733-d258-4cbb-a808-2f8280a03146/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2022-11-20 12:07:41,773 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_c847a733-d258-4cbb-a808-2f8280a03146/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2022-11-20 12:07:41,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:07:41,833 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:07:41,847 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_c847a733-d258-4cbb-a808-2f8280a03146/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2022-11-20 12:07:41,872 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_c847a733-d258-4cbb-a808-2f8280a03146/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2022-11-20 12:07:41,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:07:41,920 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:07:41,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41 WrapperNode [2022-11-20 12:07:41,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:07:41,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:07:41,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:07:41,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:07:41,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41" (1/1) ... [2022-11-20 12:07:41,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41" (1/1) ... [2022-11-20 12:07:42,009 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 461 [2022-11-20 12:07:42,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:07:42,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:07:42,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:07:42,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:07:42,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41" (1/1) ... [2022-11-20 12:07:42,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41" (1/1) ... [2022-11-20 12:07:42,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41" (1/1) ... [2022-11-20 12:07:42,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41" (1/1) ... [2022-11-20 12:07:42,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41" (1/1) ... [2022-11-20 12:07:42,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41" (1/1) ... [2022-11-20 12:07:42,049 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41" (1/1) ... [2022-11-20 12:07:42,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41" (1/1) ... [2022-11-20 12:07:42,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:07:42,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:07:42,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:07:42,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:07:42,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41" (1/1) ... [2022-11-20 12:07:42,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:07:42,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:42,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:42,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:07:42,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:07:42,177 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-20 12:07:42,178 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-20 12:07:42,178 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-20 12:07:42,178 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-20 12:07:42,178 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-20 12:07:42,178 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-20 12:07:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-20 12:07:42,179 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-20 12:07:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-20 12:07:42,179 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-20 12:07:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-20 12:07:42,180 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-20 12:07:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-20 12:07:42,180 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-20 12:07:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-20 12:07:42,180 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-20 12:07:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-20 12:07:42,181 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-20 12:07:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-20 12:07:42,181 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-20 12:07:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-20 12:07:42,181 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-20 12:07:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:07:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-20 12:07:42,182 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-20 12:07:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-20 12:07:42,182 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-20 12:07:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:07:42,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:07:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-20 12:07:42,183 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-20 12:07:42,304 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:07:42,307 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:07:43,052 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:07:43,064 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:07:43,065 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-20 12:07:43,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:07:43 BoogieIcfgContainer [2022-11-20 12:07:43,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:07:43,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:07:43,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:07:43,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:07:43,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:07:41" (1/3) ... [2022-11-20 12:07:43,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b448b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:07:43, skipping insertion in model container [2022-11-20 12:07:43,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:41" (2/3) ... [2022-11-20 12:07:43,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b448b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:07:43, skipping insertion in model container [2022-11-20 12:07:43,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:07:43" (3/3) ... [2022-11-20 12:07:43,080 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2022-11-20 12:07:43,100 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:07:43,100 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 12:07:43,175 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:07:43,183 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;@3d5441cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:07:43,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 12:07:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 186 states have (on average 1.553763440860215) internal successors, (289), 193 states have internal predecessors, (289), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-20 12:07:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 12:07:43,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:07:43,204 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-20 12:07:43,205 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:07:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash 381071048, now seen corresponding path program 1 times [2022-11-20 12:07:43,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:43,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541157996] [2022-11-20 12:07:43,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:43,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 12:07:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:43,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:07:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:43,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:07:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:43,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:07:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:43,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:07:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:43,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:07:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:43,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 12:07:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:43,608 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-20 12:07:43,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:43,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541157996] [2022-11-20 12:07:43,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541157996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:43,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:07:43,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:07:43,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014756518] [2022-11-20 12:07:43,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:43,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:07:43,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:43,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:07:43,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:07:43,685 INFO L87 Difference]: Start difference. First operand has 234 states, 186 states have (on average 1.553763440860215) internal successors, (289), 193 states have internal predecessors, (289), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) 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-20 12:07:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:44,671 INFO L93 Difference]: Finished difference Result 469 states and 703 transitions. [2022-11-20 12:07:44,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:07:44,678 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-20 12:07:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:07:44,702 INFO L225 Difference]: With dead ends: 469 [2022-11-20 12:07:44,703 INFO L226 Difference]: Without dead ends: 242 [2022-11-20 12:07:44,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:07:44,719 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 463 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:07:44,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 589 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 12:07:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-20 12:07:44,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 224. [2022-11-20 12:07:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-20 12:07:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 317 transitions. [2022-11-20 12:07:44,798 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 317 transitions. Word has length 59 [2022-11-20 12:07:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:07:44,799 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 317 transitions. [2022-11-20 12:07:44,799 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-20 12:07:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 317 transitions. [2022-11-20 12:07:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 12:07:44,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:07:44,805 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-20 12:07:44,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:07:44,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:07:44,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:44,815 INFO L85 PathProgramCache]: Analyzing trace with hash 862151306, now seen corresponding path program 1 times [2022-11-20 12:07:44,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:44,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5328579] [2022-11-20 12:07:44,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:44,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:45,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 12:07:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:45,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:07:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:45,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:07:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:45,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:07:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:45,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:07:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:45,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:07:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:45,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 12:07:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:45,198 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-20 12:07:45,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:45,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5328579] [2022-11-20 12:07:45,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5328579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:45,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:07:45,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:07:45,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212283775] [2022-11-20 12:07:45,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:45,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:07:45,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:45,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:07:45,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:07:45,211 INFO L87 Difference]: Start difference. First operand 224 states and 317 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-20 12:07:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:46,405 INFO L93 Difference]: Finished difference Result 449 states and 633 transitions. [2022-11-20 12:07:46,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:07:46,406 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-20 12:07:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:07:46,410 INFO L225 Difference]: With dead ends: 449 [2022-11-20 12:07:46,410 INFO L226 Difference]: Without dead ends: 360 [2022-11-20 12:07:46,411 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-20 12:07:46,413 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 611 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 12:07:46,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 910 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 12:07:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-11-20 12:07:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 320. [2022-11-20 12:07:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-11-20 12:07:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions. [2022-11-20 12:07:46,467 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 59 [2022-11-20 12:07:46,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:07:46,467 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 448 transitions. [2022-11-20 12:07:46,468 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-20 12:07:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions. [2022-11-20 12:07:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 12:07:46,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:07:46,471 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-20 12:07:46,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:07:46,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:07:46,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:46,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1624800937, now seen corresponding path program 1 times [2022-11-20 12:07:46,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:46,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049351819] [2022-11-20 12:07:46,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:46,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 12:07:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:46,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:07:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:46,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:07:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:46,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:07:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:46,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:07:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:46,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:07:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 12:07:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:46,684 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-20 12:07:46,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:46,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049351819] [2022-11-20 12:07:46,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049351819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:46,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:07:46,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:07:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228187339] [2022-11-20 12:07:46,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:46,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:07:46,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:46,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:07:46,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:07:46,689 INFO L87 Difference]: Start difference. First operand 320 states and 448 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-20 12:07:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:47,741 INFO L93 Difference]: Finished difference Result 535 states and 743 transitions. [2022-11-20 12:07:47,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:07:47,743 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-20 12:07:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:07:47,747 INFO L225 Difference]: With dead ends: 535 [2022-11-20 12:07:47,747 INFO L226 Difference]: Without dead ends: 357 [2022-11-20 12:07:47,753 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-20 12:07:47,757 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 376 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:07:47,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1129 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 12:07:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-11-20 12:07:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 325. [2022-11-20 12:07:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-11-20 12:07:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 452 transitions. [2022-11-20 12:07:47,820 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 452 transitions. Word has length 59 [2022-11-20 12:07:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:07:47,821 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 452 transitions. [2022-11-20 12:07:47,822 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-20 12:07:47,822 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 452 transitions. [2022-11-20 12:07:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 12:07:47,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:07:47,836 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-20 12:07:47,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:07:47,837 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:07:47,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:47,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1899560551, now seen corresponding path program 1 times [2022-11-20 12:07:47,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:47,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647836655] [2022-11-20 12:07:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:47,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:47,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 12:07:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:47,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:07:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:48,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:07:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:48,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:07:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:48,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:07:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:48,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:07:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:48,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 12:07:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:48,066 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-20 12:07:48,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:48,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647836655] [2022-11-20 12:07:48,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647836655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:48,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:07:48,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:07:48,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17892] [2022-11-20 12:07:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:48,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:07:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:48,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:07:48,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:07:48,071 INFO L87 Difference]: Start difference. First operand 325 states and 452 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-20 12:07:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:50,507 INFO L93 Difference]: Finished difference Result 1239 states and 1680 transitions. [2022-11-20 12:07:50,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 12:07:50,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-11-20 12:07:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:07:50,514 INFO L225 Difference]: With dead ends: 1239 [2022-11-20 12:07:50,514 INFO L226 Difference]: Without dead ends: 1044 [2022-11-20 12:07:50,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-20 12:07:50,517 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 2135 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2151 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:07:50,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2151 Valid, 1293 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-20 12:07:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2022-11-20 12:07:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 906. [2022-11-20 12:07:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 735 states have internal predecessors, (980), 99 states have call successors, (99), 74 states have call predecessors, (99), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-11-20 12:07:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1193 transitions. [2022-11-20 12:07:50,613 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1193 transitions. Word has length 59 [2022-11-20 12:07:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:07:50,614 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 1193 transitions. [2022-11-20 12:07:50,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-20 12:07:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1193 transitions. [2022-11-20 12:07:50,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 12:07:50,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:07:50,616 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-20 12:07:50,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:07:50,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:07:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:50,617 INFO L85 PathProgramCache]: Analyzing trace with hash 927885864, now seen corresponding path program 1 times [2022-11-20 12:07:50,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:50,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827863659] [2022-11-20 12:07:50,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 12:07:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:50,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:07:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:50,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:07:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:50,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:07:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:50,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:07:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:50,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:07:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:50,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 12:07:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:50,822 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-20 12:07:50,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:50,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827863659] [2022-11-20 12:07:50,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827863659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:50,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:07:50,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:07:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713808746] [2022-11-20 12:07:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:50,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:07:50,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:50,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:07:50,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:07:50,826 INFO L87 Difference]: Start difference. First operand 906 states and 1193 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-20 12:07:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:51,938 INFO L93 Difference]: Finished difference Result 1788 states and 2337 transitions. [2022-11-20 12:07:51,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:07:51,939 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-20 12:07:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:07:51,945 INFO L225 Difference]: With dead ends: 1788 [2022-11-20 12:07:51,945 INFO L226 Difference]: Without dead ends: 1018 [2022-11-20 12:07:51,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-20 12:07:51,948 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 379 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:07:51,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1127 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 12:07:51,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2022-11-20 12:07:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 926. [2022-11-20 12:07:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 736 states have (on average 1.346467391304348) internal successors, (991), 751 states have internal predecessors, (991), 99 states have call successors, (99), 74 states have call predecessors, (99), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-11-20 12:07:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1208 transitions. [2022-11-20 12:07:52,063 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1208 transitions. Word has length 59 [2022-11-20 12:07:52,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:07:52,064 INFO L495 AbstractCegarLoop]: Abstraction has 926 states and 1208 transitions. [2022-11-20 12:07:52,064 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-20 12:07:52,064 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1208 transitions. [2022-11-20 12:07:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 12:07:52,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:07:52,066 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-20 12:07:52,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:07:52,066 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:07:52,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash -877552470, now seen corresponding path program 1 times [2022-11-20 12:07:52,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:52,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482713821] [2022-11-20 12:07:52,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:52,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 12:07:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:07:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:07:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:07:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:07:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:07:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 12:07:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,367 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-20 12:07:52,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:52,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482713821] [2022-11-20 12:07:52,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482713821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:52,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:07:52,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:07:52,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230068876] [2022-11-20 12:07:52,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:52,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:07:52,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:52,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:07:52,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:07:52,379 INFO L87 Difference]: Start difference. First operand 926 states and 1208 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-20 12:07:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:53,597 INFO L93 Difference]: Finished difference Result 2496 states and 3157 transitions. [2022-11-20 12:07:53,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 12:07:53,598 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-20 12:07:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:07:53,608 INFO L225 Difference]: With dead ends: 2496 [2022-11-20 12:07:53,608 INFO L226 Difference]: Without dead ends: 1707 [2022-11-20 12:07:53,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-20 12:07:53,617 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 644 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 12:07:53,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 958 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 12:07:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-11-20 12:07:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1374. [2022-11-20 12:07:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1113 states have internal predecessors, (1440), 145 states have call successors, (145), 113 states have call predecessors, (145), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-11-20 12:07:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1775 transitions. [2022-11-20 12:07:53,756 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1775 transitions. Word has length 59 [2022-11-20 12:07:53,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:07:53,759 INFO L495 AbstractCegarLoop]: Abstraction has 1374 states and 1775 transitions. [2022-11-20 12:07:53,759 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-20 12:07:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1775 transitions. [2022-11-20 12:07:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 12:07:53,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:07:53,760 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-20 12:07:53,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:07:53,761 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:07:53,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:53,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1423270120, now seen corresponding path program 1 times [2022-11-20 12:07:53,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:53,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577193668] [2022-11-20 12:07:53,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:53,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:53,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:53,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:53,839 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:07:53,841 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-20 12:07:53,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-20 12:07:53,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:07:53,847 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:07:53,851 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:07:53,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:07:53 BoogieIcfgContainer [2022-11-20 12:07:53,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:07:53,987 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:07:53,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:07:53,988 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:07:53,988 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:07:43" (3/4) ... [2022-11-20 12:07:53,991 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 12:07:54,137 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:07:54,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:07:54,138 INFO L158 Benchmark]: Toolchain (without parser) took 12665.04ms. Allocated memory was 127.9MB in the beginning and 239.1MB in the end (delta: 111.1MB). Free memory was 81.6MB in the beginning and 200.6MB in the end (delta: -119.0MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. [2022-11-20 12:07:54,139 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 90.2MB. Free memory was 41.9MB in the beginning and 41.8MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:07:54,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.02ms. Allocated memory is still 127.9MB. Free memory was 81.6MB in the beginning and 64.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 12:07:54,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.22ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 64.3MB in the beginning and 137.4MB in the end (delta: -73.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-11-20 12:07:54,140 INFO L158 Benchmark]: Boogie Preprocessor took 46.55ms. Allocated memory is still 165.7MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:07:54,140 INFO L158 Benchmark]: RCFGBuilder took 1011.04ms. Allocated memory is still 165.7MB. Free memory was 135.3MB in the beginning and 104.9MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-20 12:07:54,141 INFO L158 Benchmark]: TraceAbstraction took 10915.55ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 104.9MB in the beginning and 76.8MB in the end (delta: 28.0MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2022-11-20 12:07:54,141 INFO L158 Benchmark]: Witness Printer took 150.42ms. Allocated memory is still 239.1MB. Free memory was 76.8MB in the beginning and 200.6MB in the end (delta: -123.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 12:07:54,146 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.38ms. Allocated memory is still 90.2MB. Free memory was 41.9MB in the beginning and 41.8MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.02ms. Allocated memory is still 127.9MB. Free memory was 81.6MB in the beginning and 64.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.22ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 64.3MB in the beginning and 137.4MB in the end (delta: -73.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.55ms. Allocated memory is still 165.7MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1011.04ms. Allocated memory is still 165.7MB. Free memory was 135.3MB in the beginning and 104.9MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10915.55ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 104.9MB in the beginning and 76.8MB in the end (delta: 28.0MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. * Witness Printer took 150.42ms. Allocated memory is still 239.1MB. Free memory was 76.8MB in the beginning and 200.6MB in the end (delta: -123.8MB). 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 m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] 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_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, token=0] [L1087] COND TRUE __VERIFIER_nondet_int() [L1088] 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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, 234 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4661 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4608 mSDsluCounter, 6006 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4737 mSDsCounter, 1167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5207 IncrementalHoareTripleChecker+Invalid, 6374 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1167 mSolverCounterUnsat, 1269 mSDtfsCounter, 5207 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1374occurred in iteration=6, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 653 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 733 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-20 12:07:54,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c847a733-d258-4cbb-a808-2f8280a03146/bin/uautomizer-ug76WZFUDN/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