./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe016_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe016_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS --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 e946e8dea30db7efb52f6f71a24f03cd895152f9df0eae9d8d1291d135f806ee --- 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-4e7fbc6 [2022-11-23 01:53:05,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:53:05,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:53:05,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:53:05,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:53:05,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:53:05,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:53:05,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:53:05,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:53:05,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:53:05,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:53:05,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:53:05,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:53:05,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:53:05,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:53:05,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:53:05,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:53:05,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:53:05,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:53:05,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:53:05,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:53:05,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:53:05,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:53:05,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:53:05,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:53:05,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:53:05,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:53:05,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:53:05,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:53:05,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:53:05,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:53:05,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:53:05,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:53:05,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:53:05,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:53:05,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:53:05,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:53:05,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:53:05,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:53:05,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:53:05,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:53:05,373 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 01:53:05,399 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:53:05,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:53:05,400 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:53:05,400 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:53:05,401 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 01:53:05,402 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 01:53:05,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:53:05,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:53:05,403 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:53:05,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:53:05,404 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 01:53:05,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:53:05,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 01:53:05,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:53:05,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 01:53:05,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 01:53:05,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 01:53:05,405 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 01:53:05,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 01:53:05,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:53:05,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 01:53:05,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:53:05,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:53:05,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 01:53:05,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:53:05,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:53:05,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 01:53:05,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 01:53:05,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 01:53:05,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 01:53:05,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 01:53:05,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 01:53:05,409 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 01:53:05,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 01:53:05,409 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/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_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS 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 -> e946e8dea30db7efb52f6f71a24f03cd895152f9df0eae9d8d1291d135f806ee [2022-11-23 01:53:05,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:53:05,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:53:05,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:53:05,752 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:53:05,753 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:53:05,754 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/safe016_rmo.opt.i [2022-11-23 01:53:08,892 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:53:09,152 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:53:09,152 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/sv-benchmarks/c/pthread-wmm/safe016_rmo.opt.i [2022-11-23 01:53:09,173 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/data/ab3b04559/0b6b9cbbcd2e43aea9dd8d401eec4b0b/FLAG1b7d1946e [2022-11-23 01:53:09,188 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/data/ab3b04559/0b6b9cbbcd2e43aea9dd8d401eec4b0b [2022-11-23 01:53:09,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:53:09,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:53:09,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:53:09,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:53:09,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:53:09,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:53:09" (1/1) ... [2022-11-23 01:53:09,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5185cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09, skipping insertion in model container [2022-11-23 01:53:09,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:53:09" (1/1) ... [2022-11-23 01:53:09,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:53:09,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:53:09,465 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_c863d25b-bc9a-4454-9aa1-4ece2c340b18/sv-benchmarks/c/pthread-wmm/safe016_rmo.opt.i[949,962] [2022-11-23 01:53:09,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:53:09,783 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:53:09,798 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_c863d25b-bc9a-4454-9aa1-4ece2c340b18/sv-benchmarks/c/pthread-wmm/safe016_rmo.opt.i[949,962] [2022-11-23 01:53:09,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:53:09,949 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:53:09,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09 WrapperNode [2022-11-23 01:53:09,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:53:09,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:53:09,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:53:09,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:53:09,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09" (1/1) ... [2022-11-23 01:53:09,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09" (1/1) ... [2022-11-23 01:53:10,041 INFO L138 Inliner]: procedures = 177, calls = 89, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 181 [2022-11-23 01:53:10,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:53:10,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:53:10,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:53:10,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:53:10,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09" (1/1) ... [2022-11-23 01:53:10,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09" (1/1) ... [2022-11-23 01:53:10,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09" (1/1) ... [2022-11-23 01:53:10,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09" (1/1) ... [2022-11-23 01:53:10,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09" (1/1) ... [2022-11-23 01:53:10,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09" (1/1) ... [2022-11-23 01:53:10,121 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09" (1/1) ... [2022-11-23 01:53:10,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09" (1/1) ... [2022-11-23 01:53:10,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:53:10,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:53:10,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:53:10,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:53:10,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09" (1/1) ... [2022-11-23 01:53:10,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:53:10,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:53:10,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 01:53:10,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 01:53:10,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 01:53:10,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 01:53:10,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 01:53:10,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 01:53:10,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 01:53:10,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 01:53:10,234 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 01:53:10,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 01:53:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 01:53:10,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 01:53:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 01:53:10,236 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 01:53:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 01:53:10,236 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 01:53:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 01:53:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 01:53:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:53:10,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:53:10,240 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 01:53:10,451 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:53:10,454 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:53:11,082 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:53:11,507 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:53:11,507 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 01:53:11,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:53:11 BoogieIcfgContainer [2022-11-23 01:53:11,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:53:11,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 01:53:11,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 01:53:11,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 01:53:11,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:53:09" (1/3) ... [2022-11-23 01:53:11,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e901dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:53:11, skipping insertion in model container [2022-11-23 01:53:11,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:09" (2/3) ... [2022-11-23 01:53:11,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e901dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:53:11, skipping insertion in model container [2022-11-23 01:53:11,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:53:11" (3/3) ... [2022-11-23 01:53:11,525 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.opt.i [2022-11-23 01:53:11,560 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 01:53:11,587 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 01:53:11,588 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 01:53:11,588 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 01:53:11,711 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 01:53:11,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-11-23 01:53:11,875 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-23 01:53:11,875 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:53:11,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-11-23 01:53:11,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow [2022-11-23 01:53:11,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 131 transitions, 274 flow [2022-11-23 01:53:11,906 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 01:53:11,930 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 131 transitions, 274 flow [2022-11-23 01:53:11,933 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 131 transitions, 274 flow [2022-11-23 01:53:11,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 131 transitions, 274 flow [2022-11-23 01:53:12,008 INFO L130 PetriNetUnfolder]: 1/131 cut-off events. [2022-11-23 01:53:12,008 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:53:12,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 1/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-23 01:53:12,014 INFO L119 LiptonReduction]: Number of co-enabled transitions 2054 [2022-11-23 01:53:24,158 INFO L134 LiptonReduction]: Checked pairs total: 5955 [2022-11-23 01:53:24,159 INFO L136 LiptonReduction]: Total number of compositions: 112 [2022-11-23 01:53:24,174 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 01:53:24,180 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;@771de82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 01:53:24,181 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-23 01:53:24,188 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-23 01:53:24,188 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:53:24,189 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:24,189 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:53:24,190 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:24,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:24,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1232299389, now seen corresponding path program 1 times [2022-11-23 01:53:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:24,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152119000] [2022-11-23 01:53:24,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:53:24,543 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-23 01:53:24,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:53:24,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152119000] [2022-11-23 01:53:24,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152119000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:53:24,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:53:24,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 01:53:24,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803132077] [2022-11-23 01:53:24,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:53:24,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 01:53:24,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:53:24,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 01:53:24,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 01:53:24,588 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 263 [2022-11-23 01:53:24,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:24,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:53:24,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 263 [2022-11-23 01:53:24,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:53:25,846 INFO L130 PetriNetUnfolder]: 3159/4369 cut-off events. [2022-11-23 01:53:25,846 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-23 01:53:25,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8897 conditions, 4369 events. 3159/4369 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 19776 event pairs, 3159 based on Foata normal form. 0/4352 useless extension candidates. Maximal degree in co-relation 8885. Up to 4353 conditions per place. [2022-11-23 01:53:25,884 INFO L137 encePairwiseOnDemand]: 262/263 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-11-23 01:53:25,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 25 transitions, 108 flow [2022-11-23 01:53:25,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 01:53:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 01:53:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 298 transitions. [2022-11-23 01:53:25,900 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5665399239543726 [2022-11-23 01:53:25,901 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 298 transitions. [2022-11-23 01:53:25,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 298 transitions. [2022-11-23 01:53:25,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:53:25,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 298 transitions. [2022-11-23 01:53:25,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.0) internal successors, (298), 2 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:25,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:25,915 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:25,918 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 2 states and 298 transitions. [2022-11-23 01:53:25,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 25 transitions, 108 flow [2022-11-23 01:53:25,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 01:53:25,926 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 58 flow [2022-11-23 01:53:25,929 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-11-23 01:53:25,932 INFO L288 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-11-23 01:53:25,933 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 58 flow [2022-11-23 01:53:25,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:25,933 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:25,933 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:53:25,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 01:53:25,934 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:25,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1171275024, now seen corresponding path program 1 times [2022-11-23 01:53:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:25,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753422645] [2022-11-23 01:53:25,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:53:26,525 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-23 01:53:26,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:53:26,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753422645] [2022-11-23 01:53:26,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753422645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:53:26,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:53:26,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 01:53:26,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301335478] [2022-11-23 01:53:26,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:53:26,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:53:26,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:53:26,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:53:26,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:53:26,544 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 263 [2022-11-23 01:53:26,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:26,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:53:26,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 263 [2022-11-23 01:53:26,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:53:27,816 INFO L130 PetriNetUnfolder]: 3895/5345 cut-off events. [2022-11-23 01:53:27,816 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:53:27,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10894 conditions, 5345 events. 3895/5345 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 23739 event pairs, 967 based on Foata normal form. 32/5376 useless extension candidates. Maximal degree in co-relation 10891. Up to 4801 conditions per place. [2022-11-23 01:53:27,847 INFO L137 encePairwiseOnDemand]: 259/263 looper letters, 34 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2022-11-23 01:53:27,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 160 flow [2022-11-23 01:53:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:53:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:53:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2022-11-23 01:53:27,854 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5576679340937896 [2022-11-23 01:53:27,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2022-11-23 01:53:27,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2022-11-23 01:53:27,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:53:27,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2022-11-23 01:53:27,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:27,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:27,862 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:27,862 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 58 flow. Second operand 3 states and 440 transitions. [2022-11-23 01:53:27,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 160 flow [2022-11-23 01:53:27,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 01:53:27,864 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 77 flow [2022-11-23 01:53:27,864 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-11-23 01:53:27,865 INFO L288 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2022-11-23 01:53:27,865 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 77 flow [2022-11-23 01:53:27,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:27,866 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:27,867 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:53:27,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 01:53:27,867 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1949786684, now seen corresponding path program 1 times [2022-11-23 01:53:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:27,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120727291] [2022-11-23 01:53:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:27,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:53:28,156 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-23 01:53:28,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:53:28,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120727291] [2022-11-23 01:53:28,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120727291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:53:28,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:53:28,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 01:53:28,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491394764] [2022-11-23 01:53:28,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:53:28,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:53:28,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:53:28,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:53:28,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:53:28,168 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 263 [2022-11-23 01:53:28,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:28,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:53:28,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 263 [2022-11-23 01:53:28,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:53:29,177 INFO L130 PetriNetUnfolder]: 3341/4912 cut-off events. [2022-11-23 01:53:29,177 INFO L131 PetriNetUnfolder]: For 480/480 co-relation queries the response was YES. [2022-11-23 01:53:29,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10322 conditions, 4912 events. 3341/4912 cut-off events. For 480/480 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25975 event pairs, 618 based on Foata normal form. 72/4980 useless extension candidates. Maximal degree in co-relation 10317. Up to 3850 conditions per place. [2022-11-23 01:53:29,206 INFO L137 encePairwiseOnDemand]: 260/263 looper letters, 40 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-11-23 01:53:29,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 208 flow [2022-11-23 01:53:29,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:53:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:53:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-11-23 01:53:29,208 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5652724968314322 [2022-11-23 01:53:29,209 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2022-11-23 01:53:29,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2022-11-23 01:53:29,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:53:29,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2022-11-23 01:53:29,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:29,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:29,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:29,214 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 77 flow. Second operand 3 states and 446 transitions. [2022-11-23 01:53:29,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 208 flow [2022-11-23 01:53:29,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 01:53:29,216 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 82 flow [2022-11-23 01:53:29,217 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-11-23 01:53:29,218 INFO L288 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2022-11-23 01:53:29,218 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 82 flow [2022-11-23 01:53:29,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:29,219 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:29,219 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:53:29,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 01:53:29,219 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash 317620974, now seen corresponding path program 1 times [2022-11-23 01:53:29,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:29,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141672926] [2022-11-23 01:53:29,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:29,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:53:29,818 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-23 01:53:29,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:53:29,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141672926] [2022-11-23 01:53:29,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141672926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:53:29,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:53:29,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 01:53:29,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227195249] [2022-11-23 01:53:29,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:53:29,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:53:29,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:53:29,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:53:29,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:53:29,836 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 263 [2022-11-23 01:53:29,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:29,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:53:29,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 263 [2022-11-23 01:53:29,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:53:30,935 INFO L130 PetriNetUnfolder]: 3366/4709 cut-off events. [2022-11-23 01:53:30,936 INFO L131 PetriNetUnfolder]: For 1045/1045 co-relation queries the response was YES. [2022-11-23 01:53:30,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10770 conditions, 4709 events. 3366/4709 cut-off events. For 1045/1045 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 21600 event pairs, 963 based on Foata normal form. 36/4744 useless extension candidates. Maximal degree in co-relation 10764. Up to 3712 conditions per place. [2022-11-23 01:53:30,973 INFO L137 encePairwiseOnDemand]: 260/263 looper letters, 35 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-11-23 01:53:30,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 189 flow [2022-11-23 01:53:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:53:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:53:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2022-11-23 01:53:30,976 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5678073510773131 [2022-11-23 01:53:30,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2022-11-23 01:53:30,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2022-11-23 01:53:30,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:53:30,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2022-11-23 01:53:30,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:30,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:30,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:30,982 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 82 flow. Second operand 3 states and 448 transitions. [2022-11-23 01:53:30,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 189 flow [2022-11-23 01:53:30,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 01:53:30,986 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 86 flow [2022-11-23 01:53:30,987 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-11-23 01:53:30,987 INFO L288 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-11-23 01:53:30,988 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 86 flow [2022-11-23 01:53:30,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:30,988 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:30,989 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:53:30,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 01:53:30,989 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:30,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1832716673, now seen corresponding path program 1 times [2022-11-23 01:53:30,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:30,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348546291] [2022-11-23 01:53:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:30,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:53:31,260 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-23 01:53:31,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:53:31,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348546291] [2022-11-23 01:53:31,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348546291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:53:31,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:53:31,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 01:53:31,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212257151] [2022-11-23 01:53:31,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:53:31,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:53:31,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:53:31,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:53:31,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:53:31,271 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 263 [2022-11-23 01:53:31,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:31,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:53:31,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 263 [2022-11-23 01:53:31,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:53:32,358 INFO L130 PetriNetUnfolder]: 4708/6554 cut-off events. [2022-11-23 01:53:32,359 INFO L131 PetriNetUnfolder]: For 1972/1972 co-relation queries the response was YES. [2022-11-23 01:53:32,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15096 conditions, 6554 events. 4708/6554 cut-off events. For 1972/1972 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 31908 event pairs, 2347 based on Foata normal form. 144/6697 useless extension candidates. Maximal degree in co-relation 15089. Up to 3773 conditions per place. [2022-11-23 01:53:32,387 INFO L137 encePairwiseOnDemand]: 260/263 looper letters, 37 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2022-11-23 01:53:32,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 197 flow [2022-11-23 01:53:32,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:53:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:53:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-11-23 01:53:32,390 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5602027883396705 [2022-11-23 01:53:32,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-11-23 01:53:32,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-11-23 01:53:32,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:53:32,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-11-23 01:53:32,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:32,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:32,395 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:32,395 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 86 flow. Second operand 3 states and 442 transitions. [2022-11-23 01:53:32,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 197 flow [2022-11-23 01:53:32,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 01:53:32,400 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 93 flow [2022-11-23 01:53:32,401 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-11-23 01:53:32,401 INFO L288 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2022-11-23 01:53:32,402 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 93 flow [2022-11-23 01:53:32,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:32,402 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:32,402 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:53:32,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 01:53:32,403 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:32,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:32,403 INFO L85 PathProgramCache]: Analyzing trace with hash 791798212, now seen corresponding path program 1 times [2022-11-23 01:53:32,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:32,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122091363] [2022-11-23 01:53:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:32,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:53:32,757 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-23 01:53:32,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:53:32,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122091363] [2022-11-23 01:53:32,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122091363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:53:32,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:53:32,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 01:53:32,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49323577] [2022-11-23 01:53:32,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:53:32,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:53:32,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:53:32,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:53:32,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:53:32,777 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 263 [2022-11-23 01:53:32,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:32,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:53:32,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 263 [2022-11-23 01:53:32,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:53:34,457 INFO L130 PetriNetUnfolder]: 7315/10553 cut-off events. [2022-11-23 01:53:34,457 INFO L131 PetriNetUnfolder]: For 4900/4900 co-relation queries the response was YES. [2022-11-23 01:53:34,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23934 conditions, 10553 events. 7315/10553 cut-off events. For 4900/4900 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 59534 event pairs, 1087 based on Foata normal form. 144/10696 useless extension candidates. Maximal degree in co-relation 23926. Up to 4849 conditions per place. [2022-11-23 01:53:34,485 INFO L137 encePairwiseOnDemand]: 258/263 looper letters, 43 selfloop transitions, 4 changer transitions 6/54 dead transitions. [2022-11-23 01:53:34,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 270 flow [2022-11-23 01:53:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 01:53:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 01:53:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 582 transitions. [2022-11-23 01:53:34,490 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5532319391634981 [2022-11-23 01:53:34,491 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 582 transitions. [2022-11-23 01:53:34,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 582 transitions. [2022-11-23 01:53:34,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:53:34,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 582 transitions. [2022-11-23 01:53:34,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:34,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:34,497 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:34,497 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 93 flow. Second operand 4 states and 582 transitions. [2022-11-23 01:53:34,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 270 flow [2022-11-23 01:53:34,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 261 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-23 01:53:34,510 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 101 flow [2022-11-23 01:53:34,510 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2022-11-23 01:53:34,514 INFO L288 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2022-11-23 01:53:34,517 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 101 flow [2022-11-23 01:53:34,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:34,518 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:34,518 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:53:34,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 01:53:34,518 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:34,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:34,519 INFO L85 PathProgramCache]: Analyzing trace with hash 567971610, now seen corresponding path program 2 times [2022-11-23 01:53:34,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:34,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233100757] [2022-11-23 01:53:34,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:34,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:53:35,817 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-23 01:53:35,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:53:35,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233100757] [2022-11-23 01:53:35,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233100757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:53:35,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:53:35,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:53:35,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304173138] [2022-11-23 01:53:35,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:53:35,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:53:35,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:53:35,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:53:35,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:53:35,918 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 263 [2022-11-23 01:53:35,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 101 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:35,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:53:35,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 263 [2022-11-23 01:53:35,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:53:37,078 INFO L130 PetriNetUnfolder]: 4786/6695 cut-off events. [2022-11-23 01:53:37,078 INFO L131 PetriNetUnfolder]: For 3491/3539 co-relation queries the response was YES. [2022-11-23 01:53:37,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15854 conditions, 6695 events. 4786/6695 cut-off events. For 3491/3539 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 33523 event pairs, 1063 based on Foata normal form. 12/6700 useless extension candidates. Maximal degree in co-relation 15845. Up to 6229 conditions per place. [2022-11-23 01:53:37,113 INFO L137 encePairwiseOnDemand]: 259/263 looper letters, 38 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-11-23 01:53:37,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 231 flow [2022-11-23 01:53:37,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:53:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:53:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2022-11-23 01:53:37,117 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5221799746514575 [2022-11-23 01:53:37,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2022-11-23 01:53:37,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2022-11-23 01:53:37,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:53:37,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2022-11-23 01:53:37,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:37,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:37,123 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:37,123 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 101 flow. Second operand 3 states and 412 transitions. [2022-11-23 01:53:37,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 231 flow [2022-11-23 01:53:37,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 214 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-11-23 01:53:37,128 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 108 flow [2022-11-23 01:53:37,129 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2022-11-23 01:53:37,130 INFO L288 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2022-11-23 01:53:37,130 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 108 flow [2022-11-23 01:53:37,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:37,135 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:37,135 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:53:37,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 01:53:37,136 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:37,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:37,136 INFO L85 PathProgramCache]: Analyzing trace with hash 547990105, now seen corresponding path program 1 times [2022-11-23 01:53:37,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:37,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982035435] [2022-11-23 01:53:37,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:53:37,494 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-23 01:53:37,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:53:37,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982035435] [2022-11-23 01:53:37,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982035435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:53:37,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:53:37,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 01:53:37,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066628042] [2022-11-23 01:53:37,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:53:37,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:53:37,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:53:37,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:53:37,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:53:37,505 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 263 [2022-11-23 01:53:37,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:37,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:53:37,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 263 [2022-11-23 01:53:37,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:53:38,268 INFO L130 PetriNetUnfolder]: 3178/4631 cut-off events. [2022-11-23 01:53:38,269 INFO L131 PetriNetUnfolder]: For 2298/2331 co-relation queries the response was YES. [2022-11-23 01:53:38,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11191 conditions, 4631 events. 3178/4631 cut-off events. For 2298/2331 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 23786 event pairs, 716 based on Foata normal form. 129/4709 useless extension candidates. Maximal degree in co-relation 11182. Up to 4075 conditions per place. [2022-11-23 01:53:38,285 INFO L137 encePairwiseOnDemand]: 257/263 looper letters, 38 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2022-11-23 01:53:38,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 246 flow [2022-11-23 01:53:38,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:53:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:53:38,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-11-23 01:53:38,288 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5525982256020279 [2022-11-23 01:53:38,288 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2022-11-23 01:53:38,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2022-11-23 01:53:38,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:53:38,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2022-11-23 01:53:38,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:38,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:38,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:38,292 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 108 flow. Second operand 3 states and 436 transitions. [2022-11-23 01:53:38,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 246 flow [2022-11-23 01:53:38,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 01:53:38,297 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 138 flow [2022-11-23 01:53:38,297 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-11-23 01:53:38,300 INFO L288 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-11-23 01:53:38,300 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 138 flow [2022-11-23 01:53:38,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:38,300 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:38,301 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:53:38,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 01:53:38,301 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:38,306 INFO L85 PathProgramCache]: Analyzing trace with hash -835427663, now seen corresponding path program 1 times [2022-11-23 01:53:38,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:38,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048139413] [2022-11-23 01:53:38,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:38,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:53:38,599 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-23 01:53:38,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:53:38,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048139413] [2022-11-23 01:53:38,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048139413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:53:38,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:53:38,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 01:53:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601564702] [2022-11-23 01:53:38,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:53:38,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:53:38,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:53:38,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:53:38,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:53:38,610 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 263 [2022-11-23 01:53:38,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:38,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:53:38,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 263 [2022-11-23 01:53:38,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:53:39,099 INFO L130 PetriNetUnfolder]: 1740/2679 cut-off events. [2022-11-23 01:53:39,099 INFO L131 PetriNetUnfolder]: For 1242/1252 co-relation queries the response was YES. [2022-11-23 01:53:39,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7534 conditions, 2679 events. 1740/2679 cut-off events. For 1242/1252 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13483 event pairs, 341 based on Foata normal form. 192/2836 useless extension candidates. Maximal degree in co-relation 7524. Up to 1414 conditions per place. [2022-11-23 01:53:39,109 INFO L137 encePairwiseOnDemand]: 257/263 looper letters, 49 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2022-11-23 01:53:39,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 345 flow [2022-11-23 01:53:39,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 01:53:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 01:53:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 582 transitions. [2022-11-23 01:53:39,112 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5532319391634981 [2022-11-23 01:53:39,112 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 582 transitions. [2022-11-23 01:53:39,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 582 transitions. [2022-11-23 01:53:39,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:53:39,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 582 transitions. [2022-11-23 01:53:39,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:39,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:39,118 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:39,118 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 138 flow. Second operand 4 states and 582 transitions. [2022-11-23 01:53:39,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 345 flow [2022-11-23 01:53:39,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 340 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 01:53:39,121 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 185 flow [2022-11-23 01:53:39,121 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-11-23 01:53:39,122 INFO L288 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-11-23 01:53:39,122 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 185 flow [2022-11-23 01:53:39,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:39,123 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:39,123 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:53:39,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 01:53:39,124 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:39,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:39,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1641158048, now seen corresponding path program 1 times [2022-11-23 01:53:39,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:39,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905905700] [2022-11-23 01:53:39,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:39,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:53:39,481 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-23 01:53:39,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:53:39,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905905700] [2022-11-23 01:53:39,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905905700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:53:39,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:53:39,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:53:39,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323042668] [2022-11-23 01:53:39,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:53:39,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:53:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:53:39,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:53:39,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:53:39,498 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 263 [2022-11-23 01:53:39,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:39,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:53:39,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 263 [2022-11-23 01:53:39,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:53:40,007 INFO L130 PetriNetUnfolder]: 1225/1891 cut-off events. [2022-11-23 01:53:40,007 INFO L131 PetriNetUnfolder]: For 1557/1558 co-relation queries the response was YES. [2022-11-23 01:53:40,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5913 conditions, 1891 events. 1225/1891 cut-off events. For 1557/1558 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9066 event pairs, 267 based on Foata normal form. 104/1967 useless extension candidates. Maximal degree in co-relation 5902. Up to 741 conditions per place. [2022-11-23 01:53:40,017 INFO L137 encePairwiseOnDemand]: 257/263 looper letters, 59 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2022-11-23 01:53:40,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 456 flow [2022-11-23 01:53:40,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:53:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:53:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 728 transitions. [2022-11-23 01:53:40,021 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5536121673003802 [2022-11-23 01:53:40,021 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 728 transitions. [2022-11-23 01:53:40,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 728 transitions. [2022-11-23 01:53:40,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:53:40,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 728 transitions. [2022-11-23 01:53:40,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:40,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:40,029 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:40,029 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 185 flow. Second operand 5 states and 728 transitions. [2022-11-23 01:53:40,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 456 flow [2022-11-23 01:53:40,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 438 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-23 01:53:40,035 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 235 flow [2022-11-23 01:53:40,036 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-11-23 01:53:40,037 INFO L288 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2022-11-23 01:53:40,037 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 235 flow [2022-11-23 01:53:40,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:40,038 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:40,038 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:53:40,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 01:53:40,038 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:40,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash -41513187, now seen corresponding path program 1 times [2022-11-23 01:53:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:40,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032324092] [2022-11-23 01:53:40,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:53:40,379 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-23 01:53:40,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:53:40,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032324092] [2022-11-23 01:53:40,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032324092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:53:40,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:53:40,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 01:53:40,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369488765] [2022-11-23 01:53:40,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:53:40,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:53:40,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:53:40,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:53:40,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:53:40,388 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 263 [2022-11-23 01:53:40,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:40,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:53:40,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 263 [2022-11-23 01:53:40,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:53:41,011 INFO L130 PetriNetUnfolder]: 1755/2828 cut-off events. [2022-11-23 01:53:41,012 INFO L131 PetriNetUnfolder]: For 4181/4181 co-relation queries the response was YES. [2022-11-23 01:53:41,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9167 conditions, 2828 events. 1755/2828 cut-off events. For 4181/4181 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 15219 event pairs, 342 based on Foata normal form. 11/2838 useless extension candidates. Maximal degree in co-relation 9155. Up to 872 conditions per place. [2022-11-23 01:53:41,019 INFO L137 encePairwiseOnDemand]: 259/263 looper letters, 46 selfloop transitions, 3 changer transitions 68/119 dead transitions. [2022-11-23 01:53:41,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 119 transitions, 950 flow [2022-11-23 01:53:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:53:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:53:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 725 transitions. [2022-11-23 01:53:41,026 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5513307984790875 [2022-11-23 01:53:41,026 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 725 transitions. [2022-11-23 01:53:41,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 725 transitions. [2022-11-23 01:53:41,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:53:41,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 725 transitions. [2022-11-23 01:53:41,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:41,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:41,032 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:41,033 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 235 flow. Second operand 5 states and 725 transitions. [2022-11-23 01:53:41,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 119 transitions, 950 flow [2022-11-23 01:53:41,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 119 transitions, 820 flow, removed 32 selfloop flow, removed 3 redundant places. [2022-11-23 01:53:41,055 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 214 flow [2022-11-23 01:53:41,055 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2022-11-23 01:53:41,055 INFO L288 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2022-11-23 01:53:41,056 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 214 flow [2022-11-23 01:53:41,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:41,056 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:41,057 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:53:41,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 01:53:41,057 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:41,058 INFO L85 PathProgramCache]: Analyzing trace with hash -661963923, now seen corresponding path program 2 times [2022-11-23 01:53:41,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:41,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086199472] [2022-11-23 01:53:41,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:41,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:53:41,439 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-23 01:53:41,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:53:41,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086199472] [2022-11-23 01:53:41,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086199472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:53:41,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:53:41,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:53:41,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3457824] [2022-11-23 01:53:41,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:53:41,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:53:41,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:53:41,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:53:41,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:53:41,453 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 263 [2022-11-23 01:53:41,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:41,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:53:41,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 263 [2022-11-23 01:53:41,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:53:41,843 INFO L130 PetriNetUnfolder]: 809/1281 cut-off events. [2022-11-23 01:53:41,843 INFO L131 PetriNetUnfolder]: For 942/947 co-relation queries the response was YES. [2022-11-23 01:53:41,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3861 conditions, 1281 events. 809/1281 cut-off events. For 942/947 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5939 event pairs, 165 based on Foata normal form. 28/1283 useless extension candidates. Maximal degree in co-relation 3847. Up to 520 conditions per place. [2022-11-23 01:53:41,848 INFO L137 encePairwiseOnDemand]: 257/263 looper letters, 48 selfloop transitions, 17 changer transitions 5/73 dead transitions. [2022-11-23 01:53:41,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 457 flow [2022-11-23 01:53:41,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:53:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 01:53:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions. [2022-11-23 01:53:41,852 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5430925221799746 [2022-11-23 01:53:41,852 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 857 transitions. [2022-11-23 01:53:41,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 857 transitions. [2022-11-23 01:53:41,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:53:41,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 857 transitions. [2022-11-23 01:53:41,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:41,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:41,860 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:41,860 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 214 flow. Second operand 6 states and 857 transitions. [2022-11-23 01:53:41,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 457 flow [2022-11-23 01:53:41,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 427 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-23 01:53:41,873 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 226 flow [2022-11-23 01:53:41,873 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2022-11-23 01:53:41,874 INFO L288 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2022-11-23 01:53:41,874 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 226 flow [2022-11-23 01:53:41,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:41,875 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:41,875 INFO L209 CegarLoopForPetriNet]: 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] [2022-11-23 01:53:41,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 01:53:41,875 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:41,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:41,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2139292576, now seen corresponding path program 1 times [2022-11-23 01:53:41,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:41,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869246858] [2022-11-23 01:53:41,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:41,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:53:43,645 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-23 01:53:43,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:53:43,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869246858] [2022-11-23 01:53:43,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869246858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:53:43,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:53:43,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:53:43,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107523613] [2022-11-23 01:53:43,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:53:43,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:53:43,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:53:43,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:53:43,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:53:43,730 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 263 [2022-11-23 01:53:43,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:43,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:53:43,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 263 [2022-11-23 01:53:43,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:53:44,102 INFO L130 PetriNetUnfolder]: 618/980 cut-off events. [2022-11-23 01:53:44,103 INFO L131 PetriNetUnfolder]: For 1513/1518 co-relation queries the response was YES. [2022-11-23 01:53:44,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 980 events. 618/980 cut-off events. For 1513/1518 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3932 event pairs, 242 based on Foata normal form. 6/982 useless extension candidates. Maximal degree in co-relation 3245. Up to 572 conditions per place. [2022-11-23 01:53:44,107 INFO L137 encePairwiseOnDemand]: 254/263 looper letters, 48 selfloop transitions, 8 changer transitions 18/75 dead transitions. [2022-11-23 01:53:44,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 611 flow [2022-11-23 01:53:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:53:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:53:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2022-11-23 01:53:44,111 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5239543726235741 [2022-11-23 01:53:44,111 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2022-11-23 01:53:44,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2022-11-23 01:53:44,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:53:44,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2022-11-23 01:53:44,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:44,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:44,117 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:44,118 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 226 flow. Second operand 5 states and 689 transitions. [2022-11-23 01:53:44,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 611 flow [2022-11-23 01:53:44,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 490 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-11-23 01:53:44,126 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 207 flow [2022-11-23 01:53:44,127 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2022-11-23 01:53:44,128 INFO L288 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-11-23 01:53:44,128 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 207 flow [2022-11-23 01:53:44,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:53:44,129 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:53:44,129 INFO L209 CegarLoopForPetriNet]: 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] [2022-11-23 01:53:44,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 01:53:44,129 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:53:44,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:53:44,130 INFO L85 PathProgramCache]: Analyzing trace with hash 41429422, now seen corresponding path program 2 times [2022-11-23 01:53:44,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:53:44,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359807790] [2022-11-23 01:53:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:53:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:53:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:53:44,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:53:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:53:44,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:53:44,521 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 01:53:44,522 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-23 01:53:44,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-11-23 01:53:44,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-23 01:53:44,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-23 01:53:44,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-11-23 01:53:44,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 01:53:44,526 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:53:44,532 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 01:53:44,532 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 01:53:44,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:53:44 BasicIcfg [2022-11-23 01:53:44,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 01:53:44,677 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 01:53:44,677 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 01:53:44,677 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 01:53:44,678 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:53:11" (3/4) ... [2022-11-23 01:53:44,680 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 01:53:44,784 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 01:53:44,785 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 01:53:44,785 INFO L158 Benchmark]: Toolchain (without parser) took 35592.87ms. Allocated memory was 138.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 73.5MB in the beginning and 833.4MB in the end (delta: -759.9MB). Peak memory consumption was 448.2MB. Max. memory is 16.1GB. [2022-11-23 01:53:44,786 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 138.4MB. Free memory was 107.6MB in the beginning and 107.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:53:44,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 756.63ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 73.3MB in the beginning and 144.2MB in the end (delta: -70.9MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2022-11-23 01:53:44,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.47ms. Allocated memory is still 197.1MB. Free memory was 144.2MB in the beginning and 141.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:53:44,787 INFO L158 Benchmark]: Boogie Preprocessor took 78.54ms. Allocated memory is still 197.1MB. Free memory was 141.5MB in the beginning and 138.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 01:53:44,787 INFO L158 Benchmark]: RCFGBuilder took 1380.04ms. Allocated memory is still 197.1MB. Free memory was 138.6MB in the beginning and 123.9MB in the end (delta: 14.7MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2022-11-23 01:53:44,788 INFO L158 Benchmark]: TraceAbstraction took 33160.86ms. Allocated memory was 197.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 123.9MB in the beginning and 855.4MB in the end (delta: -731.5MB). Peak memory consumption was 418.8MB. Max. memory is 16.1GB. [2022-11-23 01:53:44,788 INFO L158 Benchmark]: Witness Printer took 107.97ms. Allocated memory is still 1.3GB. Free memory was 855.4MB in the beginning and 833.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-23 01:53:44,790 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.25ms. Allocated memory is still 138.4MB. Free memory was 107.6MB in the beginning and 107.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 756.63ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 73.3MB in the beginning and 144.2MB in the end (delta: -70.9MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.47ms. Allocated memory is still 197.1MB. Free memory was 144.2MB in the beginning and 141.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.54ms. Allocated memory is still 197.1MB. Free memory was 141.5MB in the beginning and 138.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1380.04ms. Allocated memory is still 197.1MB. Free memory was 138.6MB in the beginning and 123.9MB in the end (delta: 14.7MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * TraceAbstraction took 33160.86ms. Allocated memory was 197.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 123.9MB in the beginning and 855.4MB in the end (delta: -731.5MB). Peak memory consumption was 418.8MB. Max. memory is 16.1GB. * Witness Printer took 107.97ms. Allocated memory is still 1.3GB. Free memory was 855.4MB in the beginning and 833.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.2s, 143 PlacesBefore, 38 PlacesAfterwards, 131 TransitionsBefore, 26 TransitionsAfterwards, 2054 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 112 TotalNumberOfCompositions, 5955 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2319, independent: 2105, independent conditional: 0, independent unconditional: 2105, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1399, independent: 1336, independent conditional: 0, independent unconditional: 1336, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1399, independent: 1299, independent conditional: 0, independent unconditional: 1299, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 929, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 864, dependent conditional: 0, dependent unconditional: 864, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2319, independent: 769, independent conditional: 0, independent unconditional: 769, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 1399, unknown conditional: 0, unknown unconditional: 1399] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff0_thd4; [L744] 0 _Bool x$r_buff1_thd0; [L745] 0 _Bool x$r_buff1_thd1; [L746] 0 _Bool x$r_buff1_thd2; [L747] 0 _Bool x$r_buff1_thd3; [L748] 0 _Bool x$r_buff1_thd4; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2165; [L861] FCALL, FORK 0 pthread_create(&t2165, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2165, ((void *)0), P0, ((void *)0))=-3, t2165={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L862] 0 pthread_t t2166; [L863] FCALL, FORK 0 pthread_create(&t2166, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2166, ((void *)0), P1, ((void *)0))=-2, t2165={7:0}, t2166={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L864] 0 pthread_t t2167; [L865] FCALL, FORK 0 pthread_create(&t2167, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2167, ((void *)0), P2, ((void *)0))=-1, t2165={7:0}, t2166={8:0}, t2167={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 x$flush_delayed = weak$$choice2 [L803] EXPR 3 \read(x) [L803] 3 x$mem_tmp = x [L804] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L804] EXPR 3 \read(x) [L804] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L804] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L805] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L806] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L807] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L808] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L810] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L812] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L813] EXPR 3 \read(x) [L813] 3 __unbuffered_p2_EAX = x [L814] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L814] EXPR 3 \read(x) [L814] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L814] 3 x = x$flush_delayed ? x$mem_tmp : x [L815] 3 x$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] 3 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L821] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L821] EXPR 3 \read(x) [L821] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L821] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L822] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L823] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L824] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L825] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L866] 0 pthread_t t2168; [L867] FCALL, FORK 0 pthread_create(&t2168, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2168, ((void *)0), P3, ((void *)0))=0, t2165={7:0}, t2166={8:0}, t2167={5:0}, t2168={6:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L835] 4 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 __unbuffered_p0_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L838] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L838] EXPR 4 \read(x) [L838] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L838] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L839] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L840] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L841] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L842] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 \read(x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 2 x = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 \read(x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L873] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L873] EXPR 0 \read(x) [L873] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L873] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L874] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L875] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L876] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L877] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2165={7:0}, t2166={8:0}, t2167={5:0}, t2168={6:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L880] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L881] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L882] 0 x$flush_delayed = weak$$choice2 [L883] EXPR 0 \read(x) [L883] 0 x$mem_tmp = x [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L884] EXPR 0 \read(x) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L884] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L885] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L886] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L887] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L888] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L890] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L891] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] EXPR 0 \read(x) [L893] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L894] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L894] EXPR 0 \read(x) [L894] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L894] 0 x = x$flush_delayed ? x$mem_tmp : x [L895] 0 x$flush_delayed = (_Bool)0 [L897] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 437 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 339 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 977 IncrementalHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 35 mSDtfsCounter, 977 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=10, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 1230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-23 01:53:44,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c863d25b-bc9a-4454-9aa1-4ece2c340b18/bin/uautomizer-QkZJyEgLgS/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