./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a555daf8b3d43d9709cd95be6561d3a47f75ee906fd0e296710c365eb1f220a2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:16:06,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:16:06,709 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-12 02:16:06,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:16:06,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:16:06,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:16:06,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:16:06,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:16:06,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:16:06,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:16:06,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:16:06,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:16:06,747 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:16:06,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:16:06,749 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:16:06,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:16:06,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:16:06,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:16:06,751 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:16:06,752 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:16:06,752 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:16:06,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:16:06,754 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:16:06,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:16:06,755 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:16:06,756 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:16:06,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:16:06,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:16:06,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:16:06,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:16:06,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:16:06,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:16:06,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:16:06,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:16:06,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:16:06,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:16:06,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:16:06,762 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:16:06,763 INFO L153 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_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/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_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a555daf8b3d43d9709cd95be6561d3a47f75ee906fd0e296710c365eb1f220a2 [2023-11-12 02:16:07,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:16:07,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:16:07,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:16:07,094 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:16:07,095 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:16:07,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i [2023-11-12 02:16:10,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:16:10,399 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:16:10,399 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i [2023-11-12 02:16:10,421 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/data/208ba84fb/35b01279c75d4cceb3f62178487100d9/FLAG2522f1e74 [2023-11-12 02:16:10,437 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/data/208ba84fb/35b01279c75d4cceb3f62178487100d9 [2023-11-12 02:16:10,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:16:10,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:16:10,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:16:10,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:16:10,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:16:10,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:16:10" (1/1) ... [2023-11-12 02:16:10,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3672824c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:10, skipping insertion in model container [2023-11-12 02:16:10,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:16:10" (1/1) ... [2023-11-12 02:16:10,516 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:16:11,101 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:16:11,128 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:16:11,211 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:16:11,250 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:11,250 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:11,258 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:16:11,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:11 WrapperNode [2023-11-12 02:16:11,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:16:11,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:16:11,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:16:11,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:16:11,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:11" (1/1) ... [2023-11-12 02:16:11,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:11" (1/1) ... [2023-11-12 02:16:11,384 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 272 [2023-11-12 02:16:11,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:16:11,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:16:11,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:16:11,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:16:11,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:11" (1/1) ... [2023-11-12 02:16:11,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:11" (1/1) ... [2023-11-12 02:16:11,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:11" (1/1) ... [2023-11-12 02:16:11,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:11" (1/1) ... [2023-11-12 02:16:11,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:11" (1/1) ... [2023-11-12 02:16:11,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:11" (1/1) ... [2023-11-12 02:16:11,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:11" (1/1) ... [2023-11-12 02:16:11,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:11" (1/1) ... [2023-11-12 02:16:11,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:16:11,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:16:11,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:16:11,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:16:11,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:11" (1/1) ... [2023-11-12 02:16:11,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:16:11,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:11,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:16:11,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:16:11,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:16:11,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:16:11,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:16:11,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:16:11,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:16:11,570 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:16:11,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:16:11,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:16:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:16:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:16:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:16:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:16:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:16:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:16:11,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:16:11,573 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:16:11,800 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:16:11,802 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:16:12,409 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:16:12,741 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:16:12,741 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:16:12,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:16:12 BoogieIcfgContainer [2023-11-12 02:16:12,745 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:16:12,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:16:12,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:16:12,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:16:12,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:16:10" (1/3) ... [2023-11-12 02:16:12,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1b6017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:16:12, skipping insertion in model container [2023-11-12 02:16:12,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:11" (2/3) ... [2023-11-12 02:16:12,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1b6017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:16:12, skipping insertion in model container [2023-11-12 02:16:12,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:16:12" (3/3) ... [2023-11-12 02:16:12,758 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_tso.oepc.i [2023-11-12 02:16:12,779 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:16:12,779 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-11-12 02:16:12,780 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:16:12,860 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:16:12,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 147 transitions, 306 flow [2023-11-12 02:16:13,014 INFO L124 PetriNetUnfolderBase]: 3/144 cut-off events. [2023-11-12 02:16:13,016 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:16:13,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 144 events. 3/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-11-12 02:16:13,055 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 147 transitions, 306 flow [2023-11-12 02:16:13,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 144 transitions, 297 flow [2023-11-12 02:16:13,069 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:16:13,092 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 144 transitions, 297 flow [2023-11-12 02:16:13,095 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 144 transitions, 297 flow [2023-11-12 02:16:13,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 144 transitions, 297 flow [2023-11-12 02:16:13,136 INFO L124 PetriNetUnfolderBase]: 3/144 cut-off events. [2023-11-12 02:16:13,136 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:16:13,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 144 events. 3/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-11-12 02:16:13,141 INFO L119 LiptonReduction]: Number of co-enabled transitions 2878 [2023-11-12 02:16:20,618 INFO L134 LiptonReduction]: Checked pairs total: 8265 [2023-11-12 02:16:20,618 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-11-12 02:16:20,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:16:20,664 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@de54eea, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:16:20,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-12 02:16:20,668 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:16:20,668 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-12 02:16:20,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:16:20,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:20,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-12 02:16:20,670 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-12 02:16:20,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash 815, now seen corresponding path program 1 times [2023-11-12 02:16:20,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:20,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764351480] [2023-11-12 02:16:20,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:20,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:16:20,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:20,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764351480] [2023-11-12 02:16:20,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764351480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:20,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:20,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 02:16:20,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812755455] [2023-11-12 02:16:20,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:20,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:16:20,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:20,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:16:20,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:16:20,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 293 [2023-11-12 02:16:20,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 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) [2023-11-12 02:16:20,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:20,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 293 [2023-11-12 02:16:20,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:22,066 INFO L124 PetriNetUnfolderBase]: 3209/4679 cut-off events. [2023-11-12 02:16:22,066 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-12 02:16:22,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9368 conditions, 4679 events. 3209/4679 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 23706 event pairs, 3209 based on Foata normal form. 168/3886 useless extension candidates. Maximal degree in co-relation 9357. Up to 4619 conditions per place. [2023-11-12 02:16:22,116 INFO L140 encePairwiseOnDemand]: 286/293 looper letters, 27 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-11-12 02:16:22,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 121 flow [2023-11-12 02:16:22,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:16:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-12 02:16:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 290 transitions. [2023-11-12 02:16:22,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4948805460750853 [2023-11-12 02:16:22,142 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 290 transitions. [2023-11-12 02:16:22,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 290 transitions. [2023-11-12 02:16:22,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:22,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 290 transitions. [2023-11-12 02:16:22,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 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) [2023-11-12 02:16:22,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 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) [2023-11-12 02:16:22,164 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 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) [2023-11-12 02:16:22,166 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 2 states and 290 transitions. [2023-11-12 02:16:22,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 121 flow [2023-11-12 02:16:22,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-12 02:16:22,174 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2023-11-12 02:16:22,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-11-12 02:16:22,181 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-11-12 02:16:22,182 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 64 flow [2023-11-12 02:16:22,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 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) [2023-11-12 02:16:22,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:22,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:16:22,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:16:22,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-12 02:16:22,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:22,196 INFO L85 PathProgramCache]: Analyzing trace with hash 773328423, now seen corresponding path program 1 times [2023-11-12 02:16:22,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:22,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774495643] [2023-11-12 02:16:22,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:22,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:16:22,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:22,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774495643] [2023-11-12 02:16:22,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774495643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:22,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:22,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:16:22,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462524947] [2023-11-12 02:16:22,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:22,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:16:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:22,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:22,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:22,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 293 [2023-11-12 02:16:22,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2023-11-12 02:16:22,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:22,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 293 [2023-11-12 02:16:22,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:23,658 INFO L124 PetriNetUnfolderBase]: 2723/3945 cut-off events. [2023-11-12 02:16:23,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:16:23,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7938 conditions, 3945 events. 2723/3945 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 20786 event pairs, 293 based on Foata normal form. 0/3316 useless extension candidates. Maximal degree in co-relation 7935. Up to 3431 conditions per place. [2023-11-12 02:16:23,688 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 41 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-12 02:16:23,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 184 flow [2023-11-12 02:16:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:16:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-11-12 02:16:23,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48350398179749715 [2023-11-12 02:16:23,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-11-12 02:16:23,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-11-12 02:16:23,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:23,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-11-12 02:16:23,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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) [2023-11-12 02:16:23,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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) [2023-11-12 02:16:23,703 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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) [2023-11-12 02:16:23,703 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 64 flow. Second operand 3 states and 425 transitions. [2023-11-12 02:16:23,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 184 flow [2023-11-12 02:16:23,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:16:23,708 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 66 flow [2023-11-12 02:16:23,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-11-12 02:16:23,710 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -7 predicate places. [2023-11-12 02:16:23,711 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 66 flow [2023-11-12 02:16:23,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2023-11-12 02:16:23,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:23,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:23,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:16:23,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-12 02:16:23,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:23,723 INFO L85 PathProgramCache]: Analyzing trace with hash 139347579, now seen corresponding path program 1 times [2023-11-12 02:16:23,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:23,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952644436] [2023-11-12 02:16:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:23,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:16:23,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:23,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952644436] [2023-11-12 02:16:23,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952644436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:23,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:23,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:16:23,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572049082] [2023-11-12 02:16:23,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:23,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:16:23,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:23,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:23,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:23,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 293 [2023-11-12 02:16:23,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2023-11-12 02:16:23,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:23,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 293 [2023-11-12 02:16:23,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:24,689 INFO L124 PetriNetUnfolderBase]: 2251/3461 cut-off events. [2023-11-12 02:16:24,689 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2023-11-12 02:16:24,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6960 conditions, 3461 events. 2251/3461 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 18436 event pairs, 363 based on Foata normal form. 0/3100 useless extension candidates. Maximal degree in co-relation 6956. Up to 2657 conditions per place. [2023-11-12 02:16:24,711 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 34 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-11-12 02:16:24,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 176 flow [2023-11-12 02:16:24,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:16:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-11-12 02:16:24,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4800910125142207 [2023-11-12 02:16:24,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-11-12 02:16:24,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-11-12 02:16:24,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:24,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-11-12 02:16:24,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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) [2023-11-12 02:16:24,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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) [2023-11-12 02:16:24,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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) [2023-11-12 02:16:24,720 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 66 flow. Second operand 3 states and 422 transitions. [2023-11-12 02:16:24,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 176 flow [2023-11-12 02:16:24,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:16:24,723 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 60 flow [2023-11-12 02:16:24,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=60, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-11-12 02:16:24,725 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-11-12 02:16:24,725 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 60 flow [2023-11-12 02:16:24,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2023-11-12 02:16:24,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:24,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:24,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:16:24,730 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-12 02:16:24,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:24,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1927138269, now seen corresponding path program 1 times [2023-11-12 02:16:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:24,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540555040] [2023-11-12 02:16:24,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:24,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:16:25,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:25,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540555040] [2023-11-12 02:16:25,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540555040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:25,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:25,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:25,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763246912] [2023-11-12 02:16:25,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:25,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:16:25,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:25,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:16:25,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:16:25,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 293 [2023-11-12 02:16:25,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 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) [2023-11-12 02:16:25,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:25,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 293 [2023-11-12 02:16:25,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:26,936 INFO L124 PetriNetUnfolderBase]: 2127/3097 cut-off events. [2023-11-12 02:16:26,937 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2023-11-12 02:16:26,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6376 conditions, 3097 events. 2127/3097 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14084 event pairs, 579 based on Foata normal form. 0/3000 useless extension candidates. Maximal degree in co-relation 6372. Up to 2017 conditions per place. [2023-11-12 02:16:26,974 INFO L140 encePairwiseOnDemand]: 288/293 looper letters, 52 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2023-11-12 02:16:26,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 59 transitions, 246 flow [2023-11-12 02:16:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:16:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:16:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2023-11-12 02:16:26,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4402730375426621 [2023-11-12 02:16:26,981 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2023-11-12 02:16:26,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2023-11-12 02:16:26,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:26,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2023-11-12 02:16:26,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 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) [2023-11-12 02:16:26,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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) [2023-11-12 02:16:26,994 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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) [2023-11-12 02:16:26,994 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 60 flow. Second operand 5 states and 645 transitions. [2023-11-12 02:16:26,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 59 transitions, 246 flow [2023-11-12 02:16:26,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:16:26,999 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 93 flow [2023-11-12 02:16:26,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-11-12 02:16:27,000 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-12 02:16:27,001 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 93 flow [2023-11-12 02:16:27,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 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) [2023-11-12 02:16:27,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:27,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:27,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:16:27,003 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-12 02:16:27,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1927138240, now seen corresponding path program 1 times [2023-11-12 02:16:27,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:27,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347512770] [2023-11-12 02:16:27,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:27,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:16:27,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:27,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347512770] [2023-11-12 02:16:27,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347512770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:27,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:27,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:27,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039996131] [2023-11-12 02:16:27,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:27,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:16:27,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:27,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:16:27,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:16:27,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 293 [2023-11-12 02:16:27,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 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) [2023-11-12 02:16:27,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:27,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 293 [2023-11-12 02:16:27,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:28,574 INFO L124 PetriNetUnfolderBase]: 1359/2113 cut-off events. [2023-11-12 02:16:28,574 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2023-11-12 02:16:28,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 2113 events. 1359/2113 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10363 event pairs, 324 based on Foata normal form. 192/2281 useless extension candidates. Maximal degree in co-relation 4716. Up to 1986 conditions per place. [2023-11-12 02:16:28,606 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 30 selfloop transitions, 3 changer transitions 2/37 dead transitions. [2023-11-12 02:16:28,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 170 flow [2023-11-12 02:16:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:16:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:16:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-11-12 02:16:28,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40546075085324235 [2023-11-12 02:16:28,611 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-11-12 02:16:28,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-11-12 02:16:28,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:28,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-11-12 02:16:28,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-11-12 02:16:28,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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) [2023-11-12 02:16:28,623 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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) [2023-11-12 02:16:28,623 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 93 flow. Second operand 5 states and 594 transitions. [2023-11-12 02:16:28,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 170 flow [2023-11-12 02:16:28,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:16:28,630 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 70 flow [2023-11-12 02:16:28,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-11-12 02:16:28,634 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-12 02:16:28,634 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 70 flow [2023-11-12 02:16:28,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 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) [2023-11-12 02:16:28,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:28,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:28,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:16:28,636 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-12 02:16:28,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:28,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1782827140, now seen corresponding path program 1 times [2023-11-12 02:16:28,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:28,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872530839] [2023-11-12 02:16:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:28,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:16:29,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:29,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872530839] [2023-11-12 02:16:29,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872530839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:29,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:29,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:16:29,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152862216] [2023-11-12 02:16:29,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:29,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:16:29,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:16:29,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:16:29,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 293 [2023-11-12 02:16:29,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-11-12 02:16:29,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:29,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 293 [2023-11-12 02:16:29,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:29,729 INFO L124 PetriNetUnfolderBase]: 1143/1745 cut-off events. [2023-11-12 02:16:29,729 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2023-11-12 02:16:29,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3808 conditions, 1745 events. 1143/1745 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8188 event pairs, 305 based on Foata normal form. 72/1808 useless extension candidates. Maximal degree in co-relation 3801. Up to 1165 conditions per place. [2023-11-12 02:16:29,751 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 31 selfloop transitions, 2 changer transitions 16/51 dead transitions. [2023-11-12 02:16:29,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 230 flow [2023-11-12 02:16:29,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:16:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:16:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions. [2023-11-12 02:16:29,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4614334470989761 [2023-11-12 02:16:29,756 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions. [2023-11-12 02:16:29,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions. [2023-11-12 02:16:29,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:29,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions. [2023-11-12 02:16:29,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 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) [2023-11-12 02:16:29,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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) [2023-11-12 02:16:29,766 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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) [2023-11-12 02:16:29,766 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 70 flow. Second operand 5 states and 676 transitions. [2023-11-12 02:16:29,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 230 flow [2023-11-12 02:16:29,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 217 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-11-12 02:16:29,776 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 71 flow [2023-11-12 02:16:29,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=71, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-11-12 02:16:29,780 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-12 02:16:29,780 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 71 flow [2023-11-12 02:16:29,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-11-12 02:16:29,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:29,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:29,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:16:29,782 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-12 02:16:29,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:29,783 INFO L85 PathProgramCache]: Analyzing trace with hash 887921849, now seen corresponding path program 1 times [2023-11-12 02:16:29,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:29,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255731632] [2023-11-12 02:16:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:29,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:16:30,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:30,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255731632] [2023-11-12 02:16:30,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255731632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:30,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:30,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:16:30,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470022194] [2023-11-12 02:16:30,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:30,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:16:30,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:30,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:30,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:30,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 293 [2023-11-12 02:16:30,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2023-11-12 02:16:30,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:30,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 293 [2023-11-12 02:16:30,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:30,658 INFO L124 PetriNetUnfolderBase]: 561/931 cut-off events. [2023-11-12 02:16:30,658 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2023-11-12 02:16:30,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2190 conditions, 931 events. 561/931 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4033 event pairs, 171 based on Foata normal form. 60/987 useless extension candidates. Maximal degree in co-relation 2182. Up to 700 conditions per place. [2023-11-12 02:16:30,667 INFO L140 encePairwiseOnDemand]: 288/293 looper letters, 34 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-11-12 02:16:30,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 188 flow [2023-11-12 02:16:30,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:16:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-11-12 02:16:30,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46757679180887374 [2023-11-12 02:16:30,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-11-12 02:16:30,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-11-12 02:16:30,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:30,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-11-12 02:16:30,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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) [2023-11-12 02:16:30,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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) [2023-11-12 02:16:30,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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) [2023-11-12 02:16:30,677 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 71 flow. Second operand 3 states and 411 transitions. [2023-11-12 02:16:30,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 188 flow [2023-11-12 02:16:30,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 178 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-12 02:16:30,685 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 89 flow [2023-11-12 02:16:30,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-11-12 02:16:30,687 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -7 predicate places. [2023-11-12 02:16:30,687 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 89 flow [2023-11-12 02:16:30,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2023-11-12 02:16:30,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:30,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:30,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:16:30,689 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-12 02:16:30,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash -437634116, now seen corresponding path program 1 times [2023-11-12 02:16:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:30,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735989405] [2023-11-12 02:16:30,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:31,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:16:31,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:31,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735989405] [2023-11-12 02:16:31,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735989405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:31,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:31,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:31,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949413772] [2023-11-12 02:16:31,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:31,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:16:31,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:31,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:16:31,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:16:31,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 293 [2023-11-12 02:16:31,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 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) [2023-11-12 02:16:31,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:31,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 293 [2023-11-12 02:16:31,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:31,572 INFO L124 PetriNetUnfolderBase]: 289/523 cut-off events. [2023-11-12 02:16:31,572 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-12 02:16:31,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 523 events. 289/523 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2112 event pairs, 126 based on Foata normal form. 47/566 useless extension candidates. Maximal degree in co-relation 1376. Up to 219 conditions per place. [2023-11-12 02:16:31,578 INFO L140 encePairwiseOnDemand]: 288/293 looper letters, 45 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2023-11-12 02:16:31,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 265 flow [2023-11-12 02:16:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:16:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:16:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-11-12 02:16:31,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4684300341296928 [2023-11-12 02:16:31,587 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-11-12 02:16:31,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-11-12 02:16:31,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:31,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-11-12 02:16:31,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 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) [2023-11-12 02:16:31,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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) [2023-11-12 02:16:31,597 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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) [2023-11-12 02:16:31,597 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 89 flow. Second operand 4 states and 549 transitions. [2023-11-12 02:16:31,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 265 flow [2023-11-12 02:16:31,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:16:31,602 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 125 flow [2023-11-12 02:16:31,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-11-12 02:16:31,605 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-12 02:16:31,605 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 125 flow [2023-11-12 02:16:31,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 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) [2023-11-12 02:16:31,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:31,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:31,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:16:31,607 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-12 02:16:31,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:31,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1645627609, now seen corresponding path program 1 times [2023-11-12 02:16:31,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:31,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140321251] [2023-11-12 02:16:31,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:31,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:16:32,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140321251] [2023-11-12 02:16:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140321251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:32,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:32,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:16:32,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882272556] [2023-11-12 02:16:32,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:32,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:16:32,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:32,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:16:32,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:16:32,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 293 [2023-11-12 02:16:32,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 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) [2023-11-12 02:16:32,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:32,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 293 [2023-11-12 02:16:32,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:32,520 INFO L124 PetriNetUnfolderBase]: 249/443 cut-off events. [2023-11-12 02:16:32,521 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2023-11-12 02:16:32,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 443 events. 249/443 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1766 event pairs, 122 based on Foata normal form. 12/451 useless extension candidates. Maximal degree in co-relation 1233. Up to 219 conditions per place. [2023-11-12 02:16:32,525 INFO L140 encePairwiseOnDemand]: 288/293 looper letters, 42 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2023-11-12 02:16:32,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 289 flow [2023-11-12 02:16:32,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:16:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:16:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2023-11-12 02:16:32,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4593856655290102 [2023-11-12 02:16:32,530 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2023-11-12 02:16:32,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2023-11-12 02:16:32,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:32,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2023-11-12 02:16:32,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 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) [2023-11-12 02:16:32,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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) [2023-11-12 02:16:32,539 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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) [2023-11-12 02:16:32,539 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 125 flow. Second operand 5 states and 673 transitions. [2023-11-12 02:16:32,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 289 flow [2023-11-12 02:16:32,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 263 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-12 02:16:32,544 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 131 flow [2023-11-12 02:16:32,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-11-12 02:16:32,545 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-12 02:16:32,545 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 131 flow [2023-11-12 02:16:32,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 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) [2023-11-12 02:16:32,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:32,546 INFO L208 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] [2023-11-12 02:16:32,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:16:32,547 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-12 02:16:32,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:32,547 INFO L85 PathProgramCache]: Analyzing trace with hash -619229466, now seen corresponding path program 1 times [2023-11-12 02:16:32,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:32,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718993300] [2023-11-12 02:16:32,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:32,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:16:33,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:33,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718993300] [2023-11-12 02:16:33,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718993300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:33,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:33,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:16:33,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476464268] [2023-11-12 02:16:33,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:33,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:16:33,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:33,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:16:33,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:16:33,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 293 [2023-11-12 02:16:33,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 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) [2023-11-12 02:16:33,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:33,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 293 [2023-11-12 02:16:33,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:33,388 INFO L124 PetriNetUnfolderBase]: 350/661 cut-off events. [2023-11-12 02:16:33,389 INFO L125 PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES. [2023-11-12 02:16:33,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 661 events. 350/661 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3105 event pairs, 35 based on Foata normal form. 1/662 useless extension candidates. Maximal degree in co-relation 1774. Up to 388 conditions per place. [2023-11-12 02:16:33,392 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 37 selfloop transitions, 1 changer transitions 25/64 dead transitions. [2023-11-12 02:16:33,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 412 flow [2023-11-12 02:16:33,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:16:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:16:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-11-12 02:16:33,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45051194539249145 [2023-11-12 02:16:33,396 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-11-12 02:16:33,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-11-12 02:16:33,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:33,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-11-12 02:16:33,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 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) [2023-11-12 02:16:33,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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) [2023-11-12 02:16:33,404 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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) [2023-11-12 02:16:33,404 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 131 flow. Second operand 5 states and 660 transitions. [2023-11-12 02:16:33,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 412 flow [2023-11-12 02:16:33,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 64 transitions, 356 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-12 02:16:33,410 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 114 flow [2023-11-12 02:16:33,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-11-12 02:16:33,411 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-11-12 02:16:33,412 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 114 flow [2023-11-12 02:16:33,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 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) [2023-11-12 02:16:33,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:33,413 INFO L208 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] [2023-11-12 02:16:33,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:16:33,413 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-12 02:16:33,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:33,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1191267208, now seen corresponding path program 2 times [2023-11-12 02:16:33,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:33,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664616417] [2023-11-12 02:16:33,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:33,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:16:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664616417] [2023-11-12 02:16:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664616417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:35,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:35,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:16:35,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834798053] [2023-11-12 02:16:35,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:35,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:16:35,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:35,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:16:35,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:16:35,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 293 [2023-11-12 02:16:35,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 114 flow. Second operand has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 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) [2023-11-12 02:16:35,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:35,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 293 [2023-11-12 02:16:35,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:35,558 INFO L124 PetriNetUnfolderBase]: 482/854 cut-off events. [2023-11-12 02:16:35,558 INFO L125 PetriNetUnfolderBase]: For 480/480 co-relation queries the response was YES. [2023-11-12 02:16:35,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2320 conditions, 854 events. 482/854 cut-off events. For 480/480 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3761 event pairs, 39 based on Foata normal form. 1/855 useless extension candidates. Maximal degree in co-relation 2310. Up to 492 conditions per place. [2023-11-12 02:16:35,562 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 57 selfloop transitions, 9 changer transitions 12/78 dead transitions. [2023-11-12 02:16:35,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 444 flow [2023-11-12 02:16:35,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:16:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:16:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2023-11-12 02:16:35,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4310092637737689 [2023-11-12 02:16:35,567 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2023-11-12 02:16:35,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2023-11-12 02:16:35,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:35,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2023-11-12 02:16:35,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 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) [2023-11-12 02:16:35,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 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) [2023-11-12 02:16:35,576 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 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) [2023-11-12 02:16:35,577 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 114 flow. Second operand 7 states and 884 transitions. [2023-11-12 02:16:35,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 444 flow [2023-11-12 02:16:35,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 434 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-12 02:16:35,583 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 171 flow [2023-11-12 02:16:35,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-11-12 02:16:35,584 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2023-11-12 02:16:35,584 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 171 flow [2023-11-12 02:16:35,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 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) [2023-11-12 02:16:35,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:35,585 INFO L208 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] [2023-11-12 02:16:35,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:16:35,586 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-12 02:16:35,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:35,586 INFO L85 PathProgramCache]: Analyzing trace with hash -793871472, now seen corresponding path program 3 times [2023-11-12 02:16:35,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:35,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585547737] [2023-11-12 02:16:35,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:35,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:35,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:35,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:35,930 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:16:35,931 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2023-11-12 02:16:35,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2023-11-12 02:16:35,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (12 of 15 remaining) [2023-11-12 02:16:35,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-11-12 02:16:35,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-11-12 02:16:35,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-11-12 02:16:35,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-11-12 02:16:35,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-11-12 02:16:35,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-11-12 02:16:35,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2023-11-12 02:16:35,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-11-12 02:16:35,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-11-12 02:16:35,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-11-12 02:16:35,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 15 remaining) [2023-11-12 02:16:35,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2023-11-12 02:16:35,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:16:35,939 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:35,947 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:16:35,947 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:16:36,063 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 02:16:36,068 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-12 02:16:36,077 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-12 02:16:36,093 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-12 02:16:36,101 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-12 02:16:36,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:16:36 BasicIcfg [2023-11-12 02:16:36,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:16:36,127 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:16:36,127 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:16:36,127 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:16:36,128 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:16:12" (3/4) ... [2023-11-12 02:16:36,130 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:16:36,131 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:16:36,132 INFO L158 Benchmark]: Toolchain (without parser) took 25690.36ms. Allocated memory was 153.1MB in the beginning and 576.7MB in the end (delta: 423.6MB). Free memory was 120.5MB in the beginning and 177.0MB in the end (delta: -56.5MB). Peak memory consumption was 369.2MB. Max. memory is 16.1GB. [2023-11-12 02:16:36,132 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 107.0MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:16:36,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 816.63ms. Allocated memory is still 153.1MB. Free memory was 120.5MB in the beginning and 91.7MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-12 02:16:36,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.31ms. Allocated memory is still 153.1MB. Free memory was 91.7MB in the beginning and 87.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:16:36,133 INFO L158 Benchmark]: Boogie Preprocessor took 96.65ms. Allocated memory is still 153.1MB. Free memory was 87.6MB in the beginning and 84.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:16:36,133 INFO L158 Benchmark]: RCFGBuilder took 1262.40ms. Allocated memory is still 153.1MB. Free memory was 84.8MB in the beginning and 78.8MB in the end (delta: 6.1MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2023-11-12 02:16:36,134 INFO L158 Benchmark]: TraceAbstraction took 23377.45ms. Allocated memory was 153.1MB in the beginning and 576.7MB in the end (delta: 423.6MB). Free memory was 77.9MB in the beginning and 177.0MB in the end (delta: -99.1MB). Peak memory consumption was 323.3MB. Max. memory is 16.1GB. [2023-11-12 02:16:36,134 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 576.7MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:16:36,136 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 107.0MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 816.63ms. Allocated memory is still 153.1MB. Free memory was 120.5MB in the beginning and 91.7MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.31ms. Allocated memory is still 153.1MB. Free memory was 91.7MB in the beginning and 87.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.65ms. Allocated memory is still 153.1MB. Free memory was 87.6MB in the beginning and 84.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1262.40ms. Allocated memory is still 153.1MB. Free memory was 84.8MB in the beginning and 78.8MB in the end (delta: 6.1MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23377.45ms. Allocated memory was 153.1MB in the beginning and 576.7MB in the end (delta: 423.6MB). Free memory was 77.9MB in the beginning and 177.0MB in the end (delta: -99.1MB). Peak memory consumption was 323.3MB. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 576.7MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - 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: 7.5s, 151 PlacesBefore, 45 PlacesAfterwards, 144 TransitionsBefore, 36 TransitionsAfterwards, 2878 CoEnabledTransitionPairs, 7 FixpointIterations, 68 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 146 TotalNumberOfCompositions, 8265 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3215, independent: 2996, independent conditional: 0, independent unconditional: 2996, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1556, independent: 1519, independent conditional: 0, independent unconditional: 1519, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3215, independent: 1477, independent conditional: 0, independent unconditional: 1477, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1556, unknown conditional: 0, unknown unconditional: 1556] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff1_thd0; [L747] 0 _Bool y$r_buff1_thd1; [L748] 0 _Bool y$r_buff1_thd2; [L749] 0 _Bool y$r_buff1_thd3; [L750] 0 _Bool y$read_delayed; [L751] 0 int *y$read_delayed_var; [L752] 0 int y$w_buff0; [L753] 0 _Bool y$w_buff0_used; [L754] 0 int y$w_buff1; [L755] 0 _Bool y$w_buff1_used; [L757] 0 int z = 0; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice2; [L899] 0 pthread_t t171; [L900] FCALL, FORK 0 pthread_create(&t171, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t171={5:0}, weak$$choice0=0, weak$$choice2=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L901] 0 pthread_t t172; [L902] FCALL, FORK 0 pthread_create(&t172, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t171={5:0}, t172={6:0}, weak$$choice0=0, weak$$choice2=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L903] 0 pthread_t t173; [L904] FCALL, FORK 0 pthread_create(&t173, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice0=0, weak$$choice2=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L841] 3 y$w_buff1 = y$w_buff0 [L842] 3 y$w_buff0 = 1 [L843] 3 y$w_buff1_used = y$w_buff0_used [L844] 3 y$w_buff0_used = (_Bool)1 [L845] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L845] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L846] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L847] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L848] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L849] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L850] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L853] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 3 y$flush_delayed = weak$$choice2 [L856] 3 y$mem_tmp = y [L857] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L858] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L859] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L860] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L861] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L862] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L863] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L864] 3 __unbuffered_p2_EAX = y [L865] 3 y = y$flush_delayed ? y$mem_tmp : y [L866] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L869] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L763] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L766] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L783] 2 x$w_buff1 = x$w_buff0 [L784] 2 x$w_buff0 = 2 [L785] 2 x$w_buff1_used = x$w_buff0_used [L786] 2 x$w_buff0_used = (_Bool)1 [L787] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L787] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L788] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L789] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L790] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L791] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L792] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L795] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 2 x$flush_delayed = weak$$choice2 [L798] 2 x$mem_tmp = x [L799] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L800] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L801] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L802] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L803] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L805] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 __unbuffered_p1_EAX = x [L807] 2 x = x$flush_delayed ? x$mem_tmp : x [L808] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L811] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 2 y$flush_delayed = weak$$choice2 [L814] 2 y$mem_tmp = y [L815] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L816] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L817] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L818] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L819] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L820] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L821] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L822] 2 __unbuffered_p1_EBX = y [L823] 2 y = y$flush_delayed ? y$mem_tmp : y [L824] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L827] 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) [L828] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L831] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L872] 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) [L873] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L874] 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 [L875] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L876] 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 [L877] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L878] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L879] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L880] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L881] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L834] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 2 return 0; [L884] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L886] 3 return 0; [L906] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L908] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L908] RET 0 assume_abort_if_not(main$tmp_guard0) [L910] 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) [L911] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L912] 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 [L913] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L914] 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 [L915] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L916] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L917] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L918] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L919] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L922] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L923] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L924] 0 x$flush_delayed = weak$$choice2 [L925] 0 x$mem_tmp = x [L926] 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) [L927] 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)) [L928] 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)) [L929] 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)) [L930] 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)) [L931] 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)) [L932] 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)) [L933] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L934] 0 x = x$flush_delayed ? x$mem_tmp : x [L935] 0 x$flush_delayed = (_Bool)0 [L937] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix006_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 897]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 900]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 176 locations, 15 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: 23.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 443 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 344 mSDsluCounter, 206 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1041 IncrementalHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 78 mSDtfsCounter, 1041 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=11, InterpolantAutomatonStates: 47, 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, 1.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 949 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 could not prove your program: unable to determine feasibility of some traces [2023-11-12 02:16:36,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a555daf8b3d43d9709cd95be6561d3a47f75ee906fd0e296710c365eb1f220a2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:16:38,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:16:38,906 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-12 02:16:38,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:16:38,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:16:38,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:16:38,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:16:38,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:16:38,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:16:38,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:16:38,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:16:38,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:16:38,976 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:16:38,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:16:38,979 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:16:38,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:16:38,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:16:38,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:16:38,981 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:16:38,982 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:16:38,983 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:16:38,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:16:38,984 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:16:38,985 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:16:38,985 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:16:38,986 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:16:38,986 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:16:38,987 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:16:38,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:16:38,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:16:38,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:16:38,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:16:38,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:16:38,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:16:38,992 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:16:38,992 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:16:38,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:16:38,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:16:38,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:16:38,994 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:16:38,995 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:16:38,995 INFO L153 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_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/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_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a555daf8b3d43d9709cd95be6561d3a47f75ee906fd0e296710c365eb1f220a2 [2023-11-12 02:16:39,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:16:39,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:16:39,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:16:39,488 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:16:39,488 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:16:39,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i [2023-11-12 02:16:42,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:16:43,035 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:16:43,048 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i [2023-11-12 02:16:43,075 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/data/420a9c7f8/22490bb8282947fc94e73aa31777a762/FLAGa1892a89b [2023-11-12 02:16:43,091 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/data/420a9c7f8/22490bb8282947fc94e73aa31777a762 [2023-11-12 02:16:43,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:16:43,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:16:43,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:16:43,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:16:43,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:16:43,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:16:43" (1/1) ... [2023-11-12 02:16:43,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e933831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43, skipping insertion in model container [2023-11-12 02:16:43,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:16:43" (1/1) ... [2023-11-12 02:16:43,203 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:16:43,784 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:16:43,801 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:16:43,877 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:16:43,929 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:43,929 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:43,937 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:16:43,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43 WrapperNode [2023-11-12 02:16:43,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:16:43,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:16:43,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:16:43,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:16:43,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43" (1/1) ... [2023-11-12 02:16:43,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43" (1/1) ... [2023-11-12 02:16:44,052 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 273 [2023-11-12 02:16:44,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:16:44,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:16:44,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:16:44,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:16:44,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43" (1/1) ... [2023-11-12 02:16:44,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43" (1/1) ... [2023-11-12 02:16:44,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43" (1/1) ... [2023-11-12 02:16:44,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43" (1/1) ... [2023-11-12 02:16:44,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43" (1/1) ... [2023-11-12 02:16:44,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43" (1/1) ... [2023-11-12 02:16:44,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43" (1/1) ... [2023-11-12 02:16:44,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43" (1/1) ... [2023-11-12 02:16:44,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:16:44,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:16:44,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:16:44,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:16:44,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43" (1/1) ... [2023-11-12 02:16:44,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:16:44,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:44,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:16:44,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb720545-4ed3-4248-abab-c0470d61b7d3/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:16:44,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:16:44,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:16:44,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:16:44,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:16:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-12 02:16:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:16:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:16:44,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:16:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:16:44,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:16:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:16:44,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:16:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:16:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:16:44,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:16:44,269 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:16:44,459 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:16:44,461 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:16:45,118 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:16:45,479 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:16:45,479 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:16:45,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:16:45 BoogieIcfgContainer [2023-11-12 02:16:45,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:16:45,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:16:45,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:16:45,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:16:45,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:16:43" (1/3) ... [2023-11-12 02:16:45,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15267c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:16:45, skipping insertion in model container [2023-11-12 02:16:45,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:43" (2/3) ... [2023-11-12 02:16:45,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15267c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:16:45, skipping insertion in model container [2023-11-12 02:16:45,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:16:45" (3/3) ... [2023-11-12 02:16:45,497 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_tso.oepc.i [2023-11-12 02:16:45,519 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:16:45,520 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-11-12 02:16:45,520 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:16:45,621 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:16:45,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 148 transitions, 308 flow [2023-11-12 02:16:45,781 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2023-11-12 02:16:45,782 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:16:45,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 145 events. 3/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-11-12 02:16:45,788 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 148 transitions, 308 flow [2023-11-12 02:16:45,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 145 transitions, 299 flow [2023-11-12 02:16:45,806 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:16:45,816 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 145 transitions, 299 flow [2023-11-12 02:16:45,820 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 145 transitions, 299 flow [2023-11-12 02:16:45,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 145 transitions, 299 flow [2023-11-12 02:16:45,884 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2023-11-12 02:16:45,884 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:16:45,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 145 events. 3/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-11-12 02:16:45,890 INFO L119 LiptonReduction]: Number of co-enabled transitions 2878