./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC --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 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:23:38,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:23:38,158 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-24 00:23:38,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:23:38,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:23:38,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:23:38,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:23:38,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:23:38,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:23:38,200 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:23:38,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:23:38,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:23:38,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:23:38,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:23:38,201 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:23:38,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:23:38,201 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:23:38,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:23:38,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:23:38,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:23:38,202 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-24 00:23:38,202 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-24 00:23:38,202 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-24 00:23:38,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:23:38,202 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 00:23:38,202 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 00:23:38,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:23:38,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:23:38,203 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:23:38,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:23:38,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:23:38,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:23:38,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:23:38,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:23:38,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:23:38,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:23:38,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:23:38,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:23:38,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:23:38,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:23:38,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:23:38,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 00:23:38,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 00:23:38,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:23:38,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:23:38,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:23:38,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:23:38,204 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_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC 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 -> 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 [2024-11-24 00:23:38,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:23:38,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:23:38,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:23:38,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:23:38,575 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:23:38,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-24 00:23:41,547 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/data/f0eb66b3b/745d118b4a884a6f98966f70a3bc0bf7/FLAGa74bef29a [2024-11-24 00:23:41,948 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:23:41,949 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-24 00:23:41,968 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/data/f0eb66b3b/745d118b4a884a6f98966f70a3bc0bf7/FLAGa74bef29a [2024-11-24 00:23:41,991 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/data/f0eb66b3b/745d118b4a884a6f98966f70a3bc0bf7 [2024-11-24 00:23:41,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:23:41,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:23:41,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:23:41,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:23:42,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:23:42,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:23:41" (1/1) ... [2024-11-24 00:23:42,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb6e31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42, skipping insertion in model container [2024-11-24 00:23:42,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:23:41" (1/1) ... [2024-11-24 00:23:42,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:23:42,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:23:42,617 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:23:42,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:23:42,713 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:23:42,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42 WrapperNode [2024-11-24 00:23:42,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:23:42,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:23:42,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:23:42,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:23:42,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (1/1) ... [2024-11-24 00:23:42,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (1/1) ... [2024-11-24 00:23:42,759 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2024-11-24 00:23:42,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:23:42,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:23:42,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:23:42,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:23:42,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (1/1) ... [2024-11-24 00:23:42,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (1/1) ... [2024-11-24 00:23:42,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (1/1) ... [2024-11-24 00:23:42,807 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-24 00:23:42,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (1/1) ... [2024-11-24 00:23:42,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (1/1) ... [2024-11-24 00:23:42,821 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (1/1) ... [2024-11-24 00:23:42,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (1/1) ... [2024-11-24 00:23:42,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (1/1) ... [2024-11-24 00:23:42,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (1/1) ... [2024-11-24 00:23:42,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (1/1) ... [2024-11-24 00:23:42,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:23:42,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:23:42,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:23:42,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:23:42,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (1/1) ... [2024-11-24 00:23:42,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:23:42,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:23:42,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:23:42,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:23:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-24 00:23:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:23:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-24 00:23:42,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-24 00:23:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-24 00:23:42,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-24 00:23:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-24 00:23:42,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-24 00:23:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 00:23:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-24 00:23:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:23:42,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:23:42,919 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 00:23:43,049 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:23:43,050 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:23:43,455 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 00:23:43,455 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:23:43,716 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:23:43,718 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 00:23:43,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:23:43 BoogieIcfgContainer [2024-11-24 00:23:43,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:23:43,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:23:43,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:23:43,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:23:43,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:23:41" (1/3) ... [2024-11-24 00:23:43,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d09ae7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:23:43, skipping insertion in model container [2024-11-24 00:23:43,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:23:42" (2/3) ... [2024-11-24 00:23:43,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d09ae7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:23:43, skipping insertion in model container [2024-11-24 00:23:43,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:23:43" (3/3) ... [2024-11-24 00:23:43,731 INFO L128 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-24 00:23:43,750 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:23:43,753 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-24 00:23:43,753 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 00:23:43,828 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-24 00:23:43,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-24 00:23:43,921 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-24 00:23:43,924 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:23:43,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-24 00:23:43,930 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-24 00:23:43,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-24 00:23:43,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:23:43,968 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;@393dd5a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:23:43,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-24 00:23:43,977 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 00:23:43,978 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-24 00:23:43,978 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:23:43,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:23:43,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-24 00:23:43,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:23:43,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:23:43,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1558854706, now seen corresponding path program 1 times [2024-11-24 00:23:43,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:23:43,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093135260] [2024-11-24 00:23:43,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:23:43,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:23:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:23:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:23:44,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:23:44,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093135260] [2024-11-24 00:23:44,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093135260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:23:44,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:23:44,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:23:44,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688807311] [2024-11-24 00:23:44,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:23:44,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:23:44,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:23:44,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:23:44,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:23:44,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2024-11-24 00:23:44,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-11-24 00:23:44,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:23:44,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2024-11-24 00:23:44,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:23:45,129 INFO L124 PetriNetUnfolderBase]: 603/1128 cut-off events. [2024-11-24 00:23:45,130 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-24 00:23:45,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2087 conditions, 1128 events. 603/1128 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6958 event pairs, 192 based on Foata normal form. 72/1184 useless extension candidates. Maximal degree in co-relation 2076. Up to 742 conditions per place. [2024-11-24 00:23:45,149 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 29 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-11-24 00:23:45,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 180 flow [2024-11-24 00:23:45,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:23:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:23:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-11-24 00:23:45,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7481481481481481 [2024-11-24 00:23:45,170 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 101 transitions. [2024-11-24 00:23:45,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 180 flow [2024-11-24 00:23:45,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-24 00:23:45,183 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-24 00:23:45,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-24 00:23:45,193 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-24 00:23:45,193 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-24 00:23:45,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-11-24 00:23:45,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:23:45,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:23:45,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 00:23:45,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:23:45,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:23:45,195 INFO L85 PathProgramCache]: Analyzing trace with hash -636466933, now seen corresponding path program 1 times [2024-11-24 00:23:45,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:23:45,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786013215] [2024-11-24 00:23:45,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:23:45,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:23:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:23:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:23:45,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:23:45,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786013215] [2024-11-24 00:23:45,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786013215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:23:45,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:23:45,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:23:45,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330113743] [2024-11-24 00:23:45,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:23:45,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:23:45,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:23:45,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:23:45,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:23:45,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-24 00:23:45,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-11-24 00:23:45,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:23:45,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-24 00:23:45,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:23:45,688 INFO L124 PetriNetUnfolderBase]: 528/1053 cut-off events. [2024-11-24 00:23:45,688 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-24 00:23:45,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 1053 events. 528/1053 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6925 event pairs, 528 based on Foata normal form. 36/1043 useless extension candidates. Maximal degree in co-relation 1959. Up to 811 conditions per place. [2024-11-24 00:23:45,699 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 17 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2024-11-24 00:23:45,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 120 flow [2024-11-24 00:23:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:23:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:23:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-24 00:23:45,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-24 00:23:45,701 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 80 transitions. [2024-11-24 00:23:45,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 120 flow [2024-11-24 00:23:45,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:23:45,702 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2024-11-24 00:23:45,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-24 00:23:45,705 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-24 00:23:45,705 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2024-11-24 00:23:45,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-11-24 00:23:45,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:23:45,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:23:45,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 00:23:45,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:23:45,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:23:45,708 INFO L85 PathProgramCache]: Analyzing trace with hash -636466982, now seen corresponding path program 1 times [2024-11-24 00:23:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:23:45,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700383759] [2024-11-24 00:23:45,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:23:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:23:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:23:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:23:46,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:23:46,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700383759] [2024-11-24 00:23:46,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700383759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:23:46,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:23:46,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:23:46,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907899733] [2024-11-24 00:23:46,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:23:46,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:23:46,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:23:46,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:23:46,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:23:46,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-24 00:23:46,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-11-24 00:23:46,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:23:46,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-24 00:23:46,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:23:46,520 INFO L124 PetriNetUnfolderBase]: 1213/2140 cut-off events. [2024-11-24 00:23:46,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:23:46,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4036 conditions, 2140 events. 1213/2140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13594 event pairs, 147 based on Foata normal form. 80/2187 useless extension candidates. Maximal degree in co-relation 4030. Up to 1081 conditions per place. [2024-11-24 00:23:46,534 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 39 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-11-24 00:23:46,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 218 flow [2024-11-24 00:23:46,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:23:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 00:23:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-24 00:23:46,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-24 00:23:46,536 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 115 transitions. [2024-11-24 00:23:46,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 218 flow [2024-11-24 00:23:46,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 00:23:46,538 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2024-11-24 00:23:46,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-24 00:23:46,541 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-24 00:23:46,541 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2024-11-24 00:23:46,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-11-24 00:23:46,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:23:46,542 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] [2024-11-24 00:23:46,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 00:23:46,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:23:46,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:23:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1444658052, now seen corresponding path program 1 times [2024-11-24 00:23:46,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:23:46,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950756315] [2024-11-24 00:23:46,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:23:46,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:23:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:23:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:23:46,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:23:46,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950756315] [2024-11-24 00:23:46,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950756315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:23:46,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:23:46,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:23:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39246492] [2024-11-24 00:23:46,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:23:46,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:23:46,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:23:46,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:23:46,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:23:46,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-24 00:23:46,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-11-24 00:23:46,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:23:46,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-24 00:23:46,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:23:47,360 INFO L124 PetriNetUnfolderBase]: 809/1436 cut-off events. [2024-11-24 00:23:47,360 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2024-11-24 00:23:47,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1436 events. 809/1436 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8054 event pairs, 73 based on Foata normal form. 68/1478 useless extension candidates. Maximal degree in co-relation 3234. Up to 521 conditions per place. [2024-11-24 00:23:47,370 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 49 selfloop transitions, 8 changer transitions 1/71 dead transitions. [2024-11-24 00:23:47,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 314 flow [2024-11-24 00:23:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:23:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-24 00:23:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-24 00:23:47,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-11-24 00:23:47,373 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 145 transitions. [2024-11-24 00:23:47,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 314 flow [2024-11-24 00:23:47,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-24 00:23:47,378 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2024-11-24 00:23:47,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-24 00:23:47,379 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-24 00:23:47,379 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2024-11-24 00:23:47,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-11-24 00:23:47,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:23:47,380 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, 1, 1] [2024-11-24 00:23:47,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 00:23:47,380 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:23:47,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:23:47,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1752426939, now seen corresponding path program 1 times [2024-11-24 00:23:47,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:23:47,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986262335] [2024-11-24 00:23:47,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:23:47,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:23:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:23:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:23:47,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:23:47,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986262335] [2024-11-24 00:23:47,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986262335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:23:47,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:23:47,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:23:47,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815129193] [2024-11-24 00:23:47,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:23:47,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:23:47,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:23:47,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:23:47,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:23:47,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-24 00:23:47,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-11-24 00:23:47,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:23:47,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-24 00:23:47,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:23:48,083 INFO L124 PetriNetUnfolderBase]: 477/820 cut-off events. [2024-11-24 00:23:48,083 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2024-11-24 00:23:48,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2133 conditions, 820 events. 477/820 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3789 event pairs, 59 based on Foata normal form. 36/832 useless extension candidates. Maximal degree in co-relation 2122. Up to 268 conditions per place. [2024-11-24 00:23:48,102 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 43 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-11-24 00:23:48,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 325 flow [2024-11-24 00:23:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:23:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:23:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-11-24 00:23:48,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-11-24 00:23:48,104 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 159 transitions. [2024-11-24 00:23:48,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 325 flow [2024-11-24 00:23:48,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-24 00:23:48,113 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2024-11-24 00:23:48,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2024-11-24 00:23:48,115 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2024-11-24 00:23:48,115 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2024-11-24 00:23:48,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-11-24 00:23:48,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:23:48,116 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:23:48,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 00:23:48,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:23:48,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:23:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash -926173030, now seen corresponding path program 1 times [2024-11-24 00:23:48,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:23:48,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140168864] [2024-11-24 00:23:48,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:23:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:23:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:23:48,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-11-24 00:23:48,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:23:48,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140168864] [2024-11-24 00:23:48,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140168864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:23:48,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:23:48,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:23:48,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166892374] [2024-11-24 00:23:48,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:23:48,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:23:48,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:23:48,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:23:48,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:23:48,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-24 00:23:48,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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-11-24 00:23:48,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:23:48,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-24 00:23:48,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:23:49,026 INFO L124 PetriNetUnfolderBase]: 681/1304 cut-off events. [2024-11-24 00:23:49,026 INFO L125 PetriNetUnfolderBase]: For 583/603 co-relation queries the response was YES. [2024-11-24 00:23:49,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2943 conditions, 1304 events. 681/1304 cut-off events. For 583/603 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7325 event pairs, 264 based on Foata normal form. 8/1267 useless extension candidates. Maximal degree in co-relation 2931. Up to 628 conditions per place. [2024-11-24 00:23:49,033 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 30 selfloop transitions, 5 changer transitions 11/65 dead transitions. [2024-11-24 00:23:49,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 317 flow [2024-11-24 00:23:49,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:23:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-24 00:23:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-11-24 00:23:49,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2024-11-24 00:23:49,035 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 5 states and 132 transitions. [2024-11-24 00:23:49,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 317 flow [2024-11-24 00:23:49,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 253 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-24 00:23:49,042 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 142 flow [2024-11-24 00:23:49,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2024-11-24 00:23:49,043 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2024-11-24 00:23:49,043 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 142 flow [2024-11-24 00:23:49,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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-11-24 00:23:49,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:23:49,043 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:23:49,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 00:23:49,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:23:49,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:23:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash -748935420, now seen corresponding path program 2 times [2024-11-24 00:23:49,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:23:49,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011136059] [2024-11-24 00:23:49,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:23:49,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:23:49,133 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:23:49,133 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:23:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:23:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:23:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011136059] [2024-11-24 00:23:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011136059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:23:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:23:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 00:23:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311580605] [2024-11-24 00:23:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:23:51,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 00:23:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:23:51,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 00:23:51,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-24 00:23:51,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-24 00:23:51,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 142 flow. Second operand has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 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-11-24 00:23:51,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:23:51,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-24 00:23:51,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:23:51,787 INFO L124 PetriNetUnfolderBase]: 954/1881 cut-off events. [2024-11-24 00:23:51,788 INFO L125 PetriNetUnfolderBase]: For 79/134 co-relation queries the response was YES. [2024-11-24 00:23:51,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3867 conditions, 1881 events. 954/1881 cut-off events. For 79/134 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11953 event pairs, 364 based on Foata normal form. 36/1795 useless extension candidates. Maximal degree in co-relation 3856. Up to 422 conditions per place. [2024-11-24 00:23:51,796 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 40 selfloop transitions, 5 changer transitions 21/90 dead transitions. [2024-11-24 00:23:51,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 90 transitions, 394 flow [2024-11-24 00:23:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:23:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-24 00:23:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 224 transitions. [2024-11-24 00:23:51,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-11-24 00:23:51,798 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 142 flow. Second operand 8 states and 224 transitions. [2024-11-24 00:23:51,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 90 transitions, 394 flow [2024-11-24 00:23:51,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 377 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-24 00:23:51,801 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 174 flow [2024-11-24 00:23:51,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=174, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2024-11-24 00:23:51,802 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-24 00:23:51,802 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 174 flow [2024-11-24 00:23:51,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 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-11-24 00:23:51,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:23:51,803 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:23:51,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 00:23:51,803 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:23:51,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:23:51,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1864368544, now seen corresponding path program 3 times [2024-11-24 00:23:51,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:23:51,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707929536] [2024-11-24 00:23:51,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 00:23:51,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:23:51,893 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-24 00:23:51,893 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:23:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:23:52,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:23:52,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707929536] [2024-11-24 00:23:52,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707929536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:23:52,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:23:52,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:23:52,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829795578] [2024-11-24 00:23:52,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:23:52,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 00:23:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:23:52,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 00:23:52,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:23:52,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-24 00:23:52,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 174 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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-11-24 00:23:52,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:23:52,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-24 00:23:52,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:23:52,772 INFO L124 PetriNetUnfolderBase]: 1603/3010 cut-off events. [2024-11-24 00:23:52,772 INFO L125 PetriNetUnfolderBase]: For 871/871 co-relation queries the response was YES. [2024-11-24 00:23:52,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6884 conditions, 3010 events. 1603/3010 cut-off events. For 871/871 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 20560 event pairs, 367 based on Foata normal form. 16/2909 useless extension candidates. Maximal degree in co-relation 6869. Up to 1122 conditions per place. [2024-11-24 00:23:52,783 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 28 selfloop transitions, 7 changer transitions 38/91 dead transitions. [2024-11-24 00:23:52,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 91 transitions, 464 flow [2024-11-24 00:23:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 00:23:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-24 00:23:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-11-24 00:23:52,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-24 00:23:52,785 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 174 flow. Second operand 7 states and 175 transitions. [2024-11-24 00:23:52,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 91 transitions, 464 flow [2024-11-24 00:23:52,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 91 transitions, 445 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-24 00:23:52,789 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 173 flow [2024-11-24 00:23:52,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=173, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2024-11-24 00:23:52,790 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-11-24 00:23:52,790 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 173 flow [2024-11-24 00:23:52,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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-11-24 00:23:52,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:23:52,791 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:23:52,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 00:23:52,791 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:23:52,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:23:52,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1422603394, now seen corresponding path program 4 times [2024-11-24 00:23:52,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:23:52,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014864931] [2024-11-24 00:23:52,792 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-24 00:23:52,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:23:52,858 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-24 00:23:52,858 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:23:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:23:53,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:23:53,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014864931] [2024-11-24 00:23:53,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014864931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:23:53,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:23:53,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:23:53,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913931127] [2024-11-24 00:23:53,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:23:53,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:23:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:23:53,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:23:53,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:23:53,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-11-24 00:23:53,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-11-24 00:23:53,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:23:53,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-11-24 00:23:53,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:23:53,320 INFO L124 PetriNetUnfolderBase]: 471/956 cut-off events. [2024-11-24 00:23:53,321 INFO L125 PetriNetUnfolderBase]: For 256/266 co-relation queries the response was YES. [2024-11-24 00:23:53,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2126 conditions, 956 events. 471/956 cut-off events. For 256/266 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4926 event pairs, 233 based on Foata normal form. 8/911 useless extension candidates. Maximal degree in co-relation 2116. Up to 364 conditions per place. [2024-11-24 00:23:53,325 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 22 selfloop transitions, 2 changer transitions 23/67 dead transitions. [2024-11-24 00:23:53,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 67 transitions, 328 flow [2024-11-24 00:23:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:23:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-24 00:23:53,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-11-24 00:23:53,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-24 00:23:53,327 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 173 flow. Second operand 5 states and 135 transitions. [2024-11-24 00:23:53,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 67 transitions, 328 flow [2024-11-24 00:23:53,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 67 transitions, 306 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-24 00:23:53,332 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 149 flow [2024-11-24 00:23:53,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2024-11-24 00:23:53,333 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-11-24 00:23:53,333 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 149 flow [2024-11-24 00:23:53,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-11-24 00:23:53,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:23:53,333 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:23:53,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 00:23:53,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:23:53,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:23:53,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1542190640, now seen corresponding path program 5 times [2024-11-24 00:23:53,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:23:53,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967891364] [2024-11-24 00:23:53,334 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-24 00:23:53,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:23:53,419 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:23:53,419 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-24 00:23:53,419 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:23:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:23:53,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 00:23:53,539 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:23:53,540 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-24 00:23:53,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-24 00:23:53,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-24 00:23:53,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-24 00:23:53,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-24 00:23:53,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-24 00:23:53,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-24 00:23:53,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 00:23:53,546 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-24 00:23:53,644 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-24 00:23:53,645 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:23:53,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:23:53 BasicIcfg [2024-11-24 00:23:53,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:23:53,651 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:23:53,651 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:23:53,651 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:23:53,652 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:23:43" (3/4) ... [2024-11-24 00:23:53,654 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 00:23:53,656 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:23:53,657 INFO L158 Benchmark]: Toolchain (without parser) took 11662.25ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 91.3MB in the beginning and 166.6MB in the end (delta: -75.3MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2024-11-24 00:23:53,657 INFO L158 Benchmark]: CDTParser took 1.38ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:23:53,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 718.27ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 68.3MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 00:23:53,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.32ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 66.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:23:53,658 INFO L158 Benchmark]: Boogie Preprocessor took 81.37ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 63.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:23:53,662 INFO L158 Benchmark]: RCFGBuilder took 876.42ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 70.1MB in the end (delta: -7.3MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-11-24 00:23:53,662 INFO L158 Benchmark]: TraceAbstraction took 9929.54ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 69.5MB in the beginning and 166.6MB in the end (delta: -97.1MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2024-11-24 00:23:53,662 INFO L158 Benchmark]: Witness Printer took 5.09ms. Allocated memory is still 276.8MB. Free memory was 166.6MB in the beginning and 166.6MB in the end (delta: 35.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:23:53,664 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 718.27ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 68.3MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.32ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 66.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 81.37ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 63.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 876.42ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 70.1MB in the end (delta: -7.3MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9929.54ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 69.5MB in the beginning and 166.6MB in the end (delta: -97.1MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. * Witness Printer took 5.09ms. Allocated memory is still 276.8MB. Free memory was 166.6MB in the beginning and 166.6MB in the end (delta: 35.3kB). Peak memory consumption was 8.4MB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L738] 0 int z = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2073; [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2074; [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073=-1, t2074=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L835] 0 pthread_t t2075; [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073=-1, t2074=0, t2075=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L744] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=-1, t2074=0, t2075=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=-1, t2074=0, t2075=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=-1, t2074=0, t2075=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L851] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L18] 0 __assert_fail ("0", "safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 834]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 7 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: 9.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 350 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 331 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 928 IncrementalHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 11 mSDtfsCounter, 928 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=7, InterpolantAutomatonStates: 46, 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.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 1057 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-11-24 00:23:53,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/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_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC --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 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:23:56,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:23:56,472 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-24 00:23:56,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:23:56,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:23:56,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:23:56,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:23:56,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:23:56,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:23:56,506 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:23:56,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:23:56,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:23:56,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:23:56,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:23:56,507 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:23:56,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:23:56,508 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:23:56,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:23:56,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:23:56,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:23:56,508 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-24 00:23:56,508 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-24 00:23:56,508 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-24 00:23:56,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:23:56,509 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 00:23:56,509 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 00:23:56,509 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 00:23:56,509 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 00:23:56,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:23:56,509 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:23:56,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:23:56,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:23:56,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:23:56,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:23:56,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:23:56,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:23:56,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:23:56,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:23:56,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:23:56,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:23:56,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:23:56,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:23:56,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:23:56,512 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 00:23:56,512 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 00:23:56,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:23:56,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:23:56,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:23:56,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:23:56,512 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_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC 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 -> 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 [2024-11-24 00:23:56,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:23:56,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:23:56,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:23:56,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:23:56,855 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:23:56,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-24 00:23:59,824 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/data/429325745/452e916929b940f19fce3b4b32fe9a73/FLAGeddc96e45 [2024-11-24 00:23:59,851 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-24 00:24:00,220 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:24:00,221 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-24 00:24:00,241 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/data/429325745/452e916929b940f19fce3b4b32fe9a73/FLAGeddc96e45 [2024-11-24 00:24:00,260 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/data/429325745/452e916929b940f19fce3b4b32fe9a73 [2024-11-24 00:24:00,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:24:00,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:24:00,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:24:00,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:24:00,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:24:00,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:00,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd40c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00, skipping insertion in model container [2024-11-24 00:24:00,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:00,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:24:00,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:24:00,757 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:24:00,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:24:00,898 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:24:00,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00 WrapperNode [2024-11-24 00:24:00,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:24:00,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:24:00,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:24:00,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:24:00,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:00,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:00,975 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2024-11-24 00:24:00,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:24:00,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:24:00,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:24:00,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:24:00,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:00,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:00,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:01,021 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-24 00:24:01,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:01,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:01,030 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:01,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:01,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:01,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:01,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:01,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:24:01,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:24:01,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:24:01,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:24:01,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (1/1) ... [2024-11-24 00:24:01,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:24:01,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:24:01,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:24:01,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:24:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-24 00:24:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:24:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 00:24:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-24 00:24:01,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-24 00:24:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-24 00:24:01,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-24 00:24:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-24 00:24:01,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-24 00:24:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-24 00:24:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:24:01,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:24:01,115 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 00:24:01,322 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:24:01,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:24:01,787 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 00:24:01,787 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:24:02,094 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:24:02,095 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 00:24:02,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:24:02 BoogieIcfgContainer [2024-11-24 00:24:02,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:24:02,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:24:02,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:24:02,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:24:02,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:24:00" (1/3) ... [2024-11-24 00:24:02,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238a52ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:24:02, skipping insertion in model container [2024-11-24 00:24:02,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:24:00" (2/3) ... [2024-11-24 00:24:02,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238a52ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:24:02, skipping insertion in model container [2024-11-24 00:24:02,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:24:02" (3/3) ... [2024-11-24 00:24:02,108 INFO L128 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-24 00:24:02,124 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:24:02,126 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-24 00:24:02,126 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 00:24:02,201 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-24 00:24:02,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-24 00:24:02,289 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-24 00:24:02,292 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:24:02,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-24 00:24:02,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-24 00:24:02,302 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-24 00:24:02,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:24:02,332 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;@45bba7c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:24:02,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-24 00:24:02,342 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 00:24:02,342 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-24 00:24:02,342 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:24:02,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:24:02,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-24 00:24:02,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:24:02,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:24:02,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1499687794, now seen corresponding path program 1 times [2024-11-24 00:24:02,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:24:02,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742777513] [2024-11-24 00:24:02,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:24:02,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:02,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:24:02,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:24:02,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 00:24:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:24:02,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 00:24:02,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:24:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:24:02,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:24:02,575 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:24:02,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742777513] [2024-11-24 00:24:02,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742777513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:24:02,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:24:02,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:24:02,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905980197] [2024-11-24 00:24:02,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:24:02,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:24:02,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:24:02,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:24:02,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:24:02,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2024-11-24 00:24:02,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-11-24 00:24:02,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:24:02,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2024-11-24 00:24:02,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:24:03,166 INFO L124 PetriNetUnfolderBase]: 603/1152 cut-off events. [2024-11-24 00:24:03,166 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-24 00:24:03,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 1152 events. 603/1152 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7359 event pairs, 96 based on Foata normal form. 72/1208 useless extension candidates. Maximal degree in co-relation 2100. Up to 742 conditions per place. [2024-11-24 00:24:03,188 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 29 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-11-24 00:24:03,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 180 flow [2024-11-24 00:24:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:24:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:24:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-11-24 00:24:03,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7481481481481481 [2024-11-24 00:24:03,208 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 101 transitions. [2024-11-24 00:24:03,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 180 flow [2024-11-24 00:24:03,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-24 00:24:03,221 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-24 00:24:03,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-24 00:24:03,229 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-24 00:24:03,231 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-24 00:24:03,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-11-24 00:24:03,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:24:03,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:24:03,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 00:24:03,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:03,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:24:03,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:24:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1243164851, now seen corresponding path program 1 times [2024-11-24 00:24:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:24:03,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1815357454] [2024-11-24 00:24:03,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:24:03,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:03,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:24:03,440 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:24:03,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 00:24:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:24:03,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 00:24:03,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:24:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:24:03,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:24:03,595 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:24:03,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815357454] [2024-11-24 00:24:03,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815357454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:24:03,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:24:03,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:24:03,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038647257] [2024-11-24 00:24:03,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:24:03,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:24:03,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:24:03,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:24:03,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:24:03,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-24 00:24:03,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-11-24 00:24:03,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:24:03,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-24 00:24:03,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:24:03,924 INFO L124 PetriNetUnfolderBase]: 528/1053 cut-off events. [2024-11-24 00:24:03,924 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-24 00:24:03,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 1053 events. 528/1053 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6950 event pairs, 528 based on Foata normal form. 36/1043 useless extension candidates. Maximal degree in co-relation 1959. Up to 811 conditions per place. [2024-11-24 00:24:03,935 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 17 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2024-11-24 00:24:03,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 120 flow [2024-11-24 00:24:03,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:24:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:24:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-24 00:24:03,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-24 00:24:03,941 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 80 transitions. [2024-11-24 00:24:03,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 120 flow [2024-11-24 00:24:03,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:24:03,943 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2024-11-24 00:24:03,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-24 00:24:03,946 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-24 00:24:03,947 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2024-11-24 00:24:03,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-11-24 00:24:03,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:24:03,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:24:03,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 00:24:04,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:04,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:24:04,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:24:04,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1243164900, now seen corresponding path program 1 times [2024-11-24 00:24:04,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:24:04,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991204677] [2024-11-24 00:24:04,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:24:04,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:04,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:24:04,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:24:04,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 00:24:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:24:04,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 00:24:04,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:24:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:24:04,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:24:04,304 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:24:04,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991204677] [2024-11-24 00:24:04,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991204677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:24:04,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:24:04,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:24:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161968195] [2024-11-24 00:24:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:24:04,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:24:04,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:24:04,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:24:04,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:24:04,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-24 00:24:04,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-11-24 00:24:04,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:24:04,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-24 00:24:04,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:24:04,760 INFO L124 PetriNetUnfolderBase]: 1213/2140 cut-off events. [2024-11-24 00:24:04,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:24:04,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4036 conditions, 2140 events. 1213/2140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13594 event pairs, 147 based on Foata normal form. 80/2187 useless extension candidates. Maximal degree in co-relation 4030. Up to 1081 conditions per place. [2024-11-24 00:24:04,775 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 39 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-11-24 00:24:04,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 218 flow [2024-11-24 00:24:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:24:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 00:24:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-24 00:24:04,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-24 00:24:04,780 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 115 transitions. [2024-11-24 00:24:04,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 218 flow [2024-11-24 00:24:04,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 00:24:04,783 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2024-11-24 00:24:04,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-24 00:24:04,784 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-24 00:24:04,785 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2024-11-24 00:24:04,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-11-24 00:24:04,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:24:04,785 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] [2024-11-24 00:24:04,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 00:24:04,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:04,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:24:04,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:24:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash -571574532, now seen corresponding path program 1 times [2024-11-24 00:24:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:24:04,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1915594791] [2024-11-24 00:24:04,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:24:04,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:04,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:24:04,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:24:04,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 00:24:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:24:05,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 00:24:05,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:24:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:24:05,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:24:05,181 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:24:05,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915594791] [2024-11-24 00:24:05,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915594791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:24:05,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:24:05,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:24:05,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084947553] [2024-11-24 00:24:05,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:24:05,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:24:05,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:24:05,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:24:05,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:24:05,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-24 00:24:05,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-11-24 00:24:05,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:24:05,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-24 00:24:05,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:24:05,642 INFO L124 PetriNetUnfolderBase]: 809/1436 cut-off events. [2024-11-24 00:24:05,642 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2024-11-24 00:24:05,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1436 events. 809/1436 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8040 event pairs, 73 based on Foata normal form. 68/1478 useless extension candidates. Maximal degree in co-relation 3234. Up to 521 conditions per place. [2024-11-24 00:24:05,656 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 49 selfloop transitions, 8 changer transitions 1/71 dead transitions. [2024-11-24 00:24:05,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 314 flow [2024-11-24 00:24:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:24:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-24 00:24:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-24 00:24:05,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-11-24 00:24:05,661 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 145 transitions. [2024-11-24 00:24:05,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 314 flow [2024-11-24 00:24:05,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-24 00:24:05,665 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2024-11-24 00:24:05,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-24 00:24:05,666 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-24 00:24:05,666 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2024-11-24 00:24:05,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-11-24 00:24:05,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:24:05,667 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, 1, 1] [2024-11-24 00:24:05,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-24 00:24:05,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:05,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:24:05,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:24:05,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1468163773, now seen corresponding path program 1 times [2024-11-24 00:24:05,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:24:05,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001369146] [2024-11-24 00:24:05,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:24:05,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:05,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:24:05,871 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:24:05,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 00:24:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:24:05,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 00:24:05,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:24:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:24:06,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:24:06,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:24:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001369146] [2024-11-24 00:24:06,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001369146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:24:06,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:24:06,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:24:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769572357] [2024-11-24 00:24:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:24:06,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:24:06,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:24:06,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:24:06,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:24:06,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-24 00:24:06,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-11-24 00:24:06,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:24:06,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-24 00:24:06,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:24:06,407 INFO L124 PetriNetUnfolderBase]: 477/820 cut-off events. [2024-11-24 00:24:06,408 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2024-11-24 00:24:06,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2133 conditions, 820 events. 477/820 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3781 event pairs, 59 based on Foata normal form. 36/832 useless extension candidates. Maximal degree in co-relation 2122. Up to 268 conditions per place. [2024-11-24 00:24:06,412 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 43 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-11-24 00:24:06,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 325 flow [2024-11-24 00:24:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:24:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:24:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-11-24 00:24:06,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-11-24 00:24:06,414 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 159 transitions. [2024-11-24 00:24:06,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 325 flow [2024-11-24 00:24:06,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-24 00:24:06,419 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2024-11-24 00:24:06,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2024-11-24 00:24:06,420 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2024-11-24 00:24:06,420 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2024-11-24 00:24:06,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-11-24 00:24:06,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:24:06,421 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:24:06,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-24 00:24:06,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:06,624 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:24:06,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:24:06,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1919173412, now seen corresponding path program 1 times [2024-11-24 00:24:06,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:24:06,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [973084203] [2024-11-24 00:24:06,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:24:06,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:06,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:24:06,628 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:24:06,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-24 00:24:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:24:06,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-24 00:24:06,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:24:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:24:06,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:24:06,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:24:06,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973084203] [2024-11-24 00:24:06,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973084203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:24:06,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:24:06,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:24:06,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626405748] [2024-11-24 00:24:06,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:24:06,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:24:06,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:24:06,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:24:06,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:24:06,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-24 00:24:06,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-11-24 00:24:06,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:24:06,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-24 00:24:06,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:24:07,225 INFO L124 PetriNetUnfolderBase]: 617/1166 cut-off events. [2024-11-24 00:24:07,226 INFO L125 PetriNetUnfolderBase]: For 412/436 co-relation queries the response was YES. [2024-11-24 00:24:07,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 1166 events. 617/1166 cut-off events. For 412/436 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6300 event pairs, 279 based on Foata normal form. 8/1111 useless extension candidates. Maximal degree in co-relation 2601. Up to 549 conditions per place. [2024-11-24 00:24:07,232 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 26 selfloop transitions, 2 changer transitions 17/64 dead transitions. [2024-11-24 00:24:07,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 313 flow [2024-11-24 00:24:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:24:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:24:07,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-11-24 00:24:07,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5481481481481482 [2024-11-24 00:24:07,233 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 6 states and 148 transitions. [2024-11-24 00:24:07,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 313 flow [2024-11-24 00:24:07,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 64 transitions, 246 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-24 00:24:07,239 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 123 flow [2024-11-24 00:24:07,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2024-11-24 00:24:07,240 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-24 00:24:07,240 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 123 flow [2024-11-24 00:24:07,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-11-24 00:24:07,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:24:07,241 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:24:07,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-24 00:24:07,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:07,441 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:24:07,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:24:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1001789462, now seen corresponding path program 2 times [2024-11-24 00:24:07,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:24:07,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837395563] [2024-11-24 00:24:07,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:24:07,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:07,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:24:07,444 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:24:07,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-24 00:24:07,546 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:24:07,546 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:24:07,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-24 00:24:07,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:24:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:24:08,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:24:08,064 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:24:08,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837395563] [2024-11-24 00:24:08,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837395563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:24:08,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:24:08,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 00:24:08,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701444402] [2024-11-24 00:24:08,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:24:08,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:24:08,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:24:08,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:24:08,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:24:08,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-11-24 00:24:08,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 123 flow. Second operand has 10 states, 10 states have (on average 20.7) internal successors, (207), 10 states have internal predecessors, (207), 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-11-24 00:24:08,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:24:08,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-11-24 00:24:08,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:24:08,642 INFO L124 PetriNetUnfolderBase]: 367/714 cut-off events. [2024-11-24 00:24:08,642 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-11-24 00:24:08,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 714 events. 367/714 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3316 event pairs, 91 based on Foata normal form. 8/678 useless extension candidates. Maximal degree in co-relation 1439. Up to 177 conditions per place. [2024-11-24 00:24:08,648 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 28 selfloop transitions, 4 changer transitions 25/78 dead transitions. [2024-11-24 00:24:08,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 322 flow [2024-11-24 00:24:08,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:24:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-24 00:24:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 248 transitions. [2024-11-24 00:24:08,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5511111111111111 [2024-11-24 00:24:08,652 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 123 flow. Second operand 10 states and 248 transitions. [2024-11-24 00:24:08,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 322 flow [2024-11-24 00:24:08,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 304 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-24 00:24:08,655 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 131 flow [2024-11-24 00:24:08,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=131, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2024-11-24 00:24:08,656 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2024-11-24 00:24:08,656 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 131 flow [2024-11-24 00:24:08,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.7) internal successors, (207), 10 states have internal predecessors, (207), 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-11-24 00:24:08,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:24:08,656 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:24:08,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-24 00:24:08,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:08,860 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:24:08,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:24:08,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1245699218, now seen corresponding path program 3 times [2024-11-24 00:24:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:24:08,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [425709832] [2024-11-24 00:24:08,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 00:24:08,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:08,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:24:08,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:24:08,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-24 00:24:08,959 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-24 00:24:08,960 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:24:08,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-24 00:24:08,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:24:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:24:09,160 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:24:09,160 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:24:09,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425709832] [2024-11-24 00:24:09,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425709832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:24:09,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:24:09,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 00:24:09,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740104811] [2024-11-24 00:24:09,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:24:09,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 00:24:09,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:24:09,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 00:24:09,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:24:09,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2024-11-24 00:24:09,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 131 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 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-11-24 00:24:09,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:24:09,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2024-11-24 00:24:09,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:24:09,602 INFO L124 PetriNetUnfolderBase]: 687/1204 cut-off events. [2024-11-24 00:24:09,602 INFO L125 PetriNetUnfolderBase]: For 396/399 co-relation queries the response was YES. [2024-11-24 00:24:09,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2815 conditions, 1204 events. 687/1204 cut-off events. For 396/399 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5396 event pairs, 269 based on Foata normal form. 8/1188 useless extension candidates. Maximal degree in co-relation 2802. Up to 526 conditions per place. [2024-11-24 00:24:09,609 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 32 selfloop transitions, 3 changer transitions 40/85 dead transitions. [2024-11-24 00:24:09,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 419 flow [2024-11-24 00:24:09,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 00:24:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-24 00:24:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-11-24 00:24:09,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-11-24 00:24:09,611 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 131 flow. Second operand 7 states and 165 transitions. [2024-11-24 00:24:09,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 419 flow [2024-11-24 00:24:09,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 85 transitions, 389 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-11-24 00:24:09,615 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 141 flow [2024-11-24 00:24:09,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=141, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2024-11-24 00:24:09,616 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2024-11-24 00:24:09,616 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 141 flow [2024-11-24 00:24:09,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 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-11-24 00:24:09,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:24:09,616 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:24:09,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-24 00:24:09,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:09,821 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:24:09,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:24:09,821 INFO L85 PathProgramCache]: Analyzing trace with hash -824840458, now seen corresponding path program 4 times [2024-11-24 00:24:09,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:24:09,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112035088] [2024-11-24 00:24:09,822 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-24 00:24:09,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:09,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:24:09,824 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:24:09,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-24 00:24:09,918 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-24 00:24:09,919 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-24 00:24:09,919 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:24:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:24:10,004 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-24 00:24:10,004 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:24:10,005 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-24 00:24:10,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-24 00:24:10,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-24 00:24:10,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-24 00:24:10,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-24 00:24:10,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-24 00:24:10,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-24 00:24:10,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-24 00:24:10,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:24:10,209 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-24 00:24:10,312 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-24 00:24:10,312 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:24:10,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:24:10 BasicIcfg [2024-11-24 00:24:10,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:24:10,320 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:24:10,321 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:24:10,321 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:24:10,322 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:24:02" (3/4) ... [2024-11-24 00:24:10,324 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 00:24:10,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:24:10,327 INFO L158 Benchmark]: Toolchain (without parser) took 10061.30ms. Allocated memory was 83.9MB in the beginning and 234.9MB in the end (delta: 151.0MB). Free memory was 58.9MB in the beginning and 109.6MB in the end (delta: -50.7MB). Peak memory consumption was 100.3MB. Max. memory is 16.1GB. [2024-11-24 00:24:10,328 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 83.9MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:24:10,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.14ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 35.9MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 00:24:10,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.85ms. Allocated memory is still 83.9MB. Free memory was 35.9MB in the beginning and 33.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:24:10,329 INFO L158 Benchmark]: Boogie Preprocessor took 62.76ms. Allocated memory is still 83.9MB. Free memory was 33.5MB in the beginning and 30.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:24:10,329 INFO L158 Benchmark]: RCFGBuilder took 1055.91ms. Allocated memory is still 83.9MB. Free memory was 30.9MB in the beginning and 38.8MB in the end (delta: -8.0MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-24 00:24:10,329 INFO L158 Benchmark]: TraceAbstraction took 8222.74ms. Allocated memory was 83.9MB in the beginning and 234.9MB in the end (delta: 151.0MB). Free memory was 38.3MB in the beginning and 109.6MB in the end (delta: -71.3MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. [2024-11-24 00:24:10,330 INFO L158 Benchmark]: Witness Printer took 6.40ms. Allocated memory is still 234.9MB. Free memory was 109.6MB in the beginning and 109.6MB in the end (delta: 19.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:24:10,331 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.35ms. Allocated memory is still 83.9MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.14ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 35.9MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.85ms. Allocated memory is still 83.9MB. Free memory was 35.9MB in the beginning and 33.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.76ms. Allocated memory is still 83.9MB. Free memory was 33.5MB in the beginning and 30.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1055.91ms. Allocated memory is still 83.9MB. Free memory was 30.9MB in the beginning and 38.8MB in the end (delta: -8.0MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8222.74ms. Allocated memory was 83.9MB in the beginning and 234.9MB in the end (delta: 151.0MB). Free memory was 38.3MB in the beginning and 109.6MB in the end (delta: -71.3MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. * Witness Printer took 6.40ms. Allocated memory is still 234.9MB. Free memory was 109.6MB in the beginning and 109.6MB in the end (delta: 19.1kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L738] 0 int z = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2073; [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073=6, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2074; [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073=6, t2074=7, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2075; [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073=6, t2074=7, t2075=8, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L744] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=6, t2074=7, t2075=8, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=6, t2074=7, t2075=8, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=6, t2074=7, t2075=8, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L851] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L18] 0 __assert_fail ("0", "safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 834]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 7 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: 8.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 127 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 964 IncrementalHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 19 mSDtfsCounter, 964 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=5, InterpolantAutomatonStates: 44, 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, 1.2s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 706 SizeOfPredicates, 22 NumberOfNonLiveVariables, 807 ConjunctsInSsa, 54 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-11-24 00:24:10,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaabd5c-903c-4271-9e6c-2e02d12a22d8/bin/uautomizer-verify-LYvppIcaGC/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample