./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version d790fecc
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-12-02 12:39:18,957 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-12-02 12:39:19,008 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-12-02 12:39:19,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-12-02 12:39:19,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-12-02 12:39:19,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-12-02 12:39:19,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-12-02 12:39:19,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-12-02 12:39:19,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-12-02 12:39:19,032 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-12-02 12:39:19,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-12-02 12:39:19,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-12-02 12:39:19,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-12-02 12:39:19,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-12-02 12:39:19,033 INFO L153 SettingsManager]: * Use SBE=true
[2024-12-02 12:39:19,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-12-02 12:39:19,033 INFO L153 SettingsManager]: * sizeof long=4
[2024-12-02 12:39:19,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-12-02 12:39:19,034 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-12-02 12:39:19,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-12-02 12:39:19,034 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-12-02 12:39:19,034 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-12-02 12:39:19,034 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-12-02 12:39:19,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-12-02 12:39:19,034 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-12-02 12:39:19,034 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-12-02 12:39:19,034 INFO L153 SettingsManager]: * sizeof long double=12
[2024-12-02 12:39:19,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-12-02 12:39:19,034 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-12-02 12:39:19,035 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-12-02 12:39:19,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 12:39:19,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 12:39:19,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 12:39:19,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 12:39:19,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-12-02 12:39:19,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 12:39:19,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 12:39:19,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 12:39:19,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 12:39:19,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-12-02 12:39:19,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-12-02 12:39:19,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-12-02 12:39:19,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-12-02 12:39:19,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-12-02 12:39:19,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-12-02 12:39:19,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-12-02 12:39:19,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-12-02 12:39:19,036 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_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2
[2024-12-02 12:39:19,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-12-02 12:39:19,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-12-02 12:39:19,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-12-02 12:39:19,252 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-12-02 12:39:19,252 INFO L274 PluginConnector]: CDTParser initialized
[2024-12-02 12:39:19,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i
[2024-12-02 12:39:21,888 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/data/d8c71fa8d/8740491bd60b47a39eaa25b0971a7096/FLAGd90b251fc
[2024-12-02 12:39:22,103 INFO L384 CDTParser]: Found 1 translation units.
[2024-12-02 12:39:22,104 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i
[2024-12-02 12:39:22,116 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/data/d8c71fa8d/8740491bd60b47a39eaa25b0971a7096/FLAGd90b251fc
[2024-12-02 12:39:22,445 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/data/d8c71fa8d/8740491bd60b47a39eaa25b0971a7096
[2024-12-02 12:39:22,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-12-02 12:39:22,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-12-02 12:39:22,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-12-02 12:39:22,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-12-02 12:39:22,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-12-02 12:39:22,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f6fc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22, skipping insertion in model container
[2024-12-02 12:39:22,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,482 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-12-02 12:39:22,724 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 12:39:22,731 INFO L200 MainTranslator]: Completed pre-run
[2024-12-02 12:39:22,783 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 12:39:22,810 INFO L204 MainTranslator]: Completed translation
[2024-12-02 12:39:22,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22 WrapperNode
[2024-12-02 12:39:22,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-12-02 12:39:22,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-12-02 12:39:22,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-12-02 12:39:22,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-12-02 12:39:22,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,843 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125
[2024-12-02 12:39:22,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-12-02 12:39:22,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-12-02 12:39:22,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-12-02 12:39:22,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-12-02 12:39:22,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,864 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-12-02 12:39:22,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,870 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-12-02 12:39:22,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-12-02 12:39:22,879 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-12-02 12:39:22,879 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-12-02 12:39:22,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (1/1) ...
[2024-12-02 12:39:22,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 12:39:22,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 12:39:22,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-12-02 12:39:22,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-12-02 12:39:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-12-02 12:39:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-12-02 12:39:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-12-02 12:39:22,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-12-02 12:39:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-12-02 12:39:22,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-12-02 12:39:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-12-02 12:39:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-12-02 12:39:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-12-02 12:39:22,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-12-02 12:39:22,940 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-12-02 12:39:23,059 INFO L234 CfgBuilder]: Building ICFG
[2024-12-02 12:39:23,061 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-12-02 12:39:23,318 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-12-02 12:39:23,318 INFO L283 CfgBuilder]: Performing block encoding
[2024-12-02 12:39:23,487 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-12-02 12:39:23,488 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-12-02 12:39:23,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:39:23 BoogieIcfgContainer
[2024-12-02 12:39:23,488 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-12-02 12:39:23,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-12-02 12:39:23,490 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-12-02 12:39:23,495 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-12-02 12:39:23,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:39:22" (1/3) ...
[2024-12-02 12:39:23,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b31a95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:39:23, skipping insertion in model container
[2024-12-02 12:39:23,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:22" (2/3) ...
[2024-12-02 12:39:23,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b31a95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:39:23, skipping insertion in model container
[2024-12-02 12:39:23,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:39:23" (3/3) ...
[2024-12-02 12:39:23,498 INFO L128 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i
[2024-12-02 12:39:23,513 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-12-02 12:39:23,514 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 3 error locations.
[2024-12-02 12:39:23,514 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-12-02 12:39:23,562 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-12-02 12:39:23,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow
[2024-12-02 12:39:23,622 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events.
[2024-12-02 12:39:23,624 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 12:39:23,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 2/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place.
[2024-12-02 12:39:23,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow
[2024-12-02 12:39:23,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow
[2024-12-02 12:39:23,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-12-02 12:39:23,649 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;@201b2501, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-12-02 12:39:23,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-12-02 12:39:23,653 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-12-02 12:39:23,653 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-12-02 12:39:23,653 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 12:39:23,654 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:23,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-12-02 12:39:23,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:23,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:23,660 INFO L85 PathProgramCache]: Analyzing trace with hash 10512786, now seen corresponding path program 1 times
[2024-12-02 12:39:23,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 12:39:23,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744050899]
[2024-12-02 12:39:23,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:23,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 12:39:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:24,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 12:39:24,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744050899]
[2024-12-02 12:39:24,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744050899] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:24,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:24,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-12-02 12:39:24,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246351939]
[2024-12-02 12:39:24,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:24,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 12:39:24,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 12:39:24,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 12:39:24,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 12:39:24,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35
[2024-12-02 12:39:24,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:24,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:24,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35
[2024-12-02 12:39:24,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:24,248 INFO L124 PetriNetUnfolderBase]: 148/334 cut-off events.
[2024-12-02 12:39:24,248 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-12-02 12:39:24,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 334 events. 148/334 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1649 event pairs, 52 based on Foata normal form. 24/354 useless extension candidates. Maximal degree in co-relation 603. Up to 220 conditions per place.
[2024-12-02 12:39:24,253 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 25 selfloop transitions, 2 changer transitions 2/41 dead transitions.
[2024-12-02 12:39:24,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 149 flow
[2024-12-02 12:39:24,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 12:39:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 12:39:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions.
[2024-12-02 12:39:24,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238
[2024-12-02 12:39:24,265 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 76 transitions.
[2024-12-02 12:39:24,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 149 flow
[2024-12-02 12:39:24,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 12:39:24,270 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow
[2024-12-02 12:39:24,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28}
[2024-12-02 12:39:24,274 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places.
[2024-12-02 12:39:24,275 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow
[2024-12-02 12:39:24,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:24,275 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:24,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:24,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-12-02 12:39:24,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:24,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:24,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1003970263, now seen corresponding path program 1 times
[2024-12-02 12:39:24,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 12:39:24,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943224761]
[2024-12-02 12:39:24,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:24,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 12:39:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:24,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 12:39:24,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943224761]
[2024-12-02 12:39:24,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943224761] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:24,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:24,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-12-02 12:39:24,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92728596]
[2024-12-02 12:39:24,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:24,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 12:39:24,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 12:39:24,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 12:39:24,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 12:39:24,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35
[2024-12-02 12:39:24,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:24,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:24,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35
[2024-12-02 12:39:24,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:24,462 INFO L124 PetriNetUnfolderBase]: 131/303 cut-off events.
[2024-12-02 12:39:24,462 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES.
[2024-12-02 12:39:24,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 303 events. 131/303 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1571 event pairs, 131 based on Foata normal form. 12/304 useless extension candidates. Maximal degree in co-relation 569. Up to 236 conditions per place.
[2024-12-02 12:39:24,465 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 14 selfloop transitions, 1 changer transitions 1/27 dead transitions.
[2024-12-02 12:39:24,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 94 flow
[2024-12-02 12:39:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 12:39:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 12:39:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions.
[2024-12-02 12:39:24,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333
[2024-12-02 12:39:24,467 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 56 transitions.
[2024-12-02 12:39:24,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 94 flow
[2024-12-02 12:39:24,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 12:39:24,468 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow
[2024-12-02 12:39:24,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26}
[2024-12-02 12:39:24,468 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places.
[2024-12-02 12:39:24,469 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow
[2024-12-02 12:39:24,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:24,469 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:24,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:24,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-12-02 12:39:24,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:24,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1003968983, now seen corresponding path program 1 times
[2024-12-02 12:39:24,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 12:39:24,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461323154]
[2024-12-02 12:39:24,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:24,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 12:39:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:24,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 12:39:24,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461323154]
[2024-12-02 12:39:24,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461323154] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:24,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:24,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-02 12:39:24,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344194035]
[2024-12-02 12:39:24,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:24,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 12:39:24,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 12:39:24,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 12:39:24,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-12-02 12:39:24,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35
[2024-12-02 12:39:24,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:24,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:24,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35
[2024-12-02 12:39:24,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:25,105 INFO L124 PetriNetUnfolderBase]: 296/630 cut-off events.
[2024-12-02 12:39:25,105 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 12:39:25,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 630 events. 296/630 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3508 event pairs, 110 based on Foata normal form. 0/611 useless extension candidates. Maximal degree in co-relation 1159. Up to 322 conditions per place.
[2024-12-02 12:39:25,109 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 22 selfloop transitions, 3 changer transitions 33/66 dead transitions.
[2024-12-02 12:39:25,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 66 transitions, 256 flow
[2024-12-02 12:39:25,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-12-02 12:39:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-12-02 12:39:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-12-02 12:39:25,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286
[2024-12-02 12:39:25,111 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 8 states and 148 transitions.
[2024-12-02 12:39:25,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 66 transitions, 256 flow
[2024-12-02 12:39:25,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-12-02 12:39:25,113 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 90 flow
[2024-12-02 12:39:25,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=27}
[2024-12-02 12:39:25,114 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places.
[2024-12-02 12:39:25,114 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 90 flow
[2024-12-02 12:39:25,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:25,114 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:25,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:25,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-12-02 12:39:25,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:25,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1493365624, now seen corresponding path program 1 times
[2024-12-02 12:39:25,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 12:39:25,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147334680]
[2024-12-02 12:39:25,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:25,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 12:39:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:25,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 12:39:25,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147334680]
[2024-12-02 12:39:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147334680] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:25,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:25,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-12-02 12:39:25,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437409842]
[2024-12-02 12:39:25,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:25,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-12-02 12:39:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 12:39:25,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-12-02 12:39:25,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-12-02 12:39:25,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35
[2024-12-02 12:39:25,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 90 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:25,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:25,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35
[2024-12-02 12:39:25,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:25,904 INFO L124 PetriNetUnfolderBase]: 363/709 cut-off events.
[2024-12-02 12:39:25,904 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES.
[2024-12-02 12:39:25,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 709 events. 363/709 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3466 event pairs, 172 based on Foata normal form. 30/730 useless extension candidates. Maximal degree in co-relation 1672. Up to 448 conditions per place.
[2024-12-02 12:39:25,908 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 27 selfloop transitions, 4 changer transitions 31/71 dead transitions.
[2024-12-02 12:39:25,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 71 transitions, 320 flow
[2024-12-02 12:39:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-12-02 12:39:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-12-02 12:39:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions.
[2024-12-02 12:39:25,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714
[2024-12-02 12:39:25,910 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 90 flow. Second operand 10 states and 165 transitions.
[2024-12-02 12:39:25,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 71 transitions, 320 flow
[2024-12-02 12:39:25,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 307 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-12-02 12:39:25,915 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 122 flow
[2024-12-02 12:39:25,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=122, PETRI_PLACES=52, PETRI_TRANSITIONS=29}
[2024-12-02 12:39:25,915 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places.
[2024-12-02 12:39:25,915 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 122 flow
[2024-12-02 12:39:25,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:25,916 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:25,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:25,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-12-02 12:39:25,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:25,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:25,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1356320913, now seen corresponding path program 1 times
[2024-12-02 12:39:25,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 12:39:25,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916113445]
[2024-12-02 12:39:25,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:25,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 12:39:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:26,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 12:39:26,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916113445]
[2024-12-02 12:39:26,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916113445] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:26,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:26,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-12-02 12:39:26,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126203841]
[2024-12-02 12:39:26,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:26,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 12:39:26,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 12:39:26,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 12:39:26,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-12-02 12:39:26,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35
[2024-12-02 12:39:26,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 29 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:26,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:26,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35
[2024-12-02 12:39:26,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:26,336 INFO L124 PetriNetUnfolderBase]: 337/718 cut-off events.
[2024-12-02 12:39:26,336 INFO L125 PetriNetUnfolderBase]: For 1336/1340 co-relation queries the response was YES.
[2024-12-02 12:39:26,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 718 events. 337/718 cut-off events. For 1336/1340 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4244 event pairs, 98 based on Foata normal form. 28/727 useless extension candidates. Maximal degree in co-relation 2046. Up to 264 conditions per place.
[2024-12-02 12:39:26,339 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 28 selfloop transitions, 3 changer transitions 21/61 dead transitions.
[2024-12-02 12:39:26,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 342 flow
[2024-12-02 12:39:26,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-12-02 12:39:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-12-02 12:39:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-12-02 12:39:26,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979
[2024-12-02 12:39:26,341 INFO L175 Difference]: Start difference. First operand has 52 places, 29 transitions, 122 flow. Second operand 7 states and 129 transitions.
[2024-12-02 12:39:26,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 342 flow
[2024-12-02 12:39:26,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 309 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-12-02 12:39:26,347 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 128 flow
[2024-12-02 12:39:26,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=52, PETRI_TRANSITIONS=29}
[2024-12-02 12:39:26,348 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places.
[2024-12-02 12:39:26,348 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 128 flow
[2024-12-02 12:39:26,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:26,349 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:26,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:26,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-12-02 12:39:26,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:26,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2059488794, now seen corresponding path program 1 times
[2024-12-02 12:39:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 12:39:26,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998568744]
[2024-12-02 12:39:26,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:26,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 12:39:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:26,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 12:39:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998568744]
[2024-12-02 12:39:26,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998568744] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:26,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:26,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-12-02 12:39:26,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328382590]
[2024-12-02 12:39:26,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:26,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-12-02 12:39:26,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 12:39:26,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-12-02 12:39:26,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-12-02 12:39:26,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35
[2024-12-02 12:39:26,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 29 transitions, 128 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:26,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:26,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35
[2024-12-02 12:39:26,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:27,155 INFO L124 PetriNetUnfolderBase]: 279/644 cut-off events.
[2024-12-02 12:39:27,155 INFO L125 PetriNetUnfolderBase]: For 1352/1359 co-relation queries the response was YES.
[2024-12-02 12:39:27,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 644 events. 279/644 cut-off events. For 1352/1359 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3746 event pairs, 117 based on Foata normal form. 30/669 useless extension candidates. Maximal degree in co-relation 1763. Up to 389 conditions per place.
[2024-12-02 12:39:27,159 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 25 selfloop transitions, 5 changer transitions 17/58 dead transitions.
[2024-12-02 12:39:27,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 338 flow
[2024-12-02 12:39:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-12-02 12:39:27,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-12-02 12:39:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-12-02 12:39:27,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429
[2024-12-02 12:39:27,160 INFO L175 Difference]: Start difference. First operand has 52 places, 29 transitions, 128 flow. Second operand 8 states and 145 transitions.
[2024-12-02 12:39:27,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 338 flow
[2024-12-02 12:39:27,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 315 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-12-02 12:39:27,165 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 158 flow
[2024-12-02 12:39:27,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=31}
[2024-12-02 12:39:27,166 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places.
[2024-12-02 12:39:27,166 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 158 flow
[2024-12-02 12:39:27,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:27,166 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:27,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:27,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-12-02 12:39:27,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:27,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1309929288, now seen corresponding path program 1 times
[2024-12-02 12:39:27,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 12:39:27,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364258379]
[2024-12-02 12:39:27,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:27,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 12:39:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:27,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 12:39:27,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364258379]
[2024-12-02 12:39:27,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364258379] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:27,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:27,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-12-02 12:39:27,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249717133]
[2024-12-02 12:39:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:27,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-12-02 12:39:27,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 12:39:27,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-12-02 12:39:27,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-12-02 12:39:27,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35
[2024-12-02 12:39:27,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 31 transitions, 158 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:27,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:27,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35
[2024-12-02 12:39:27,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:28,484 INFO L124 PetriNetUnfolderBase]: 365/768 cut-off events.
[2024-12-02 12:39:28,484 INFO L125 PetriNetUnfolderBase]: For 1911/1911 co-relation queries the response was YES.
[2024-12-02 12:39:28,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2464 conditions, 768 events. 365/768 cut-off events. For 1911/1911 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4355 event pairs, 69 based on Foata normal form. 27/793 useless extension candidates. Maximal degree in co-relation 2442. Up to 362 conditions per place.
[2024-12-02 12:39:28,489 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 33 selfloop transitions, 14 changer transitions 27/81 dead transitions.
[2024-12-02 12:39:28,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 81 transitions, 543 flow
[2024-12-02 12:39:28,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-12-02 12:39:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-12-02 12:39:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions.
[2024-12-02 12:39:28,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857
[2024-12-02 12:39:28,490 INFO L175 Difference]: Start difference. First operand has 55 places, 31 transitions, 158 flow. Second operand 10 states and 170 transitions.
[2024-12-02 12:39:28,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 81 transitions, 543 flow
[2024-12-02 12:39:28,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 509 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-12-02 12:39:28,496 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 233 flow
[2024-12-02 12:39:28,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=233, PETRI_PLACES=61, PETRI_TRANSITIONS=37}
[2024-12-02 12:39:28,497 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places.
[2024-12-02 12:39:28,497 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 233 flow
[2024-12-02 12:39:28,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:28,497 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:28,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:28,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-12-02 12:39:28,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:28,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:28,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1806894223, now seen corresponding path program 1 times
[2024-12-02 12:39:28,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 12:39:28,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406791228]
[2024-12-02 12:39:28,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:28,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 12:39:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:28,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 12:39:28,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406791228]
[2024-12-02 12:39:28,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406791228] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:28,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:28,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-12-02 12:39:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003642993]
[2024-12-02 12:39:28,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:28,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-12-02 12:39:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 12:39:28,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-12-02 12:39:28,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-12-02 12:39:28,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35
[2024-12-02 12:39:28,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 37 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:28,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:28,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35
[2024-12-02 12:39:28,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:28,857 INFO L124 PetriNetUnfolderBase]: 365/753 cut-off events.
[2024-12-02 12:39:28,857 INFO L125 PetriNetUnfolderBase]: For 2392/2459 co-relation queries the response was YES.
[2024-12-02 12:39:28,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2483 conditions, 753 events. 365/753 cut-off events. For 2392/2459 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3944 event pairs, 58 based on Foata normal form. 90/817 useless extension candidates. Maximal degree in co-relation 2458. Up to 384 conditions per place.
[2024-12-02 12:39:28,861 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 36 selfloop transitions, 4 changer transitions 4/57 dead transitions.
[2024-12-02 12:39:28,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 433 flow
[2024-12-02 12:39:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-12-02 12:39:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-12-02 12:39:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions.
[2024-12-02 12:39:28,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714
[2024-12-02 12:39:28,863 INFO L175 Difference]: Start difference. First operand has 61 places, 37 transitions, 233 flow. Second operand 4 states and 80 transitions.
[2024-12-02 12:39:28,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 433 flow
[2024-12-02 12:39:28,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 420 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-12-02 12:39:28,868 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 246 flow
[2024-12-02 12:39:28,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=57, PETRI_TRANSITIONS=39}
[2024-12-02 12:39:28,869 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places.
[2024-12-02 12:39:28,869 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 246 flow
[2024-12-02 12:39:28,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:28,869 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:28,869 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-12-02 12:39:28,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-12-02 12:39:28,870 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:28,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1265980497, now seen corresponding path program 1 times
[2024-12-02 12:39:28,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 12:39:28,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784115656]
[2024-12-02 12:39:28,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:28,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 12:39:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:29,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 12:39:29,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784115656]
[2024-12-02 12:39:29,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784115656] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:29,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:29,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-02 12:39:29,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316933173]
[2024-12-02 12:39:29,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:29,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 12:39:29,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 12:39:29,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 12:39:29,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-12-02 12:39:29,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35
[2024-12-02 12:39:29,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:29,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:29,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35
[2024-12-02 12:39:29,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:29,169 INFO L124 PetriNetUnfolderBase]: 173/365 cut-off events.
[2024-12-02 12:39:29,169 INFO L125 PetriNetUnfolderBase]: For 840/860 co-relation queries the response was YES.
[2024-12-02 12:39:29,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 365 events. 173/365 cut-off events. For 840/860 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1523 event pairs, 26 based on Foata normal form. 49/399 useless extension candidates. Maximal degree in co-relation 1209. Up to 152 conditions per place.
[2024-12-02 12:39:29,171 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 29 selfloop transitions, 6 changer transitions 9/53 dead transitions.
[2024-12-02 12:39:29,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 394 flow
[2024-12-02 12:39:29,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-12-02 12:39:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-12-02 12:39:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions.
[2024-12-02 12:39:29,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5085714285714286
[2024-12-02 12:39:29,172 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 246 flow. Second operand 5 states and 89 transitions.
[2024-12-02 12:39:29,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 394 flow
[2024-12-02 12:39:29,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 320 flow, removed 32 selfloop flow, removed 9 redundant places.
[2024-12-02 12:39:29,176 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 171 flow
[2024-12-02 12:39:29,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=54, PETRI_TRANSITIONS=33}
[2024-12-02 12:39:29,177 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places.
[2024-12-02 12:39:29,177 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 171 flow
[2024-12-02 12:39:29,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:29,177 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:29,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:29,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-12-02 12:39:29,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:29,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash -280801110, now seen corresponding path program 1 times
[2024-12-02 12:39:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 12:39:29,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990481263]
[2024-12-02 12:39:29,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:29,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 12:39:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:30,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 12:39:30,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990481263]
[2024-12-02 12:39:30,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990481263] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:30,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:30,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-12-02 12:39:30,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545493134]
[2024-12-02 12:39:30,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:30,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-12-02 12:39:30,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 12:39:30,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-12-02 12:39:30,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-12-02 12:39:30,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35
[2024-12-02 12:39:30,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 171 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 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-12-02 12:39:30,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:30,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35
[2024-12-02 12:39:30,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:30,668 INFO L124 PetriNetUnfolderBase]: 83/213 cut-off events.
[2024-12-02 12:39:30,669 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES.
[2024-12-02 12:39:30,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 213 events. 83/213 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 755 event pairs, 41 based on Foata normal form. 4/208 useless extension candidates. Maximal degree in co-relation 590. Up to 91 conditions per place.
[2024-12-02 12:39:30,669 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 18 selfloop transitions, 4 changer transitions 16/49 dead transitions.
[2024-12-02 12:39:30,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 290 flow
[2024-12-02 12:39:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-12-02 12:39:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-12-02 12:39:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-12-02 12:39:30,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857
[2024-12-02 12:39:30,671 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 171 flow. Second operand 7 states and 119 transitions.
[2024-12-02 12:39:30,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 290 flow
[2024-12-02 12:39:30,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 230 flow, removed 11 selfloop flow, removed 13 redundant places.
[2024-12-02 12:39:30,673 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 111 flow
[2024-12-02 12:39:30,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=29}
[2024-12-02 12:39:30,673 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places.
[2024-12-02 12:39:30,674 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 111 flow
[2024-12-02 12:39:30,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 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-12-02 12:39:30,674 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:30,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:30,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-12-02 12:39:30,674 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:30,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:30,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1997730380, now seen corresponding path program 2 times
[2024-12-02 12:39:30,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 12:39:30,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027804558]
[2024-12-02 12:39:30,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-12-02 12:39:30,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 12:39:30,715 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-12-02 12:39:30,715 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-12-02 12:39:30,715 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-12-02 12:39:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-12-02 12:39:30,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-12-02 12:39:30,773 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-12-02 12:39:30,774 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining)
[2024-12-02 12:39:30,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining)
[2024-12-02 12:39:30,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining)
[2024-12-02 12:39:30,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2024-12-02 12:39:30,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2024-12-02 12:39:30,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining)
[2024-12-02 12:39:30,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-12-02 12:39:30,776 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:30,818 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-12-02 12:39:30,819 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-12-02 12:39:30,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:39:30 BasicIcfg
[2024-12-02 12:39:30,823 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-12-02 12:39:30,824 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-12-02 12:39:30,824 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-12-02 12:39:30,824 INFO L274 PluginConnector]: Witness Printer initialized
[2024-12-02 12:39:30,824 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:39:23" (3/4) ...
[2024-12-02 12:39:30,826 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-12-02 12:39:30,826 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-12-02 12:39:30,827 INFO L158 Benchmark]: Toolchain (without parser) took 8378.71ms. Allocated memory was 117.4MB in the beginning and 302.0MB in the end (delta: 184.5MB). Free memory was 91.1MB in the beginning and 209.4MB in the end (delta: -118.4MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB.
[2024-12-02 12:39:30,827 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 12:39:30,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.30ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 68.7MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-12-02 12:39:30,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.31ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 66.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 12:39:30,828 INFO L158 Benchmark]: Boogie Preprocessor took 34.94ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 63.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 12:39:30,828 INFO L158 Benchmark]: RCFGBuilder took 609.25ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 72.1MB in the end (delta: -8.8MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB.
[2024-12-02 12:39:30,828 INFO L158 Benchmark]: TraceAbstraction took 7332.91ms. Allocated memory was 117.4MB in the beginning and 302.0MB in the end (delta: 184.5MB). Free memory was 71.5MB in the beginning and 209.5MB in the end (delta: -137.9MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB.
[2024-12-02 12:39:30,829 INFO L158 Benchmark]: Witness Printer took 2.42ms. Allocated memory is still 302.0MB. Free memory was 209.5MB in the beginning and 209.4MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 12:39:30,830 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.24ms. Allocated memory is still 117.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 362.30ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 68.7MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 31.31ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 66.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 34.94ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 63.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 609.25ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 72.1MB in the end (delta: -8.8MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 7332.91ms. Allocated memory was 117.4MB in the beginning and 302.0MB in the end (delta: 184.5MB). Free memory was 71.5MB in the beginning and 209.5MB in the end (delta: -137.9MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB.
* Witness Printer took 2.42ms. Allocated memory is still 302.0MB. Free memory was 209.5MB in the beginning and 209.4MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 17.
Possible FailurePath:
[L708] 0 int __unbuffered_cnt = 0;
[L709] 0 _Bool main$tmp_guard0;
[L710] 0 _Bool main$tmp_guard1;
[L712] 0 int x = 0;
[L714] 0 int y = 0;
[L715] 0 _Bool y$flush_delayed;
[L716] 0 int y$mem_tmp;
[L717] 0 _Bool y$r_buff0_thd0;
[L718] 0 _Bool y$r_buff0_thd1;
[L719] 0 _Bool y$r_buff0_thd2;
[L720] 0 _Bool y$r_buff1_thd0;
[L721] 0 _Bool y$r_buff1_thd1;
[L722] 0 _Bool y$r_buff1_thd2;
[L723] 0 _Bool y$read_delayed;
[L724] 0 int *y$read_delayed_var;
[L725] 0 int y$w_buff0;
[L726] 0 _Bool y$w_buff0_used;
[L727] 0 int y$w_buff1;
[L728] 0 _Bool y$w_buff1_used;
[L729] 0 _Bool weak$$choice0;
[L730] 0 _Bool weak$$choice2;
[L790] 0 pthread_t t2473;
[L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L792] 0 pthread_t t2474;
[L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L734] 1 y$w_buff1 = y$w_buff0
[L735] 1 y$w_buff0 = 2
[L736] 1 y$w_buff1_used = y$w_buff0_used
[L737] 1 y$w_buff0_used = (_Bool)1
[L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0
[L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1
[L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2
[L742] 1 y$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L745] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L762] 2 x = 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L765] 2 y = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L797] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L797] RET 0 assume_abort_if_not(main$tmp_guard0)
[L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L806] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L807] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L808] 0 y$flush_delayed = weak$$choice2
[L809] 0 y$mem_tmp = y
[L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L817] 0 main$tmp_guard1 = !(x == 2 && y == 2)
[L818] 0 y = y$flush_delayed ? y$mem_tmp : y
[L819] 0 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L821] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L17] 0 __assert_fail ("0", "safe029_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 788]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 793]: 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: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 5 procedures, 51 locations, 6 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: 7.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 320 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 887 IncrementalHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 32 mSDtfsCounter, 887 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=8, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 1067 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-12-02 12:39:30,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-12-02 12:39:32,787 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-12-02 12:39:32,868 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-12-02 12:39:32,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-12-02 12:39:32,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-12-02 12:39:32,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-12-02 12:39:32,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-12-02 12:39:32,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-12-02 12:39:32,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-12-02 12:39:32,901 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-12-02 12:39:32,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-12-02 12:39:32,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-12-02 12:39:32,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-12-02 12:39:32,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-12-02 12:39:32,902 INFO L153 SettingsManager]: * Use SBE=true
[2024-12-02 12:39:32,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-12-02 12:39:32,902 INFO L153 SettingsManager]: * sizeof long=4
[2024-12-02 12:39:32,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-12-02 12:39:32,903 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-12-02 12:39:32,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-12-02 12:39:32,903 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-12-02 12:39:32,903 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-12-02 12:39:32,903 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-12-02 12:39:32,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-12-02 12:39:32,903 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-12-02 12:39:32,903 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-12-02 12:39:32,903 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-12-02 12:39:32,903 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-12-02 12:39:32,903 INFO L153 SettingsManager]: * sizeof long double=12
[2024-12-02 12:39:32,903 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-12-02 12:39:32,903 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-12-02 12:39:32,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-12-02 12:39:32,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 12:39:32,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 12:39:32,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 12:39:32,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 12:39:32,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-12-02 12:39:32,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 12:39:32,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 12:39:32,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 12:39:32,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 12:39:32,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-12-02 12:39:32,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-12-02 12:39:32,905 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-12-02 12:39:32,905 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-12-02 12:39:32,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-12-02 12:39:32,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-12-02 12:39:32,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-12-02 12:39:32,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-12-02 12:39:32,905 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_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2
[2024-12-02 12:39:33,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-12-02 12:39:33,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-12-02 12:39:33,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-12-02 12:39:33,165 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-12-02 12:39:33,166 INFO L274 PluginConnector]: CDTParser initialized
[2024-12-02 12:39:33,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i
[2024-12-02 12:39:35,845 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/data/24fcac674/65d6f3af67684d61bef713d46da2acee/FLAG5f5cad02a
[2024-12-02 12:39:36,058 INFO L384 CDTParser]: Found 1 translation units.
[2024-12-02 12:39:36,059 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i
[2024-12-02 12:39:36,072 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/data/24fcac674/65d6f3af67684d61bef713d46da2acee/FLAG5f5cad02a
[2024-12-02 12:39:36,389 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/data/24fcac674/65d6f3af67684d61bef713d46da2acee
[2024-12-02 12:39:36,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-12-02 12:39:36,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-12-02 12:39:36,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-12-02 12:39:36,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-12-02 12:39:36,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-12-02 12:39:36,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db25d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36, skipping insertion in model container
[2024-12-02 12:39:36,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,423 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-12-02 12:39:36,663 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 12:39:36,675 INFO L200 MainTranslator]: Completed pre-run
[2024-12-02 12:39:36,726 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 12:39:36,754 INFO L204 MainTranslator]: Completed translation
[2024-12-02 12:39:36,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36 WrapperNode
[2024-12-02 12:39:36,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-12-02 12:39:36,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-12-02 12:39:36,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-12-02 12:39:36,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-12-02 12:39:36,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,791 INFO L138 Inliner]: procedures = 175, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126
[2024-12-02 12:39:36,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-12-02 12:39:36,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-12-02 12:39:36,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-12-02 12:39:36,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-12-02 12:39:36,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,818 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-12-02 12:39:36,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,826 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-12-02 12:39:36,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-12-02 12:39:36,836 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-12-02 12:39:36,836 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-12-02 12:39:36,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (1/1) ...
[2024-12-02 12:39:36,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 12:39:36,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 12:39:36,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-12-02 12:39:36,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-12-02 12:39:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-12-02 12:39:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-12-02 12:39:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-12-02 12:39:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-12-02 12:39:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-12-02 12:39:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-12-02 12:39:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-12-02 12:39:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-12-02 12:39:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-12-02 12:39:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-12-02 12:39:36,903 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-12-02 12:39:37,015 INFO L234 CfgBuilder]: Building ICFG
[2024-12-02 12:39:37,017 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-12-02 12:39:37,264 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-12-02 12:39:37,264 INFO L283 CfgBuilder]: Performing block encoding
[2024-12-02 12:39:37,455 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-12-02 12:39:37,455 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-12-02 12:39:37,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:39:37 BoogieIcfgContainer
[2024-12-02 12:39:37,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-12-02 12:39:37,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-12-02 12:39:37,458 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-12-02 12:39:37,463 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-12-02 12:39:37,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:39:36" (1/3) ...
[2024-12-02 12:39:37,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668575ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:39:37, skipping insertion in model container
[2024-12-02 12:39:37,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:36" (2/3) ...
[2024-12-02 12:39:37,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668575ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:39:37, skipping insertion in model container
[2024-12-02 12:39:37,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:39:37" (3/3) ...
[2024-12-02 12:39:37,465 INFO L128 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i
[2024-12-02 12:39:37,477 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-12-02 12:39:37,479 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 3 error locations.
[2024-12-02 12:39:37,479 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-12-02 12:39:37,529 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-12-02 12:39:37,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow
[2024-12-02 12:39:37,590 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events.
[2024-12-02 12:39:37,592 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 12:39:37,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 2/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place.
[2024-12-02 12:39:37,595 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow
[2024-12-02 12:39:37,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow
[2024-12-02 12:39:37,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-12-02 12:39:37,616 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;@1009eca2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-12-02 12:39:37,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-12-02 12:39:37,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-12-02 12:39:37,621 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-12-02 12:39:37,621 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 12:39:37,621 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:37,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-12-02 12:39:37,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:37,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:37,627 INFO L85 PathProgramCache]: Analyzing trace with hash 10576276, now seen corresponding path program 1 times
[2024-12-02 12:39:37,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 12:39:37,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [915227484]
[2024-12-02 12:39:37,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:37,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:37,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 12:39:37,641 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 12:39:37,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-12-02 12:39:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:37,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-12-02 12:39:37,751 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-02 12:39:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:37,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-12-02 12:39:37,782 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-12-02 12:39:37,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915227484]
[2024-12-02 12:39:37,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915227484] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:37,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:37,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-12-02 12:39:37,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237434274]
[2024-12-02 12:39:37,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:37,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 12:39:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-12-02 12:39:37,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 12:39:37,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 12:39:37,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35
[2024-12-02 12:39:37,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:37,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:37,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35
[2024-12-02 12:39:37,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:37,998 INFO L124 PetriNetUnfolderBase]: 148/334 cut-off events.
[2024-12-02 12:39:37,998 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-12-02 12:39:37,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 334 events. 148/334 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1642 event pairs, 52 based on Foata normal form. 24/354 useless extension candidates. Maximal degree in co-relation 603. Up to 220 conditions per place.
[2024-12-02 12:39:38,003 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 25 selfloop transitions, 2 changer transitions 2/41 dead transitions.
[2024-12-02 12:39:38,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 149 flow
[2024-12-02 12:39:38,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 12:39:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 12:39:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions.
[2024-12-02 12:39:38,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238
[2024-12-02 12:39:38,017 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 76 transitions.
[2024-12-02 12:39:38,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 149 flow
[2024-12-02 12:39:38,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 12:39:38,024 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow
[2024-12-02 12:39:38,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28}
[2024-12-02 12:39:38,030 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places.
[2024-12-02 12:39:38,030 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow
[2024-12-02 12:39:38,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:38,030 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:38,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:38,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-12-02 12:39:38,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:38,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:38,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:38,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1331505195, now seen corresponding path program 1 times
[2024-12-02 12:39:38,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 12:39:38,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126717813]
[2024-12-02 12:39:38,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:38,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:38,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 12:39:38,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 12:39:38,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-12-02 12:39:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:38,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-12-02 12:39:38,311 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-02 12:39:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:38,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-12-02 12:39:38,340 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-12-02 12:39:38,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126717813]
[2024-12-02 12:39:38,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126717813] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:38,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:38,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-12-02 12:39:38,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185278855]
[2024-12-02 12:39:38,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:38,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 12:39:38,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-12-02 12:39:38,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 12:39:38,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 12:39:38,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35
[2024-12-02 12:39:38,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:38,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:38,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35
[2024-12-02 12:39:38,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:38,447 INFO L124 PetriNetUnfolderBase]: 131/303 cut-off events.
[2024-12-02 12:39:38,447 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES.
[2024-12-02 12:39:38,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 303 events. 131/303 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1561 event pairs, 131 based on Foata normal form. 12/304 useless extension candidates. Maximal degree in co-relation 569. Up to 236 conditions per place.
[2024-12-02 12:39:38,450 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 14 selfloop transitions, 1 changer transitions 1/27 dead transitions.
[2024-12-02 12:39:38,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 94 flow
[2024-12-02 12:39:38,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 12:39:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 12:39:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions.
[2024-12-02 12:39:38,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333
[2024-12-02 12:39:38,451 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 56 transitions.
[2024-12-02 12:39:38,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 94 flow
[2024-12-02 12:39:38,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 12:39:38,453 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow
[2024-12-02 12:39:38,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26}
[2024-12-02 12:39:38,454 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places.
[2024-12-02 12:39:38,454 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow
[2024-12-02 12:39:38,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:38,455 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:38,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:38,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-12-02 12:39:38,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:38,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:38,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:38,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1331506475, now seen corresponding path program 1 times
[2024-12-02 12:39:38,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 12:39:38,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1595608812]
[2024-12-02 12:39:38,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:38,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:38,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 12:39:38,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 12:39:38,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-12-02 12:39:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:38,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-12-02 12:39:38,741 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-02 12:39:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:38,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-12-02 12:39:38,783 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-12-02 12:39:38,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595608812]
[2024-12-02 12:39:38,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595608812] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:38,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:38,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-12-02 12:39:38,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581963201]
[2024-12-02 12:39:38,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:38,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-12-02 12:39:38,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-12-02 12:39:38,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-12-02 12:39:38,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-12-02 12:39:38,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35
[2024-12-02 12:39:38,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:38,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:38,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35
[2024-12-02 12:39:38,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:38,955 INFO L124 PetriNetUnfolderBase]: 182/390 cut-off events.
[2024-12-02 12:39:38,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 12:39:38,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 390 events. 182/390 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1797 event pairs, 26 based on Foata normal form. 20/400 useless extension candidates. Maximal degree in co-relation 737. Up to 199 conditions per place.
[2024-12-02 12:39:38,958 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 29 selfloop transitions, 4 changer transitions 1/42 dead transitions.
[2024-12-02 12:39:38,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 160 flow
[2024-12-02 12:39:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-12-02 12:39:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-12-02 12:39:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions.
[2024-12-02 12:39:38,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714
[2024-12-02 12:39:38,961 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 4 states and 80 transitions.
[2024-12-02 12:39:38,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 160 flow
[2024-12-02 12:39:38,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-12-02 12:39:38,963 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 83 flow
[2024-12-02 12:39:38,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=37, PETRI_TRANSITIONS=28}
[2024-12-02 12:39:38,964 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places.
[2024-12-02 12:39:38,964 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 83 flow
[2024-12-02 12:39:38,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:38,964 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:38,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:38,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-12-02 12:39:39,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:39,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:39,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:39,166 INFO L85 PathProgramCache]: Analyzing trace with hash 672005072, now seen corresponding path program 1 times
[2024-12-02 12:39:39,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 12:39:39,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715650027]
[2024-12-02 12:39:39,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:39,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:39,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 12:39:39,167 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 12:39:39,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-12-02 12:39:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:39,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-12-02 12:39:39,247 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-02 12:39:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:39,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-12-02 12:39:39,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-12-02 12:39:39,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715650027]
[2024-12-02 12:39:39,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715650027] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:39,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:39,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-02 12:39:39,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832200351]
[2024-12-02 12:39:39,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:39,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 12:39:39,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-12-02 12:39:39,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 12:39:39,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-12-02 12:39:39,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35
[2024-12-02 12:39:39,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:39,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:39,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35
[2024-12-02 12:39:39,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:39,446 INFO L124 PetriNetUnfolderBase]: 90/202 cut-off events.
[2024-12-02 12:39:39,446 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES.
[2024-12-02 12:39:39,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 202 events. 90/202 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 655 event pairs, 18 based on Foata normal form. 14/209 useless extension candidates. Maximal degree in co-relation 463. Up to 71 conditions per place.
[2024-12-02 12:39:39,448 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 25 selfloop transitions, 6 changer transitions 1/40 dead transitions.
[2024-12-02 12:39:39,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 176 flow
[2024-12-02 12:39:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-12-02 12:39:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-12-02 12:39:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions.
[2024-12-02 12:39:39,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5085714285714286
[2024-12-02 12:39:39,449 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 83 flow. Second operand 5 states and 89 transitions.
[2024-12-02 12:39:39,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 176 flow
[2024-12-02 12:39:39,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 167 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-12-02 12:39:39,457 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 99 flow
[2024-12-02 12:39:39,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=28}
[2024-12-02 12:39:39,458 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places.
[2024-12-02 12:39:39,458 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 99 flow
[2024-12-02 12:39:39,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:39,458 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:39,458 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:39,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-12-02 12:39:39,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:39,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:39,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:39,660 INFO L85 PathProgramCache]: Analyzing trace with hash 668323692, now seen corresponding path program 1 times
[2024-12-02 12:39:39,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 12:39:39,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1762252392]
[2024-12-02 12:39:39,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 12:39:39,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:39,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 12:39:39,662 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 12:39:39,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-12-02 12:39:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 12:39:39,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-12-02 12:39:39,746 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-02 12:39:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:40,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-12-02 12:39:40,092 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-12-02 12:39:40,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762252392]
[2024-12-02 12:39:40,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762252392] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:40,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:40,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-12-02 12:39:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971529412]
[2024-12-02 12:39:40,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:40,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-12-02 12:39:40,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-12-02 12:39:40,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-12-02 12:39:40,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-12-02 12:39:40,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35
[2024-12-02 12:39:40,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 99 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:40,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:40,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35
[2024-12-02 12:39:40,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:40,343 INFO L124 PetriNetUnfolderBase]: 97/238 cut-off events.
[2024-12-02 12:39:40,343 INFO L125 PetriNetUnfolderBase]: For 76/78 co-relation queries the response was YES.
[2024-12-02 12:39:40,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 238 events. 97/238 cut-off events. For 76/78 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 894 event pairs, 42 based on Foata normal form. 4/231 useless extension candidates. Maximal degree in co-relation 534. Up to 103 conditions per place.
[2024-12-02 12:39:40,344 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 18 selfloop transitions, 3 changer transitions 13/45 dead transitions.
[2024-12-02 12:39:40,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 211 flow
[2024-12-02 12:39:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-12-02 12:39:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-12-02 12:39:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-12-02 12:39:40,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857
[2024-12-02 12:39:40,346 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 99 flow. Second operand 7 states and 119 transitions.
[2024-12-02 12:39:40,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 211 flow
[2024-12-02 12:39:40,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 174 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-12-02 12:39:40,349 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 87 flow
[2024-12-02 12:39:40,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=87, PETRI_PLACES=45, PETRI_TRANSITIONS=28}
[2024-12-02 12:39:40,350 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places.
[2024-12-02 12:39:40,350 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 87 flow
[2024-12-02 12:39:40,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 12:39:40,350 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:40,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:40,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-12-02 12:39:40,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:40,551 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:40,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:40,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1592669344, now seen corresponding path program 2 times
[2024-12-02 12:39:40,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 12:39:40,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26451157]
[2024-12-02 12:39:40,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-12-02 12:39:40,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:40,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 12:39:40,554 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 12:39:40,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-12-02 12:39:40,631 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-12-02 12:39:40,631 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-12-02 12:39:40,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-12-02 12:39:40,635 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-02 12:39:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 12:39:40,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-12-02 12:39:40,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-12-02 12:39:40,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26451157]
[2024-12-02 12:39:40,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26451157] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 12:39:40,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 12:39:40,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-12-02 12:39:40,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449006864]
[2024-12-02 12:39:40,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 12:39:40,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-12-02 12:39:40,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-12-02 12:39:40,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-12-02 12:39:40,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-12-02 12:39:40,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35
[2024-12-02 12:39:40,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 87 flow. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 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-12-02 12:39:40,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 12:39:40,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35
[2024-12-02 12:39:40,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 12:39:41,247 INFO L124 PetriNetUnfolderBase]: 172/372 cut-off events.
[2024-12-02 12:39:41,247 INFO L125 PetriNetUnfolderBase]: For 57/59 co-relation queries the response was YES.
[2024-12-02 12:39:41,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 372 events. 172/372 cut-off events. For 57/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1434 event pairs, 51 based on Foata normal form. 9/378 useless extension candidates. Maximal degree in co-relation 847. Up to 117 conditions per place.
[2024-12-02 12:39:41,249 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 23 selfloop transitions, 5 changer transitions 42/76 dead transitions.
[2024-12-02 12:39:41,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 361 flow
[2024-12-02 12:39:41,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-12-02 12:39:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-12-02 12:39:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 180 transitions.
[2024-12-02 12:39:41,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-12-02 12:39:41,251 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 87 flow. Second operand 12 states and 180 transitions.
[2024-12-02 12:39:41,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 361 flow
[2024-12-02 12:39:41,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 327 flow, removed 10 selfloop flow, removed 6 redundant places.
[2024-12-02 12:39:41,254 INFO L231 Difference]: Finished difference. Result has 55 places, 28 transitions, 101 flow
[2024-12-02 12:39:41,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=101, PETRI_PLACES=55, PETRI_TRANSITIONS=28}
[2024-12-02 12:39:41,254 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places.
[2024-12-02 12:39:41,254 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 28 transitions, 101 flow
[2024-12-02 12:39:41,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 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-12-02 12:39:41,255 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 12:39:41,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 12:39:41,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-12-02 12:39:41,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:41,455 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 12:39:41,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 12:39:41,456 INFO L85 PathProgramCache]: Analyzing trace with hash -970912454, now seen corresponding path program 3 times
[2024-12-02 12:39:41,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 12:39:41,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1573368878]
[2024-12-02 12:39:41,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-12-02 12:39:41,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:41,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 12:39:41,458 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 12:39:41,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-12-02 12:39:41,544 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-12-02 12:39:41,544 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-12-02 12:39:41,544 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-12-02 12:39:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-12-02 12:39:41,606 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace
[2024-12-02 12:39:41,607 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-12-02 12:39:41,607 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining)
[2024-12-02 12:39:41,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining)
[2024-12-02 12:39:41,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining)
[2024-12-02 12:39:41,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2024-12-02 12:39:41,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2024-12-02 12:39:41,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining)
[2024-12-02 12:39:41,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2024-12-02 12:39:41,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 12:39:41,811 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1]
[2024-12-02 12:39:41,857 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-12-02 12:39:41,857 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-12-02 12:39:41,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:39:41 BasicIcfg
[2024-12-02 12:39:41,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-12-02 12:39:41,863 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-12-02 12:39:41,863 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-12-02 12:39:41,863 INFO L274 PluginConnector]: Witness Printer initialized
[2024-12-02 12:39:41,863 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:39:37" (3/4) ...
[2024-12-02 12:39:41,865 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-12-02 12:39:41,866 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-12-02 12:39:41,867 INFO L158 Benchmark]: Toolchain (without parser) took 5474.69ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 68.3MB in the beginning and 97.7MB in the end (delta: -29.4MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB.
[2024-12-02 12:39:41,867 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 12:39:41,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.52ms. Allocated memory is still 92.3MB. Free memory was 68.1MB in the beginning and 45.4MB in the end (delta: 22.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-12-02 12:39:41,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.45ms. Allocated memory is still 92.3MB. Free memory was 45.4MB in the beginning and 43.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 12:39:41,867 INFO L158 Benchmark]: Boogie Preprocessor took 43.34ms. Allocated memory is still 92.3MB. Free memory was 43.1MB in the beginning and 40.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 12:39:41,868 INFO L158 Benchmark]: RCFGBuilder took 620.48ms. Allocated memory is still 92.3MB. Free memory was 40.4MB in the beginning and 44.3MB in the end (delta: -3.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB.
[2024-12-02 12:39:41,868 INFO L158 Benchmark]: TraceAbstraction took 4404.21ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 43.4MB in the beginning and 97.7MB in the end (delta: -54.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 12:39:41,868 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 97.7MB in the end (delta: 27.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-12-02 12:39:41,870 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 362.52ms. Allocated memory is still 92.3MB. Free memory was 68.1MB in the beginning and 45.4MB in the end (delta: 22.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 35.45ms. Allocated memory is still 92.3MB. Free memory was 45.4MB in the beginning and 43.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 43.34ms. Allocated memory is still 92.3MB. Free memory was 43.1MB in the beginning and 40.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 620.48ms. Allocated memory is still 92.3MB. Free memory was 40.4MB in the beginning and 44.3MB in the end (delta: -3.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 4404.21ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 43.4MB in the beginning and 97.7MB in the end (delta: -54.3MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 3.11ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 97.7MB in the end (delta: 27.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 17.
Possible FailurePath:
[L708] 0 int __unbuffered_cnt = 0;
[L709] 0 _Bool main$tmp_guard0;
[L710] 0 _Bool main$tmp_guard1;
[L712] 0 int x = 0;
[L714] 0 int y = 0;
[L715] 0 _Bool y$flush_delayed;
[L716] 0 int y$mem_tmp;
[L717] 0 _Bool y$r_buff0_thd0;
[L718] 0 _Bool y$r_buff0_thd1;
[L719] 0 _Bool y$r_buff0_thd2;
[L720] 0 _Bool y$r_buff1_thd0;
[L721] 0 _Bool y$r_buff1_thd1;
[L722] 0 _Bool y$r_buff1_thd2;
[L723] 0 _Bool y$read_delayed;
[L724] 0 int *y$read_delayed_var;
[L725] 0 int y$w_buff0;
[L726] 0 _Bool y$w_buff0_used;
[L727] 0 int y$w_buff1;
[L728] 0 _Bool y$w_buff1_used;
[L729] 0 _Bool weak$$choice0;
[L730] 0 _Bool weak$$choice2;
[L790] 0 pthread_t t2473;
[L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L734] 1 y$w_buff1 = y$w_buff0
[L735] 1 y$w_buff0 = 2
[L736] 1 y$w_buff1_used = y$w_buff0_used
[L737] 1 y$w_buff0_used = (_Bool)1
[L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0
[L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1
[L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2
[L742] 1 y$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L792] 0 pthread_t t2474;
[L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-1, t2474=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L745] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L762] 2 x = 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L765] 2 y = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-1, t2474=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L797] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L797] RET 0 assume_abort_if_not(main$tmp_guard0)
[L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-1, t2474=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L806] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L807] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L808] 0 y$flush_delayed = weak$$choice2
[L809] 0 y$mem_tmp = y
[L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L817] 0 main$tmp_guard1 = !(x == 2 && y == 2)
[L818] 0 y = y$flush_delayed ? y$mem_tmp : y
[L819] 0 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-1, t2474=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L821] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L17] 0 __assert_fail ("0", "safe029_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 788]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 793]: 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: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 5 procedures, 51 locations, 6 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: 4.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 590 IncrementalHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 19 mSDtfsCounter, 590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=6, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 407 SizeOfPredicates, 13 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-12-02 12:39:41,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06f032c-b882-4224-9322-af475ca4c14b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
UNKNOWN: Overapproximated counterexample