./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1 --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 e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:48:32,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:48:32,414 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 11:48:32,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:48:32,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:48:32,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:48:32,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:48:32,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:48:32,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 11:48:32,441 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 11:48:32,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:48:32,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:48:32,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:48:32,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:48:32,441 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:48:32,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:48:32,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 11:48:32,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 11:48:32,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 11:48:32,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:48:32,442 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 11:48:32,442 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 11:48:32,442 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 11:48:32,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:48:32,442 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 11:48:32,443 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 11:48:32,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 11:48:32,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:48:32,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:48:32,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:48:32,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:48:32,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:48:32,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:48:32,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:48:32,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:48:32,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:48:32,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:48:32,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:48:32,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:48:32,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:48:32,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:48:32,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 11:48:32,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 11:48:32,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:48:32,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:48:32,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:48:32,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:48:32,445 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1 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 -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae [2024-12-02 11:48:32,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:48:32,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:48:32,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:48:32,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:48:32,661 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:48:32,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-12-02 11:48:35,362 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/data/3648f79bb/f1b91a149f9841dda950bbcd4cb16d20/FLAG3197dd961 [2024-12-02 11:48:35,599 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:48:35,600 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-12-02 11:48:35,614 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/data/3648f79bb/f1b91a149f9841dda950bbcd4cb16d20/FLAG3197dd961 [2024-12-02 11:48:35,909 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/data/3648f79bb/f1b91a149f9841dda950bbcd4cb16d20 [2024-12-02 11:48:35,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:48:35,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:48:35,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:48:35,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:48:35,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:48:35,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:48:35" (1/1) ... [2024-12-02 11:48:35,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f80889c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:35, skipping insertion in model container [2024-12-02 11:48:35,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:48:35" (1/1) ... [2024-12-02 11:48:35,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:48:36,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:48:36,272 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:48:36,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:48:36,367 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:48:36,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36 WrapperNode [2024-12-02 11:48:36,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:48:36,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:48:36,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:48:36,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:48:36,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (1/1) ... [2024-12-02 11:48:36,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (1/1) ... [2024-12-02 11:48:36,411 INFO L138 Inliner]: procedures = 174, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2024-12-02 11:48:36,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:48:36,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:48:36,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:48:36,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:48:36,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (1/1) ... [2024-12-02 11:48:36,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (1/1) ... [2024-12-02 11:48:36,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (1/1) ... [2024-12-02 11:48:36,445 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-12-02 11:48:36,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (1/1) ... [2024-12-02 11:48:36,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (1/1) ... [2024-12-02 11:48:36,455 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (1/1) ... [2024-12-02 11:48:36,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (1/1) ... [2024-12-02 11:48:36,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (1/1) ... [2024-12-02 11:48:36,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (1/1) ... [2024-12-02 11:48:36,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (1/1) ... [2024-12-02 11:48:36,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:48:36,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:48:36,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:48:36,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:48:36,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (1/1) ... [2024-12-02 11:48:36,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:48:36,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:48:36,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:48:36,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:48:36,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 11:48:36,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 11:48:36,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 11:48:36,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 11:48:36,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 11:48:36,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:48:36,528 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-12-02 11:48:36,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-12-02 11:48:36,528 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-12-02 11:48:36,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-12-02 11:48:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 11:48:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 11:48:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 11:48:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:48:36,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:48:36,531 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 11:48:36,675 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:48:36,677 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:48:37,134 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 11:48:37,135 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:48:37,738 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:48:37,739 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 11:48:37,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:48:37 BoogieIcfgContainer [2024-12-02 11:48:37,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:48:37,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:48:37,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:48:37,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:48:37,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:48:35" (1/3) ... [2024-12-02 11:48:37,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa6044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:48:37, skipping insertion in model container [2024-12-02 11:48:37,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:36" (2/3) ... [2024-12-02 11:48:37,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa6044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:48:37, skipping insertion in model container [2024-12-02 11:48:37,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:48:37" (3/3) ... [2024-12-02 11:48:37,749 INFO L128 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2024-12-02 11:48:37,768 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:48:37,770 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe006_power.oepc-thin000_power.oepc.i that has 3 procedures, 61 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2024-12-02 11:48:37,771 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 11:48:37,957 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-02 11:48:37,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 62 transitions, 132 flow [2024-12-02 11:48:38,071 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2024-12-02 11:48:38,073 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:48:38,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 60 events. 2/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 194 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2024-12-02 11:48:38,077 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 62 transitions, 132 flow [2024-12-02 11:48:38,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 60 transitions, 126 flow [2024-12-02 11:48:38,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:48:38,103 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@1cd90a24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:48:38,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-12-02 11:48:38,111 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 11:48:38,111 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-12-02 11:48:38,111 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:48:38,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:38,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-12-02 11:48:38,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:38,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:38,118 INFO L85 PathProgramCache]: Analyzing trace with hash 21427459, now seen corresponding path program 1 times [2024-12-02 11:48:38,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:48:38,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283798586] [2024-12-02 11:48:38,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:38,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:48:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:38,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:48:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283798586] [2024-12-02 11:48:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283798586] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:38,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:38,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 11:48:38,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136635599] [2024-12-02 11:48:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:38,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:48:38,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:48:38,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:48:38,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:48:38,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-12-02 11:48:38,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-12-02 11:48:38,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:38,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-12-02 11:48:38,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:38,888 INFO L124 PetriNetUnfolderBase]: 564/1085 cut-off events. [2024-12-02 11:48:38,889 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:48:38,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 1085 events. 564/1085 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7284 event pairs, 564 based on Foata normal form. 56/760 useless extension candidates. Maximal degree in co-relation 2026. Up to 937 conditions per place. [2024-12-02 11:48:38,899 INFO L140 encePairwiseOnDemand]: 39/62 looper letters, 24 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2024-12-02 11:48:38,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 130 flow [2024-12-02 11:48:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:48:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:48:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-12-02 11:48:38,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.478494623655914 [2024-12-02 11:48:38,911 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 126 flow. Second operand 3 states and 89 transitions. [2024-12-02 11:48:38,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 130 flow [2024-12-02 11:48:38,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:48:38,930 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 80 flow [2024-12-02 11:48:38,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-12-02 11:48:38,936 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -21 predicate places. [2024-12-02 11:48:38,936 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 80 flow [2024-12-02 11:48:38,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-12-02 11:48:38,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:38,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-12-02 11:48:38,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 11:48:38,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:38,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:38,938 INFO L85 PathProgramCache]: Analyzing trace with hash 21427460, now seen corresponding path program 1 times [2024-12-02 11:48:38,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:48:38,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948979077] [2024-12-02 11:48:38,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:38,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:48:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:39,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:48:39,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948979077] [2024-12-02 11:48:39,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948979077] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:39,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:39,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 11:48:39,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714486207] [2024-12-02 11:48:39,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:39,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:48:39,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:48:39,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:48:39,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:48:39,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-12-02 11:48:39,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-12-02 11:48:39,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:39,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-12-02 11:48:39,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:39,256 INFO L124 PetriNetUnfolderBase]: 180/392 cut-off events. [2024-12-02 11:48:39,256 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:48:39,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 392 events. 180/392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2259 event pairs, 180 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 717. Up to 319 conditions per place. [2024-12-02 11:48:39,260 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 17 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2024-12-02 11:48:39,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 106 flow [2024-12-02 11:48:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:48:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:48:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-12-02 11:48:39,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3602150537634409 [2024-12-02 11:48:39,262 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 80 flow. Second operand 3 states and 67 transitions. [2024-12-02 11:48:39,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 106 flow [2024-12-02 11:48:39,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:48:39,263 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 67 flow [2024-12-02 11:48:39,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2024-12-02 11:48:39,264 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -26 predicate places. [2024-12-02 11:48:39,264 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 67 flow [2024-12-02 11:48:39,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-12-02 11:48:39,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:39,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:39,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 11:48:39,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:39,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash -211308456, now seen corresponding path program 1 times [2024-12-02 11:48:39,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:48:39,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554720366] [2024-12-02 11:48:39,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:48:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:39,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:39,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:48:39,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554720366] [2024-12-02 11:48:39,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554720366] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:39,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:39,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 11:48:39,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717936438] [2024-12-02 11:48:39,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:39,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:48:39,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:48:39,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:48:39,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:48:39,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-12-02 11:48:39,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2024-12-02 11:48:39,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:39,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-12-02 11:48:39,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:39,559 INFO L124 PetriNetUnfolderBase]: 149/394 cut-off events. [2024-12-02 11:48:39,559 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:48:39,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 394 events. 149/394 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2205 event pairs, 29 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 668. Up to 213 conditions per place. [2024-12-02 11:48:39,561 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 28 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2024-12-02 11:48:39,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 153 flow [2024-12-02 11:48:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:48:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:48:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-12-02 11:48:39,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-12-02 11:48:39,563 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 67 flow. Second operand 3 states and 74 transitions. [2024-12-02 11:48:39,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 153 flow [2024-12-02 11:48:39,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:48:39,565 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 76 flow [2024-12-02 11:48:39,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-12-02 11:48:39,566 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -25 predicate places. [2024-12-02 11:48:39,566 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 76 flow [2024-12-02 11:48:39,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2024-12-02 11:48:39,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:39,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:39,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 11:48:39,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:39,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:39,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1203937753, now seen corresponding path program 1 times [2024-12-02 11:48:39,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:48:39,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404081239] [2024-12-02 11:48:39,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:39,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:48:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:39,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:48:39,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404081239] [2024-12-02 11:48:39,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404081239] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:39,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:39,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:48:39,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162014868] [2024-12-02 11:48:39,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:39,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:48:39,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:48:39,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:48:39,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:48:39,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-12-02 11:48:39,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-12-02 11:48:39,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:39,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-12-02 11:48:39,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:39,862 INFO L124 PetriNetUnfolderBase]: 139/320 cut-off events. [2024-12-02 11:48:39,862 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-12-02 11:48:39,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 320 events. 139/320 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1651 event pairs, 55 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 652. Up to 194 conditions per place. [2024-12-02 11:48:39,864 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 27 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2024-12-02 11:48:39,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 156 flow [2024-12-02 11:48:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:48:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 11:48:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-12-02 11:48:39,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-12-02 11:48:39,866 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 76 flow. Second operand 4 states and 86 transitions. [2024-12-02 11:48:39,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 156 flow [2024-12-02 11:48:39,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:48:39,867 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 72 flow [2024-12-02 11:48:39,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2024-12-02 11:48:39,868 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -25 predicate places. [2024-12-02 11:48:39,868 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 72 flow [2024-12-02 11:48:39,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-12-02 11:48:39,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:39,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:39,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 11:48:39,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:39,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:39,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1203937752, now seen corresponding path program 1 times [2024-12-02 11:48:39,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:48:39,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650506456] [2024-12-02 11:48:39,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:39,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:48:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:40,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:48:40,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650506456] [2024-12-02 11:48:40,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650506456] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:40,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:40,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:48:40,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788869816] [2024-12-02 11:48:40,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:40,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:48:40,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:48:40,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:48:40,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:48:40,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-12-02 11:48:40,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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) [2024-12-02 11:48:40,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:40,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-12-02 11:48:40,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:40,328 INFO L124 PetriNetUnfolderBase]: 129/358 cut-off events. [2024-12-02 11:48:40,328 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-12-02 11:48:40,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 358 events. 129/358 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1966 event pairs, 21 based on Foata normal form. 8/363 useless extension candidates. Maximal degree in co-relation 664. Up to 176 conditions per place. [2024-12-02 11:48:40,331 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 26 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2024-12-02 11:48:40,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 150 flow [2024-12-02 11:48:40,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:48:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 11:48:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-12-02 11:48:40,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34274193548387094 [2024-12-02 11:48:40,333 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 72 flow. Second operand 4 states and 85 transitions. [2024-12-02 11:48:40,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 150 flow [2024-12-02 11:48:40,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 11:48:40,334 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 67 flow [2024-12-02 11:48:40,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=63, 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=4, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-12-02 11:48:40,335 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -26 predicate places. [2024-12-02 11:48:40,335 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 67 flow [2024-12-02 11:48:40,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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) [2024-12-02 11:48:40,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:40,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:40,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 11:48:40,335 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:40,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1641159969, now seen corresponding path program 1 times [2024-12-02 11:48:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:48:40,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686505076] [2024-12-02 11:48:40,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:40,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:48:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:40,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:48:40,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686505076] [2024-12-02 11:48:40,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686505076] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:40,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:40,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 11:48:40,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539554371] [2024-12-02 11:48:40,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:40,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:48:40,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:48:40,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:48:40,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:48:40,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 62 [2024-12-02 11:48:40,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2024-12-02 11:48:40,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:40,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 62 [2024-12-02 11:48:40,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:40,488 INFO L124 PetriNetUnfolderBase]: 129/293 cut-off events. [2024-12-02 11:48:40,488 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-12-02 11:48:40,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 293 events. 129/293 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1533 event pairs, 129 based on Foata normal form. 12/295 useless extension candidates. Maximal degree in co-relation 599. Up to 232 conditions per place. [2024-12-02 11:48:40,490 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 14 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2024-12-02 11:48:40,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 97 flow [2024-12-02 11:48:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:48:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:48:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-12-02 11:48:40,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3010752688172043 [2024-12-02 11:48:40,491 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 67 flow. Second operand 3 states and 56 transitions. [2024-12-02 11:48:40,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 97 flow [2024-12-02 11:48:40,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:48:40,492 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 62 flow [2024-12-02 11:48:40,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2024-12-02 11:48:40,493 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -27 predicate places. [2024-12-02 11:48:40,493 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 62 flow [2024-12-02 11:48:40,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2024-12-02 11:48:40,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:40,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:40,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 11:48:40,493 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:40,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1641160601, now seen corresponding path program 1 times [2024-12-02 11:48:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:48:40,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373648974] [2024-12-02 11:48:40,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:48:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:40,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:48:40,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373648974] [2024-12-02 11:48:40,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373648974] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:40,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:40,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:48:40,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137976524] [2024-12-02 11:48:40,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:40,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:48:40,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:48:40,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:48:40,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:48:40,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2024-12-02 11:48:40,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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) [2024-12-02 11:48:40,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:40,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2024-12-02 11:48:40,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:40,864 INFO L124 PetriNetUnfolderBase]: 180/382 cut-off events. [2024-12-02 11:48:40,864 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:48:40,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 382 events. 180/382 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1757 event pairs, 24 based on Foata normal form. 20/397 useless extension candidates. Maximal degree in co-relation 781. Up to 199 conditions per place. [2024-12-02 11:48:40,867 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 29 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-12-02 11:48:40,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 168 flow [2024-12-02 11:48:40,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:48:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 11:48:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-12-02 11:48:40,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-12-02 11:48:40,868 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 62 flow. Second operand 4 states and 80 transitions. [2024-12-02 11:48:40,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 168 flow [2024-12-02 11:48:40,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:48:40,869 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 87 flow [2024-12-02 11:48:40,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2024-12-02 11:48:40,870 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -24 predicate places. [2024-12-02 11:48:40,870 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 87 flow [2024-12-02 11:48:40,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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) [2024-12-02 11:48:40,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:40,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:40,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 11:48:40,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:40,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1624571733, now seen corresponding path program 1 times [2024-12-02 11:48:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:48:40,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574312628] [2024-12-02 11:48:40,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:40,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:48:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:41,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:48:41,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574312628] [2024-12-02 11:48:41,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574312628] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:41,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:41,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:48:41,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624865306] [2024-12-02 11:48:41,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:41,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:48:41,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:48:41,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:48:41,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:48:41,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2024-12-02 11:48:41,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) [2024-12-02 11:48:41,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:41,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2024-12-02 11:48:41,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:41,336 INFO L124 PetriNetUnfolderBase]: 88/194 cut-off events. [2024-12-02 11:48:41,336 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-12-02 11:48:41,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 194 events. 88/194 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 620 event pairs, 16 based on Foata normal form. 14/203 useless extension candidates. Maximal degree in co-relation 477. Up to 71 conditions per place. [2024-12-02 11:48:41,337 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 25 selfloop transitions, 6 changer transitions 1/40 dead transitions. [2024-12-02 11:48:41,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 182 flow [2024-12-02 11:48:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:48:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 11:48:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-12-02 11:48:41,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2870967741935484 [2024-12-02 11:48:41,340 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 87 flow. Second operand 5 states and 89 transitions. [2024-12-02 11:48:41,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 182 flow [2024-12-02 11:48:41,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 173 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-12-02 11:48:41,342 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 103 flow [2024-12-02 11:48:41,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2024-12-02 11:48:41,343 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -20 predicate places. [2024-12-02 11:48:41,343 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 103 flow [2024-12-02 11:48:41,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) [2024-12-02 11:48:41,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:41,343 INFO L206 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] [2024-12-02 11:48:41,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 11:48:41,343 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:41,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1834676303, now seen corresponding path program 1 times [2024-12-02 11:48:41,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:48:41,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511502274] [2024-12-02 11:48:41,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:41,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:48:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:48:41,433 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 11:48:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:48:41,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 11:48:41,559 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 11:48:41,560 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2024-12-02 11:48:41,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2024-12-02 11:48:41,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2024-12-02 11:48:41,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2024-12-02 11:48:41,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2024-12-02 11:48:41,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2024-12-02 11:48:41,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2024-12-02 11:48:41,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2024-12-02 11:48:41,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2024-12-02 11:48:41,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2024-12-02 11:48:41,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2024-12-02 11:48:41,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 54 remaining) [2024-12-02 11:48:41,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2024-12-02 11:48:41,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2024-12-02 11:48:41,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (24 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2024-12-02 11:48:41,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2024-12-02 11:48:41,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 54 remaining) [2024-12-02 11:48:41,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2024-12-02 11:48:41,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2024-12-02 11:48:41,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 54 remaining) [2024-12-02 11:48:41,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 54 remaining) [2024-12-02 11:48:41,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 54 remaining) [2024-12-02 11:48:41,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 54 remaining) [2024-12-02 11:48:41,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 54 remaining) [2024-12-02 11:48:41,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 54 remaining) [2024-12-02 11:48:41,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 54 remaining) [2024-12-02 11:48:41,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 11:48:41,567 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:41,632 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 11:48:41,632 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 11:48:41,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:48:41 BasicIcfg [2024-12-02 11:48:41,638 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 11:48:41,639 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 11:48:41,639 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 11:48:41,639 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 11:48:41,640 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:48:37" (3/4) ... [2024-12-02 11:48:41,642 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 11:48:41,642 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 11:48:41,643 INFO L158 Benchmark]: Toolchain (without parser) took 5729.84ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 90.6MB in the beginning and 125.3MB in the end (delta: -34.7MB). Peak memory consumption was 116.0MB. Max. memory is 16.1GB. [2024-12-02 11:48:41,644 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 73.1MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:48:41,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.95ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 67.4MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 11:48:41,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.80ms. Allocated memory is still 117.4MB. Free memory was 67.4MB in the beginning and 65.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:48:41,645 INFO L158 Benchmark]: Boogie Preprocessor took 56.30ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 61.7MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 11:48:41,645 INFO L158 Benchmark]: RCFGBuilder took 1270.23ms. Allocated memory was 117.4MB in the beginning and 209.7MB in the end (delta: 92.3MB). Free memory was 61.7MB in the beginning and 162.0MB in the end (delta: -100.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-12-02 11:48:41,645 INFO L158 Benchmark]: TraceAbstraction took 3896.93ms. Allocated memory was 209.7MB in the beginning and 268.4MB in the end (delta: 58.7MB). Free memory was 160.7MB in the beginning and 125.3MB in the end (delta: 35.4MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. [2024-12-02 11:48:41,646 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 268.4MB. Free memory was 125.3MB in the beginning and 125.3MB in the end (delta: 35.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:48:41,648 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.27ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 73.1MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.95ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 67.4MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.80ms. Allocated memory is still 117.4MB. Free memory was 67.4MB in the beginning and 65.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.30ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 61.7MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1270.23ms. Allocated memory was 117.4MB in the beginning and 209.7MB in the end (delta: 92.3MB). Free memory was 61.7MB in the beginning and 162.0MB in the end (delta: -100.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3896.93ms. Allocated memory was 209.7MB in the beginning and 268.4MB in the end (delta: 58.7MB). Free memory was 160.7MB in the beginning and 125.3MB in the end (delta: 35.4MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 268.4MB. Free memory was 125.3MB in the beginning and 125.3MB in the end (delta: 35.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1921; [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L773] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L815] 0 pthread_t t1922; [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-2, t1922=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L785] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L788] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-2, t1922=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-2, t1922=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-2, t1922=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L18] 0 __assert_fail ("0", "safe006_power.oepc-thin000_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] - 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: -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: -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: -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: -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: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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 5 procedures, 99 locations, 54 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: 3.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 177 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 286 IncrementalHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 0 mSDtfsCounter, 286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=0, InterpolantAutomatonStates: 29, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-12-02 11:48:41,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1 --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 e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:48:43,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:48:43,805 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-12-02 11:48:43,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:48:43,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:48:43,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:48:43,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:48:43,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:48:43,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 11:48:43,836 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 11:48:43,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:48:43,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:48:43,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:48:43,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:48:43,837 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:48:43,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:48:43,838 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 11:48:43,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 11:48:43,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 11:48:43,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:48:43,838 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 11:48:43,838 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 11:48:43,838 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 11:48:43,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:48:43,838 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 11:48:43,838 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 11:48:43,838 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 11:48:43,838 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 11:48:43,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 11:48:43,839 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:48:43,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:48:43,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:48:43,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:48:43,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:48:43,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:48:43,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:48:43,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:48:43,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:48:43,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:48:43,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:48:43,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:48:43,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:48:43,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:48:43,840 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 11:48:43,840 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 11:48:43,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:48:43,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:48:43,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:48:43,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:48:43,840 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1 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 -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae [2024-12-02 11:48:44,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:48:44,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:48:44,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:48:44,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:48:44,097 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:48:44,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-12-02 11:48:46,892 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/data/791e03e87/2a06c41928214b77a3653a46a140238c/FLAG6c79aba0a [2024-12-02 11:48:47,145 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:48:47,146 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-12-02 11:48:47,160 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/data/791e03e87/2a06c41928214b77a3653a46a140238c/FLAG6c79aba0a [2024-12-02 11:48:47,177 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/data/791e03e87/2a06c41928214b77a3653a46a140238c [2024-12-02 11:48:47,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:48:47,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:48:47,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:48:47,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:48:47,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:48:47,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce389a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47, skipping insertion in model container [2024-12-02 11:48:47,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:48:47,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:48:47,525 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:48:47,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:48:47,618 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:48:47,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47 WrapperNode [2024-12-02 11:48:47,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:48:47,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:48:47,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:48:47,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:48:47,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,662 INFO L138 Inliner]: procedures = 178, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2024-12-02 11:48:47,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:48:47,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:48:47,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:48:47,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:48:47,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,688 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-12-02 11:48:47,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:48:47,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:48:47,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:48:47,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:48:47,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2024-12-02 11:48:47,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:48:47,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:48:47,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:48:47,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:48:47,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-12-02 11:48:47,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-12-02 11:48:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 11:48:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:48:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-12-02 11:48:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-12-02 11:48:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 11:48:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-12-02 11:48:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-12-02 11:48:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-12-02 11:48:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-12-02 11:48:47,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-12-02 11:48:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-12-02 11:48:47,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-12-02 11:48:47,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 11:48:47,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:48:47,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:48:47,770 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 11:48:47,913 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:48:47,915 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:48:48,401 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 11:48:48,401 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:48:49,093 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:48:49,093 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 11:48:49,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:48:49 BoogieIcfgContainer [2024-12-02 11:48:49,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:48:49,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:48:49,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:48:49,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:48:49,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:48:47" (1/3) ... [2024-12-02 11:48:49,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a0c475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:48:49, skipping insertion in model container [2024-12-02 11:48:49,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (2/3) ... [2024-12-02 11:48:49,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a0c475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:48:49, skipping insertion in model container [2024-12-02 11:48:49,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:48:49" (3/3) ... [2024-12-02 11:48:49,119 INFO L128 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2024-12-02 11:48:49,137 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:48:49,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe006_power.oepc-thin000_power.oepc.i that has 3 procedures, 61 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2024-12-02 11:48:49,140 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 11:48:49,304 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-02 11:48:49,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 62 transitions, 132 flow [2024-12-02 11:48:49,394 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2024-12-02 11:48:49,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:48:49,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 60 events. 2/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 194 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2024-12-02 11:48:49,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 62 transitions, 132 flow [2024-12-02 11:48:49,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 60 transitions, 126 flow [2024-12-02 11:48:49,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:48:49,425 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@6535364d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:48:49,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-12-02 11:48:49,431 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 11:48:49,431 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-12-02 11:48:49,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:48:49,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:49,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-12-02 11:48:49,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:49,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:49,439 INFO L85 PathProgramCache]: Analyzing trace with hash 21489027, now seen corresponding path program 1 times [2024-12-02 11:48:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:48:49,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547253724] [2024-12-02 11:48:49,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:49,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:49,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:48:49,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:48:49,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 11:48:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:49,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 11:48:49,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:48:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:49,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:48:49,687 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:48:49,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547253724] [2024-12-02 11:48:49,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547253724] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:49,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:49,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 11:48:49,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470970946] [2024-12-02 11:48:49,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:49,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:48:49,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:48:49,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:48:49,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:48:49,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-12-02 11:48:49,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-12-02 11:48:49,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:49,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-12-02 11:48:49,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:50,282 INFO L124 PetriNetUnfolderBase]: 564/1085 cut-off events. [2024-12-02 11:48:50,282 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:48:50,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 1085 events. 564/1085 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7284 event pairs, 564 based on Foata normal form. 56/760 useless extension candidates. Maximal degree in co-relation 2026. Up to 937 conditions per place. [2024-12-02 11:48:50,293 INFO L140 encePairwiseOnDemand]: 39/62 looper letters, 24 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2024-12-02 11:48:50,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 130 flow [2024-12-02 11:48:50,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:48:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:48:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-12-02 11:48:50,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.478494623655914 [2024-12-02 11:48:50,308 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 126 flow. Second operand 3 states and 89 transitions. [2024-12-02 11:48:50,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 130 flow [2024-12-02 11:48:50,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:48:50,315 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 80 flow [2024-12-02 11:48:50,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-12-02 11:48:50,321 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -21 predicate places. [2024-12-02 11:48:50,321 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 80 flow [2024-12-02 11:48:50,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-12-02 11:48:50,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:50,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-12-02 11:48:50,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 11:48:50,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:50,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:50,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash 21489028, now seen corresponding path program 1 times [2024-12-02 11:48:50,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:48:50,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544439949] [2024-12-02 11:48:50,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:50,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:50,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:48:50,526 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:48:50,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 11:48:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:50,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 11:48:50,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:48:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:50,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:48:50,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:48:50,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544439949] [2024-12-02 11:48:50,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544439949] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:50,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:50,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 11:48:50,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800142376] [2024-12-02 11:48:50,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:50,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:48:50,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:48:50,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:48:50,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:48:50,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-12-02 11:48:50,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-12-02 11:48:50,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:50,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-12-02 11:48:50,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:50,888 INFO L124 PetriNetUnfolderBase]: 180/392 cut-off events. [2024-12-02 11:48:50,888 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:48:50,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 392 events. 180/392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2259 event pairs, 180 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 717. Up to 319 conditions per place. [2024-12-02 11:48:50,892 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 17 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2024-12-02 11:48:50,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 106 flow [2024-12-02 11:48:50,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:48:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:48:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-12-02 11:48:50,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3602150537634409 [2024-12-02 11:48:50,893 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 80 flow. Second operand 3 states and 67 transitions. [2024-12-02 11:48:50,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 106 flow [2024-12-02 11:48:50,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:48:50,895 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 67 flow [2024-12-02 11:48:50,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2024-12-02 11:48:50,896 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -26 predicate places. [2024-12-02 11:48:50,896 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 67 flow [2024-12-02 11:48:50,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-12-02 11:48:50,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:50,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:50,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-12-02 11:48:51,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:51,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:51,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:51,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1493577562, now seen corresponding path program 1 times [2024-12-02 11:48:51,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:48:51,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314669411] [2024-12-02 11:48:51,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:51,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:51,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:48:51,101 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:48:51,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 11:48:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:51,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 11:48:51,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:48:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:51,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:48:51,255 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:48:51,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314669411] [2024-12-02 11:48:51,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314669411] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:51,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:51,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 11:48:51,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713150046] [2024-12-02 11:48:51,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:51,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:48:51,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:48:51,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:48:51,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:48:51,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-12-02 11:48:51,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2024-12-02 11:48:51,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:51,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-12-02 11:48:51,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:51,435 INFO L124 PetriNetUnfolderBase]: 149/394 cut-off events. [2024-12-02 11:48:51,436 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:48:51,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 394 events. 149/394 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2205 event pairs, 29 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 668. Up to 213 conditions per place. [2024-12-02 11:48:51,438 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 28 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2024-12-02 11:48:51,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 153 flow [2024-12-02 11:48:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:48:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:48:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-12-02 11:48:51,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-12-02 11:48:51,440 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 67 flow. Second operand 3 states and 74 transitions. [2024-12-02 11:48:51,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 153 flow [2024-12-02 11:48:51,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:48:51,442 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 76 flow [2024-12-02 11:48:51,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-12-02 11:48:51,443 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -25 predicate places. [2024-12-02 11:48:51,443 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 76 flow [2024-12-02 11:48:51,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2024-12-02 11:48:51,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:51,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:51,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-12-02 11:48:51,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:51,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:51,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:51,644 INFO L85 PathProgramCache]: Analyzing trace with hash 808985833, now seen corresponding path program 1 times [2024-12-02 11:48:51,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:48:51,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492942368] [2024-12-02 11:48:51,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:51,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:51,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:48:51,647 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:48:51,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 11:48:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:51,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 11:48:51,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:48:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:51,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:48:51,856 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:48:51,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492942368] [2024-12-02 11:48:51,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492942368] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:51,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:51,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:48:51,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916760191] [2024-12-02 11:48:51,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:51,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:48:51,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:48:51,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:48:51,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:48:51,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-12-02 11:48:51,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-12-02 11:48:51,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:51,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-12-02 11:48:51,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:52,053 INFO L124 PetriNetUnfolderBase]: 139/320 cut-off events. [2024-12-02 11:48:52,053 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-12-02 11:48:52,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 320 events. 139/320 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1638 event pairs, 55 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 652. Up to 194 conditions per place. [2024-12-02 11:48:52,056 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 27 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2024-12-02 11:48:52,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 156 flow [2024-12-02 11:48:52,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:48:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 11:48:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-12-02 11:48:52,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-12-02 11:48:52,057 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 76 flow. Second operand 4 states and 86 transitions. [2024-12-02 11:48:52,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 156 flow [2024-12-02 11:48:52,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:48:52,058 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 72 flow [2024-12-02 11:48:52,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2024-12-02 11:48:52,059 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -25 predicate places. [2024-12-02 11:48:52,059 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 72 flow [2024-12-02 11:48:52,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-12-02 11:48:52,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:52,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:52,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 11:48:52,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:52,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:52,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:52,261 INFO L85 PathProgramCache]: Analyzing trace with hash 808985834, now seen corresponding path program 1 times [2024-12-02 11:48:52,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:48:52,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516456687] [2024-12-02 11:48:52,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:52,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:52,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:48:52,263 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:48:52,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 11:48:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:52,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 11:48:52,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:48:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:52,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:48:52,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:48:52,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516456687] [2024-12-02 11:48:52,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516456687] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:52,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:52,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:48:52,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199367507] [2024-12-02 11:48:52,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:52,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:48:52,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:48:52,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:48:52,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:48:52,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-12-02 11:48:52,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-12-02 11:48:52,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:52,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-12-02 11:48:52,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:52,683 INFO L124 PetriNetUnfolderBase]: 129/302 cut-off events. [2024-12-02 11:48:52,683 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-12-02 11:48:52,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 302 events. 129/302 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1521 event pairs, 45 based on Foata normal form. 8/299 useless extension candidates. Maximal degree in co-relation 608. Up to 176 conditions per place. [2024-12-02 11:48:52,685 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 26 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2024-12-02 11:48:52,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 150 flow [2024-12-02 11:48:52,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:48:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 11:48:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-12-02 11:48:52,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34274193548387094 [2024-12-02 11:48:52,686 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 72 flow. Second operand 4 states and 85 transitions. [2024-12-02 11:48:52,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 150 flow [2024-12-02 11:48:52,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 11:48:52,688 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 67 flow [2024-12-02 11:48:52,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=63, 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=4, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-12-02 11:48:52,688 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -26 predicate places. [2024-12-02 11:48:52,688 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 67 flow [2024-12-02 11:48:52,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-12-02 11:48:52,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:52,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:52,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 11:48:52,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:52,890 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:52,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash 43123041, now seen corresponding path program 1 times [2024-12-02 11:48:52,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:48:52,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181770225] [2024-12-02 11:48:52,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:52,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:52,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:48:52,892 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:48:52,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 11:48:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:53,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 11:48:53,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:48:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:53,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:48:53,027 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:48:53,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181770225] [2024-12-02 11:48:53,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181770225] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:53,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:53,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 11:48:53,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051435275] [2024-12-02 11:48:53,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:53,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:48:53,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:48:53,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:48:53,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:48:53,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 62 [2024-12-02 11:48:53,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2024-12-02 11:48:53,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:53,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 62 [2024-12-02 11:48:53,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:53,144 INFO L124 PetriNetUnfolderBase]: 129/293 cut-off events. [2024-12-02 11:48:53,144 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-12-02 11:48:53,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 293 events. 129/293 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1547 event pairs, 129 based on Foata normal form. 12/295 useless extension candidates. Maximal degree in co-relation 599. Up to 232 conditions per place. [2024-12-02 11:48:53,146 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 14 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2024-12-02 11:48:53,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 97 flow [2024-12-02 11:48:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:48:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:48:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-12-02 11:48:53,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3010752688172043 [2024-12-02 11:48:53,148 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 67 flow. Second operand 3 states and 56 transitions. [2024-12-02 11:48:53,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 97 flow [2024-12-02 11:48:53,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:48:53,148 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 62 flow [2024-12-02 11:48:53,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2024-12-02 11:48:53,149 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -27 predicate places. [2024-12-02 11:48:53,149 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 62 flow [2024-12-02 11:48:53,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2024-12-02 11:48:53,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:53,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:53,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 11:48:53,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:53,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:53,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:53,351 INFO L85 PathProgramCache]: Analyzing trace with hash 43122409, now seen corresponding path program 1 times [2024-12-02 11:48:53,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:48:53,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621284622] [2024-12-02 11:48:53,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:53,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:53,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:48:53,353 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:48:53,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 11:48:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:53,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 11:48:53,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:48:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:53,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:48:53,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:48:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621284622] [2024-12-02 11:48:53,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621284622] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:53,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:53,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:48:53,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38815673] [2024-12-02 11:48:53,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:53,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:48:53,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:48:53,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:48:53,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:48:53,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2024-12-02 11:48:53,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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) [2024-12-02 11:48:53,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:53,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2024-12-02 11:48:53,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:53,641 INFO L124 PetriNetUnfolderBase]: 180/382 cut-off events. [2024-12-02 11:48:53,641 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:48:53,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 382 events. 180/382 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1757 event pairs, 24 based on Foata normal form. 20/397 useless extension candidates. Maximal degree in co-relation 781. Up to 199 conditions per place. [2024-12-02 11:48:53,643 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 29 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-12-02 11:48:53,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 168 flow [2024-12-02 11:48:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:48:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 11:48:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-12-02 11:48:53,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-12-02 11:48:53,645 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 62 flow. Second operand 4 states and 80 transitions. [2024-12-02 11:48:53,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 168 flow [2024-12-02 11:48:53,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:48:53,646 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 87 flow [2024-12-02 11:48:53,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2024-12-02 11:48:53,647 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -24 predicate places. [2024-12-02 11:48:53,647 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 87 flow [2024-12-02 11:48:53,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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) [2024-12-02 11:48:53,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:53,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:53,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 11:48:53,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:53,848 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:53,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:53,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1755103979, now seen corresponding path program 1 times [2024-12-02 11:48:53,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:48:53,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828166640] [2024-12-02 11:48:53,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:53,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:53,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:48:53,850 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:48:53,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 11:48:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:48:53,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 11:48:53,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:48:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:48:53,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:48:53,992 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:48:53,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828166640] [2024-12-02 11:48:53,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828166640] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:48:53,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:48:53,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:48:53,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618833944] [2024-12-02 11:48:53,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:48:53,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:48:53,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:48:53,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:48:53,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:48:53,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2024-12-02 11:48:53,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) [2024-12-02 11:48:53,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:48:53,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2024-12-02 11:48:53,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:48:54,152 INFO L124 PetriNetUnfolderBase]: 88/194 cut-off events. [2024-12-02 11:48:54,152 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-12-02 11:48:54,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 194 events. 88/194 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 616 event pairs, 16 based on Foata normal form. 14/203 useless extension candidates. Maximal degree in co-relation 477. Up to 71 conditions per place. [2024-12-02 11:48:54,153 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 25 selfloop transitions, 6 changer transitions 1/40 dead transitions. [2024-12-02 11:48:54,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 182 flow [2024-12-02 11:48:54,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:48:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 11:48:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-12-02 11:48:54,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2870967741935484 [2024-12-02 11:48:54,155 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 87 flow. Second operand 5 states and 89 transitions. [2024-12-02 11:48:54,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 182 flow [2024-12-02 11:48:54,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 173 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-12-02 11:48:54,157 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 103 flow [2024-12-02 11:48:54,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2024-12-02 11:48:54,157 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -20 predicate places. [2024-12-02 11:48:54,157 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 103 flow [2024-12-02 11:48:54,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) [2024-12-02 11:48:54,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:48:54,158 INFO L206 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] [2024-12-02 11:48:54,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 11:48:54,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:54,359 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-12-02 11:48:54,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:48:54,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1543878033, now seen corresponding path program 1 times [2024-12-02 11:48:54,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:48:54,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [613375666] [2024-12-02 11:48:54,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:48:54,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:54,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:48:54,361 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:48:54,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 11:48:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:48:54,486 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 11:48:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:48:54,581 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-12-02 11:48:54,581 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 11:48:54,582 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2024-12-02 11:48:54,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2024-12-02 11:48:54,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2024-12-02 11:48:54,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2024-12-02 11:48:54,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2024-12-02 11:48:54,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2024-12-02 11:48:54,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2024-12-02 11:48:54,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2024-12-02 11:48:54,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2024-12-02 11:48:54,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2024-12-02 11:48:54,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2024-12-02 11:48:54,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 54 remaining) [2024-12-02 11:48:54,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2024-12-02 11:48:54,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2024-12-02 11:48:54,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (24 of 54 remaining) [2024-12-02 11:48:54,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2024-12-02 11:48:54,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2024-12-02 11:48:54,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 54 remaining) [2024-12-02 11:48:54,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 54 remaining) [2024-12-02 11:48:54,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 54 remaining) [2024-12-02 11:48:54,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 54 remaining) [2024-12-02 11:48:54,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 54 remaining) [2024-12-02 11:48:54,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 54 remaining) [2024-12-02 11:48:54,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 54 remaining) [2024-12-02 11:48:54,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 11:48:54,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:48:54,788 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:48:54,841 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 11:48:54,841 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 11:48:54,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:48:54 BasicIcfg [2024-12-02 11:48:54,846 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 11:48:54,847 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 11:48:54,847 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 11:48:54,847 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 11:48:54,848 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:48:49" (3/4) ... [2024-12-02 11:48:54,849 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 11:48:54,850 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 11:48:54,851 INFO L158 Benchmark]: Toolchain (without parser) took 7670.08ms. Allocated memory was 92.3MB in the beginning and 192.9MB in the end (delta: 100.7MB). Free memory was 69.1MB in the beginning and 65.0MB in the end (delta: 4.1MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. [2024-12-02 11:48:54,851 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:48:54,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.23ms. Allocated memory is still 92.3MB. Free memory was 69.0MB in the beginning and 45.6MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 11:48:54,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.08ms. Allocated memory is still 92.3MB. Free memory was 45.5MB in the beginning and 43.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:48:54,852 INFO L158 Benchmark]: Boogie Preprocessor took 47.12ms. Allocated memory is still 92.3MB. Free memory was 43.4MB in the beginning and 40.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:48:54,852 INFO L158 Benchmark]: RCFGBuilder took 1382.91ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 40.0MB in the beginning and 40.1MB in the end (delta: -78.5kB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2024-12-02 11:48:54,853 INFO L158 Benchmark]: TraceAbstraction took 5749.63ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 40.1MB in the beginning and 65.1MB in the end (delta: -25.0MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-12-02 11:48:54,853 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 192.9MB. Free memory was 65.1MB in the beginning and 65.0MB in the end (delta: 23.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:48:54,855 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.53ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.23ms. Allocated memory is still 92.3MB. Free memory was 69.0MB in the beginning and 45.6MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.08ms. Allocated memory is still 92.3MB. Free memory was 45.5MB in the beginning and 43.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.12ms. Allocated memory is still 92.3MB. Free memory was 43.4MB in the beginning and 40.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1382.91ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 40.0MB in the beginning and 40.1MB in the end (delta: -78.5kB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5749.63ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 40.1MB in the beginning and 65.1MB in the end (delta: -25.0MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 192.9MB. Free memory was 65.1MB in the beginning and 65.0MB in the end (delta: 23.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1921; [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 \read(y) [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L773] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L815] 0 pthread_t t1922; [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L785] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L788] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L18] 0 __assert_fail ("0", "safe006_power.oepc-thin000_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] - 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: -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: -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: -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: -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: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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 5 procedures, 99 locations, 54 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: 5.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 310 IncrementalHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 2 mSDtfsCounter, 310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=0, InterpolantAutomatonStates: 29, 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.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 422 SizeOfPredicates, 5 NumberOfNonLiveVariables, 787 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-12-02 11:48:54,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f465721-f1e7-4ba7-b11e-041f6abd2c75/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample