./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 8a4342b982522a964cfb4ed0b81a3c247fa38eb769cbb37584570f60425c66cb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:06:45,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:06:46,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 16:06:46,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:06:46,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:06:46,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:06:46,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:06:46,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:06:46,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:06:46,058 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:06:46,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:06:46,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:06:46,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:06:46,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:06:46,061 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:06:46,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:06:46,062 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:06:46,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:06:46,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:06:46,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:06:46,062 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:06:46,064 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:06:46,064 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:06:46,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:06:46,065 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:06:46,065 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:06:46,065 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:06:46,065 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:06:46,065 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:06:46,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:06:46,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:06:46,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:06:46,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:06:46,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:06:46,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:06:46,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:06:46,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:06:46,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:06:46,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:06:46,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:06:46,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:06:46,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:06:46,069 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 8a4342b982522a964cfb4ed0b81a3c247fa38eb769cbb37584570f60425c66cb [2024-11-12 16:06:46,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:06:46,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:06:46,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:06:46,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:06:46,319 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:06:46,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2024-11-12 16:06:47,584 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:06:47,782 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:06:47,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2024-11-12 16:06:47,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/952f6627e/fbbe7dce37dd46cdba5c9284dbe700ad/FLAGa9a0eb54a [2024-11-12 16:06:48,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/952f6627e/fbbe7dce37dd46cdba5c9284dbe700ad [2024-11-12 16:06:48,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:06:48,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:06:48,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:06:48,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:06:48,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:06:48,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf57bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48, skipping insertion in model container [2024-11-12 16:06:48,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:06:48,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:06:48,485 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:06:48,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:06:48,564 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:06:48,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48 WrapperNode [2024-11-12 16:06:48,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:06:48,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:06:48,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:06:48,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:06:48,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,616 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 109 [2024-11-12 16:06:48,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:06:48,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:06:48,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:06:48,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:06:48,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,648 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 16:06:48,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:06:48,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:06:48,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:06:48,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:06:48,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48" (1/1) ... [2024-11-12 16:06:48,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:06:48,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:06:48,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 16:06:48,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 16:06:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 16:06:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:06:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-12 16:06:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-12 16:06:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-12 16:06:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-12 16:06:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:06:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 16:06:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:06:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:06:48,730 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:06:48,857 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:06:48,858 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:06:49,075 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:06:49,075 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:06:49,210 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:06:49,211 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 16:06:49,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:06:49 BoogieIcfgContainer [2024-11-12 16:06:49,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:06:49,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:06:49,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:06:49,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:06:49,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:06:48" (1/3) ... [2024-11-12 16:06:49,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60850637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:06:49, skipping insertion in model container [2024-11-12 16:06:49,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:48" (2/3) ... [2024-11-12 16:06:49,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60850637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:06:49, skipping insertion in model container [2024-11-12 16:06:49,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:06:49" (3/3) ... [2024-11-12 16:06:49,219 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_pso.oepc_rmo.oepc.i [2024-11-12 16:06:49,233 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:06:49,233 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-12 16:06:49,233 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:06:49,275 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 16:06:49,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2024-11-12 16:06:49,323 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-12 16:06:49,323 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:06:49,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-11-12 16:06:49,326 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2024-11-12 16:06:49,330 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2024-11-12 16:06:49,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:06:49,345 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;@633a80fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:06:49,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 16:06:49,349 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:06:49,350 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-12 16:06:49,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:06:49,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:49,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-12 16:06:49,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-12 16:06:49,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:06:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash 10852339, now seen corresponding path program 1 times [2024-11-12 16:06:49,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:06:49,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186775895] [2024-11-12 16:06:49,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:06:49,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:06:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:06:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:06:49,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:06:49,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186775895] [2024-11-12 16:06:49,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186775895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:06:49,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:06:49,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:06:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375534159] [2024-11-12 16:06:49,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:06:49,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:06:49,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:06:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:06:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:06:49,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-11-12 16:06:49,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:49,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:06:49,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-11-12 16:06:49,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:06:49,984 INFO L124 PetriNetUnfolderBase]: 183/415 cut-off events. [2024-11-12 16:06:49,984 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 16:06:49,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 415 events. 183/415 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2225 event pairs, 21 based on Foata normal form. 32/439 useless extension candidates. Maximal degree in co-relation 739. Up to 265 conditions per place. [2024-11-12 16:06:49,989 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 25 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-11-12 16:06:49,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 153 flow [2024-11-12 16:06:49,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:06:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:06:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-11-12 16:06:49,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7387387387387387 [2024-11-12 16:06:50,001 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 82 transitions. [2024-11-12 16:06:50,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 153 flow [2024-11-12 16:06:50,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:06:50,006 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2024-11-12 16:06:50,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-12 16:06:50,011 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-11-12 16:06:50,011 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2024-11-12 16:06:50,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:50,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:50,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:06:50,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:06:50,012 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-11-12 16:06:50,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:06:50,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1742249253, now seen corresponding path program 1 times [2024-11-12 16:06:50,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:06:50,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107129233] [2024-11-12 16:06:50,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:06:50,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:06:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:06:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:06:50,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:06:50,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107129233] [2024-11-12 16:06:50,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107129233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:06:50,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:06:50,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:06:50,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792171204] [2024-11-12 16:06:50,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:06:50,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:06:50,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:06:50,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:06:50,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:06:50,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-12 16:06:50,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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-11-12 16:06:50,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:06:50,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-12 16:06:50,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:06:50,161 INFO L124 PetriNetUnfolderBase]: 159/379 cut-off events. [2024-11-12 16:06:50,161 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-12 16:06:50,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 379 events. 159/379 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2039 event pairs, 159 based on Foata normal form. 16/372 useless extension candidates. Maximal degree in co-relation 693. Up to 280 conditions per place. [2024-11-12 16:06:50,165 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 14 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2024-11-12 16:06:50,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 98 flow [2024-11-12 16:06:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:06:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:06:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-11-12 16:06:50,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2024-11-12 16:06:50,168 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 62 transitions. [2024-11-12 16:06:50,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 98 flow [2024-11-12 16:06:50,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:06:50,169 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2024-11-12 16:06:50,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-11-12 16:06:50,169 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2024-11-12 16:06:50,170 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2024-11-12 16:06:50,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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-11-12 16:06:50,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:50,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:06:50,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:06:50,170 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-11-12 16:06:50,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:06:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1742250718, now seen corresponding path program 1 times [2024-11-12 16:06:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:06:50,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668412693] [2024-11-12 16:06:50,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:06:50,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:06:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:06:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:06:50,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:06:50,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668412693] [2024-11-12 16:06:50,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668412693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:06:50,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:06:50,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:06:50,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608174545] [2024-11-12 16:06:50,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:06:50,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:06:50,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:06:50,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:06:50,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:06:50,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-12 16:06:50,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:50,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:06:50,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-12 16:06:50,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:06:50,555 INFO L124 PetriNetUnfolderBase]: 284/568 cut-off events. [2024-11-12 16:06:50,555 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:06:50,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 568 events. 284/568 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3066 event pairs, 51 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 1073. Up to 281 conditions per place. [2024-11-12 16:06:50,559 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 21 selfloop transitions, 2 changer transitions 32/65 dead transitions. [2024-11-12 16:06:50,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 246 flow [2024-11-12 16:06:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 16:06:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 16:06:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-11-12 16:06:50,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543918918918919 [2024-11-12 16:06:50,563 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 8 states and 161 transitions. [2024-11-12 16:06:50,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 246 flow [2024-11-12 16:06:50,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:06:50,566 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 75 flow [2024-11-12 16:06:50,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=75, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2024-11-12 16:06:50,567 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2024-11-12 16:06:50,568 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 75 flow [2024-11-12 16:06:50,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:50,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:50,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:06:50,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:06:50,569 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-11-12 16:06:50,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:06:50,570 INFO L85 PathProgramCache]: Analyzing trace with hash -473348070, now seen corresponding path program 1 times [2024-11-12 16:06:50,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:06:50,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399980696] [2024-11-12 16:06:50,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:06:50,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:06:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:06:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:06:50,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:06:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399980696] [2024-11-12 16:06:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399980696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:06:50,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:06:50,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:06:50,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246109795] [2024-11-12 16:06:50,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:06:50,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:06:50,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:06:50,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:06:50,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:06:50,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-12 16:06:50,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:50,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:06:50,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-12 16:06:50,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:06:50,801 INFO L124 PetriNetUnfolderBase]: 198/426 cut-off events. [2024-11-12 16:06:50,801 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-11-12 16:06:50,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 426 events. 198/426 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1972 event pairs, 38 based on Foata normal form. 25/436 useless extension candidates. Maximal degree in co-relation 886. Up to 191 conditions per place. [2024-11-12 16:06:50,803 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 31 selfloop transitions, 4 changer transitions 1/45 dead transitions. [2024-11-12 16:06:50,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 185 flow [2024-11-12 16:06:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:06:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:06:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-11-12 16:06:50,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2024-11-12 16:06:50,804 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 75 flow. Second operand 4 states and 90 transitions. [2024-11-12 16:06:50,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 185 flow [2024-11-12 16:06:50,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 173 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-12 16:06:50,807 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 89 flow [2024-11-12 16:06:50,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2024-11-12 16:06:50,808 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2024-11-12 16:06:50,808 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 89 flow [2024-11-12 16:06:50,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:50,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:50,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:06:50,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 16:06:50,809 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-11-12 16:06:50,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:06:50,811 INFO L85 PathProgramCache]: Analyzing trace with hash -311855967, now seen corresponding path program 1 times [2024-11-12 16:06:50,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:06:50,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983350283] [2024-11-12 16:06:50,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:06:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:06:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:06:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:06:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:06:51,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983350283] [2024-11-12 16:06:51,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983350283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:06:51,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:06:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:06:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131934161] [2024-11-12 16:06:51,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:06:51,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:06:51,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:06:51,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:06:51,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:06:51,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-12 16:06:51,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:51,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:06:51,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-12 16:06:51,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:06:51,129 INFO L124 PetriNetUnfolderBase]: 102/225 cut-off events. [2024-11-12 16:06:51,130 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-12 16:06:51,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 225 events. 102/225 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 749 event pairs, 26 based on Foata normal form. 16/231 useless extension candidates. Maximal degree in co-relation 521. Up to 86 conditions per place. [2024-11-12 16:06:51,131 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 26 selfloop transitions, 6 changer transitions 1/42 dead transitions. [2024-11-12 16:06:51,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 186 flow [2024-11-12 16:06:51,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:06:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:06:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-11-12 16:06:51,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-11-12 16:06:51,132 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 89 flow. Second operand 5 states and 100 transitions. [2024-11-12 16:06:51,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 186 flow [2024-11-12 16:06:51,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 173 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-12 16:06:51,134 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 101 flow [2024-11-12 16:06:51,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2024-11-12 16:06:51,134 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-11-12 16:06:51,134 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 101 flow [2024-11-12 16:06:51,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:51,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:51,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:06:51,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 16:06:51,135 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-11-12 16:06:51,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:06:51,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1875798284, now seen corresponding path program 1 times [2024-11-12 16:06:51,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:06:51,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307313425] [2024-11-12 16:06:51,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:06:51,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:06:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:06:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:06:51,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:06:51,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307313425] [2024-11-12 16:06:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307313425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:06:51,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:06:51,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 16:06:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122396932] [2024-11-12 16:06:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:06:51,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 16:06:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:06:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 16:06:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:06:51,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-11-12 16:06:51,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 101 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:51,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:06:51,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-11-12 16:06:51,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:06:51,902 INFO L124 PetriNetUnfolderBase]: 116/288 cut-off events. [2024-11-12 16:06:51,903 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2024-11-12 16:06:51,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 288 events. 116/288 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1191 event pairs, 31 based on Foata normal form. 4/280 useless extension candidates. Maximal degree in co-relation 668. Up to 103 conditions per place. [2024-11-12 16:06:51,905 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 23 selfloop transitions, 6 changer transitions 17/59 dead transitions. [2024-11-12 16:06:51,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 269 flow [2024-11-12 16:06:51,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 16:06:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 16:06:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-11-12 16:06:51,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5371621621621622 [2024-11-12 16:06:51,907 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 101 flow. Second operand 8 states and 159 transitions. [2024-11-12 16:06:51,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 269 flow [2024-11-12 16:06:51,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 229 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-11-12 16:06:51,910 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 118 flow [2024-11-12 16:06:51,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-11-12 16:06:51,910 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2024-11-12 16:06:51,911 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 118 flow [2024-11-12 16:06:51,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:51,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:51,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:06:51,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:06:51,912 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-11-12 16:06:51,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:06:51,912 INFO L85 PathProgramCache]: Analyzing trace with hash -73270978, now seen corresponding path program 2 times [2024-11-12 16:06:51,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:06:51,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854148896] [2024-11-12 16:06:51,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:06:51,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:06:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:06:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:06:52,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:06:52,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854148896] [2024-11-12 16:06:52,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854148896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:06:52,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:06:52,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:06:52,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158809830] [2024-11-12 16:06:52,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:06:52,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:06:52,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:06:52,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:06:52,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:06:52,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-11-12 16:06:52,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:52,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:06:52,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-11-12 16:06:52,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:06:52,228 INFO L124 PetriNetUnfolderBase]: 179/406 cut-off events. [2024-11-12 16:06:52,229 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-12 16:06:52,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 406 events. 179/406 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1810 event pairs, 84 based on Foata normal form. 4/395 useless extension candidates. Maximal degree in co-relation 944. Up to 163 conditions per place. [2024-11-12 16:06:52,230 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 19 selfloop transitions, 5 changer transitions 19/53 dead transitions. [2024-11-12 16:06:52,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 265 flow [2024-11-12 16:06:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:06:52,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:06:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-11-12 16:06:52,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4972972972972973 [2024-11-12 16:06:52,231 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 118 flow. Second operand 5 states and 92 transitions. [2024-11-12 16:06:52,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 265 flow [2024-11-12 16:06:52,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 255 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-12 16:06:52,233 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 126 flow [2024-11-12 16:06:52,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2024-11-12 16:06:52,233 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-11-12 16:06:52,234 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 126 flow [2024-11-12 16:06:52,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:52,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:52,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:06:52,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 16:06:52,234 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-11-12 16:06:52,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:06:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1872615202, now seen corresponding path program 3 times [2024-11-12 16:06:52,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:06:52,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251871356] [2024-11-12 16:06:52,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:06:52,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:06:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:06:52,297 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:06:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:06:52,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 16:06:52,387 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:06:52,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-12 16:06:52,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-12 16:06:52,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-12 16:06:52,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-12 16:06:52,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-12 16:06:52,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-12 16:06:52,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 16:06:52,390 INFO L421 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-11-12 16:06:52,459 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 16:06:52,460 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:06:52,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:06:52 BasicIcfg [2024-11-12 16:06:52,467 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:06:52,467 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:06:52,468 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:06:52,468 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:06:52,468 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:06:49" (3/4) ... [2024-11-12 16:06:52,470 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 16:06:52,470 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:06:52,471 INFO L158 Benchmark]: Toolchain (without parser) took 4325.91ms. Allocated memory was 163.6MB in the beginning and 245.4MB in the end (delta: 81.8MB). Free memory was 130.4MB in the beginning and 102.4MB in the end (delta: 28.0MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. [2024-11-12 16:06:52,471 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 163.6MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:06:52,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.96ms. Allocated memory is still 163.6MB. Free memory was 129.6MB in the beginning and 104.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-12 16:06:52,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.40ms. Allocated memory is still 163.6MB. Free memory was 104.4MB in the beginning and 102.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:06:52,472 INFO L158 Benchmark]: Boogie Preprocessor took 44.88ms. Allocated memory is still 163.6MB. Free memory was 102.3MB in the beginning and 98.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:06:52,472 INFO L158 Benchmark]: RCFGBuilder took 547.94ms. Allocated memory is still 163.6MB. Free memory was 98.9MB in the beginning and 90.0MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 16:06:52,472 INFO L158 Benchmark]: TraceAbstraction took 3254.03ms. Allocated memory was 163.6MB in the beginning and 245.4MB in the end (delta: 81.8MB). Free memory was 90.0MB in the beginning and 102.4MB in the end (delta: -12.4MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2024-11-12 16:06:52,473 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 245.4MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:06:52,474 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.11ms. Allocated memory is still 163.6MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.96ms. Allocated memory is still 163.6MB. Free memory was 129.6MB in the beginning and 104.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.40ms. Allocated memory is still 163.6MB. Free memory was 104.4MB in the beginning and 102.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.88ms. Allocated memory is still 163.6MB. Free memory was 102.3MB in the beginning and 98.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 547.94ms. Allocated memory is still 163.6MB. Free memory was 98.9MB in the beginning and 90.0MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3254.03ms. Allocated memory was 163.6MB in the beginning and 245.4MB in the end (delta: 81.8MB). Free memory was 90.0MB in the beginning and 102.4MB in the end (delta: -12.4MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 245.4MB. Free memory is still 102.4MB. 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; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L720] 0 int z = 0; [L721] 0 _Bool z$flush_delayed; [L722] 0 int z$mem_tmp; [L723] 0 _Bool z$r_buff0_thd0; [L724] 0 _Bool z$r_buff0_thd1; [L725] 0 _Bool z$r_buff0_thd2; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$read_delayed; [L730] 0 int *z$read_delayed_var; [L731] 0 int z$w_buff0; [L732] 0 _Bool z$w_buff0_used; [L733] 0 int z$w_buff1; [L734] 0 _Bool z$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1089; [L816] FCALL, FORK 0 pthread_create(&t1089, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1089=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L740] 1 z$w_buff1 = z$w_buff0 [L741] 1 z$w_buff0 = 1 [L742] 1 z$w_buff1_used = z$w_buff0_used [L743] 1 z$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L745] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L746] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L747] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 0 pthread_t t1090; [L818] FCALL, FORK 0 pthread_create(&t1090, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1089=-2, t1090=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L794] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L795] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L796] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L797] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089=-2, t1090=-1, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L825] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L826] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L827] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L828] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089=-2, t1090=-1, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L831] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089=-2, t1090=-1, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L833] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix041_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 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: 3.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 3 mSDtfsCounter, 540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 16:06:52,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 8a4342b982522a964cfb4ed0b81a3c247fa38eb769cbb37584570f60425c66cb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:06:54,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:06:54,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 16:06:54,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:06:54,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:06:54,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:06:54,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:06:54,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:06:54,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:06:54,356 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:06:54,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:06:54,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:06:54,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:06:54,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:06:54,358 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:06:54,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:06:54,359 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:06:54,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:06:54,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:06:54,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:06:54,360 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:06:54,363 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:06:54,363 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:06:54,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:06:54,364 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:06:54,364 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 16:06:54,364 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:06:54,364 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 16:06:54,364 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:06:54,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:06:54,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:06:54,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:06:54,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:06:54,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:06:54,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:06:54,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:06:54,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:06:54,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:06:54,366 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 16:06:54,366 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 16:06:54,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:06:54,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:06:54,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:06:54,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:06:54,368 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 8a4342b982522a964cfb4ed0b81a3c247fa38eb769cbb37584570f60425c66cb [2024-11-12 16:06:54,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:06:54,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:06:54,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:06:54,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:06:54,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:06:54,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2024-11-12 16:06:55,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:06:56,079 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:06:56,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2024-11-12 16:06:56,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3291d1397/4faea27d14654c9c8993a4d40d90a88f/FLAG37a02a57a [2024-11-12 16:06:56,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3291d1397/4faea27d14654c9c8993a4d40d90a88f [2024-11-12 16:06:56,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:06:56,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:06:56,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:06:56,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:06:56,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:06:56,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f39a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56, skipping insertion in model container [2024-11-12 16:06:56,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:06:56,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:06:56,481 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:06:56,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:06:56,559 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:06:56,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56 WrapperNode [2024-11-12 16:06:56,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:06:56,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:06:56,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:06:56,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:06:56,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,617 INFO L138 Inliner]: procedures = 175, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 110 [2024-11-12 16:06:56,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:06:56,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:06:56,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:06:56,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:06:56,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,654 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 16:06:56,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:06:56,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:06:56,675 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:06:56,675 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:06:56,676 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56" (1/1) ... [2024-11-12 16:06:56,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:06:56,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:06:56,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 16:06:56,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 16:06:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 16:06:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:06:56,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 16:06:56,751 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-12 16:06:56,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-12 16:06:56,751 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-12 16:06:56,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-12 16:06:56,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 16:06:56,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:06:56,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:06:56,753 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:06:56,892 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:06:56,894 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:06:57,127 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:06:57,129 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:06:57,319 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:06:57,320 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 16:06:57,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:06:57 BoogieIcfgContainer [2024-11-12 16:06:57,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:06:57,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:06:57,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:06:57,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:06:57,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:06:56" (1/3) ... [2024-11-12 16:06:57,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d54cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:06:57, skipping insertion in model container [2024-11-12 16:06:57,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:06:56" (2/3) ... [2024-11-12 16:06:57,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d54cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:06:57, skipping insertion in model container [2024-11-12 16:06:57,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:06:57" (3/3) ... [2024-11-12 16:06:57,330 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_pso.oepc_rmo.oepc.i [2024-11-12 16:06:57,343 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:06:57,345 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-12 16:06:57,345 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:06:57,388 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 16:06:57,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2024-11-12 16:06:57,439 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-12 16:06:57,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:06:57,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-11-12 16:06:57,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2024-11-12 16:06:57,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2024-11-12 16:06:57,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:06:57,463 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;@70762c38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:06:57,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 16:06:57,466 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:06:57,466 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-12 16:06:57,466 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:06:57,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:57,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-12 16:06:57,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-12 16:06:57,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:06:57,472 INFO L85 PathProgramCache]: Analyzing trace with hash 10913907, now seen corresponding path program 1 times [2024-11-12 16:06:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:06:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818527980] [2024-11-12 16:06:57,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:06:57,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:06:57,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:06:57,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:06:57,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 16:06:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:06:57,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:06:57,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:06:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:06:57,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:06:57,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:06:57,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818527980] [2024-11-12 16:06:57,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818527980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:06:57,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:06:57,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:06:57,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349589882] [2024-11-12 16:06:57,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:06:57,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:06:57,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:06:57,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:06:57,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:06:57,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-11-12 16:06:57,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:57,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:06:57,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-11-12 16:06:57,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:06:57,806 INFO L124 PetriNetUnfolderBase]: 183/415 cut-off events. [2024-11-12 16:06:57,806 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 16:06:57,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 415 events. 183/415 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2225 event pairs, 21 based on Foata normal form. 32/439 useless extension candidates. Maximal degree in co-relation 739. Up to 265 conditions per place. [2024-11-12 16:06:57,814 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 25 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-11-12 16:06:57,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 153 flow [2024-11-12 16:06:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:06:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:06:57,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-11-12 16:06:57,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7387387387387387 [2024-11-12 16:06:57,825 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 82 transitions. [2024-11-12 16:06:57,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 153 flow [2024-11-12 16:06:57,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:06:57,828 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2024-11-12 16:06:57,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-12 16:06:57,833 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-11-12 16:06:57,833 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2024-11-12 16:06:57,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:57,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:57,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:06:57,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 16:06:58,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:06:58,036 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-11-12 16:06:58,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:06:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash -868435033, now seen corresponding path program 1 times [2024-11-12 16:06:58,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:06:58,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124724117] [2024-11-12 16:06:58,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:06:58,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:06:58,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:06:58,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:06:58,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 16:06:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:06:58,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:06:58,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:06:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:06:58,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:06:58,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:06:58,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124724117] [2024-11-12 16:06:58,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124724117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:06:58,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:06:58,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:06:58,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370776258] [2024-11-12 16:06:58,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:06:58,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:06:58,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:06:58,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:06:58,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:06:58,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-12 16:06:58,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:58,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:06:58,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-12 16:06:58,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:06:58,298 INFO L124 PetriNetUnfolderBase]: 220/496 cut-off events. [2024-11-12 16:06:58,299 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-12 16:06:58,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 496 events. 220/496 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2526 event pairs, 38 based on Foata normal form. 25/506 useless extension candidates. Maximal degree in co-relation 933. Up to 229 conditions per place. [2024-11-12 16:06:58,306 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 32 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2024-11-12 16:06:58,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 184 flow [2024-11-12 16:06:58,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:06:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:06:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-11-12 16:06:58,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6148648648648649 [2024-11-12 16:06:58,308 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 4 states and 91 transitions. [2024-11-12 16:06:58,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 184 flow [2024-11-12 16:06:58,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:06:58,313 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 90 flow [2024-11-12 16:06:58,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-11-12 16:06:58,314 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2024-11-12 16:06:58,314 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 90 flow [2024-11-12 16:06:58,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:58,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:58,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:06:58,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 16:06:58,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:06:58,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-12 16:06:58,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:06:58,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1740383116, now seen corresponding path program 1 times [2024-11-12 16:06:58,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:06:58,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794201070] [2024-11-12 16:06:58,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:06:58,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:06:58,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:06:58,528 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:06:58,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 16:06:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:06:58,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 16:06:58,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:06:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:06:58,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:06:58,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:06:58,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794201070] [2024-11-12 16:06:58,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794201070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:06:58,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:06:58,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:06:58,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569496867] [2024-11-12 16:06:58,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:06:58,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:06:58,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:06:58,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:06:58,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:06:58,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-12 16:06:58,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:58,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:06:58,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-12 16:06:58,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:06:58,778 INFO L124 PetriNetUnfolderBase]: 106/241 cut-off events. [2024-11-12 16:06:58,779 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-12 16:06:58,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 241 events. 106/241 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 831 event pairs, 26 based on Foata normal form. 16/247 useless extension candidates. Maximal degree in co-relation 534. Up to 86 conditions per place. [2024-11-12 16:06:58,781 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 27 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2024-11-12 16:06:58,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 189 flow [2024-11-12 16:06:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:06:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:06:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-11-12 16:06:58,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5459459459459459 [2024-11-12 16:06:58,783 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 90 flow. Second operand 5 states and 101 transitions. [2024-11-12 16:06:58,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 189 flow [2024-11-12 16:06:58,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 180 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-12 16:06:58,784 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 106 flow [2024-11-12 16:06:58,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2024-11-12 16:06:58,785 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-11-12 16:06:58,785 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 106 flow [2024-11-12 16:06:58,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:58,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:58,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:06:58,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-12 16:06:58,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:06:58,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-12 16:06:58,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:06:58,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1591533653, now seen corresponding path program 1 times [2024-11-12 16:06:58,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:06:58,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484214648] [2024-11-12 16:06:58,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:06:58,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:06:58,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:06:58,991 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:06:58,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 16:06:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:06:59,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 16:06:59,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:06:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:06:59,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:06:59,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:06:59,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484214648] [2024-11-12 16:06:59,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484214648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:06:59,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:06:59,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:06:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733504590] [2024-11-12 16:06:59,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:06:59,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:06:59,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:06:59,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:06:59,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:06:59,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-12 16:06:59,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:59,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:06:59,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-12 16:06:59,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:06:59,150 INFO L124 PetriNetUnfolderBase]: 62/172 cut-off events. [2024-11-12 16:06:59,150 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-12 16:06:59,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 172 events. 62/172 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs, 60 based on Foata normal form. 4/167 useless extension candidates. Maximal degree in co-relation 354. Up to 123 conditions per place. [2024-11-12 16:06:59,152 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 14 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2024-11-12 16:06:59,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 136 flow [2024-11-12 16:06:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:06:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:06:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-11-12 16:06:59,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2024-11-12 16:06:59,153 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 106 flow. Second operand 3 states and 62 transitions. [2024-11-12 16:06:59,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 136 flow [2024-11-12 16:06:59,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 108 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-12 16:06:59,154 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 76 flow [2024-11-12 16:06:59,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2024-11-12 16:06:59,155 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2024-11-12 16:06:59,155 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 76 flow [2024-11-12 16:06:59,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:59,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:59,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:06:59,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 16:06:59,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:06:59,356 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-11-12 16:06:59,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:06:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash -343719036, now seen corresponding path program 1 times [2024-11-12 16:06:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:06:59,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156845772] [2024-11-12 16:06:59,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:06:59,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:06:59,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:06:59,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:06:59,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 16:06:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:06:59,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 16:06:59,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:06:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:06:59,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:06:59,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:06:59,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156845772] [2024-11-12 16:06:59,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156845772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:06:59,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:06:59,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 16:06:59,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587195508] [2024-11-12 16:06:59,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:06:59,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 16:06:59,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:06:59,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 16:06:59,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 16:06:59,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-12 16:06:59,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 76 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:59,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:06:59,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-12 16:06:59,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:06:59,793 INFO L124 PetriNetUnfolderBase]: 91/232 cut-off events. [2024-11-12 16:06:59,794 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:06:59,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 232 events. 91/232 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 872 event pairs, 17 based on Foata normal form. 4/227 useless extension candidates. Maximal degree in co-relation 444. Up to 51 conditions per place. [2024-11-12 16:06:59,795 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 22 selfloop transitions, 4 changer transitions 17/57 dead transitions. [2024-11-12 16:06:59,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 220 flow [2024-11-12 16:06:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 16:06:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-12 16:06:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-11-12 16:06:59,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5375375375375375 [2024-11-12 16:06:59,796 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 76 flow. Second operand 9 states and 179 transitions. [2024-11-12 16:06:59,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 220 flow [2024-11-12 16:06:59,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:06:59,797 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 93 flow [2024-11-12 16:06:59,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=93, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2024-11-12 16:06:59,798 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-11-12 16:06:59,798 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 93 flow [2024-11-12 16:06:59,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:06:59,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:06:59,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:06:59,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 16:07:00,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:07:00,006 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-11-12 16:07:00,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:07:00,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1919088782, now seen corresponding path program 2 times [2024-11-12 16:07:00,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:07:00,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199193622] [2024-11-12 16:07:00,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:07:00,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:07:00,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:07:00,010 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:07:00,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 16:07:00,082 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 16:07:00,082 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:07:00,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:07:00,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:07:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:07:00,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:07:00,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:07:00,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199193622] [2024-11-12 16:07:00,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199193622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:07:00,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:07:00,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:07:00,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827085580] [2024-11-12 16:07:00,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:07:00,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:07:00,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:07:00,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:07:00,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:07:00,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-12 16:07:00,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 30 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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-11-12 16:07:00,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:07:00,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-12 16:07:00,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:07:00,218 INFO L124 PetriNetUnfolderBase]: 122/311 cut-off events. [2024-11-12 16:07:00,218 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2024-11-12 16:07:00,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 311 events. 122/311 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1273 event pairs, 70 based on Foata normal form. 4/303 useless extension candidates. Maximal degree in co-relation 670. Up to 136 conditions per place. [2024-11-12 16:07:00,219 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 19 selfloop transitions, 2 changer transitions 14/47 dead transitions. [2024-11-12 16:07:00,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 211 flow [2024-11-12 16:07:00,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:07:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:07:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-11-12 16:07:00,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5459459459459459 [2024-11-12 16:07:00,220 INFO L175 Difference]: Start difference. First operand has 49 places, 30 transitions, 93 flow. Second operand 5 states and 101 transitions. [2024-11-12 16:07:00,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 211 flow [2024-11-12 16:07:00,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 189 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-12 16:07:00,222 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 91 flow [2024-11-12 16:07:00,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2024-11-12 16:07:00,222 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-11-12 16:07:00,223 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 91 flow [2024-11-12 16:07:00,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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-11-12 16:07:00,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:07:00,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:07:00,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-12 16:07:00,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:07:00,427 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-11-12 16:07:00,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:07:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash -935018700, now seen corresponding path program 3 times [2024-11-12 16:07:00,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:07:00,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705790731] [2024-11-12 16:07:00,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:07:00,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:07:00,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:07:00,430 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:07:00,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 16:07:00,490 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-12 16:07:00,490 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-12 16:07:00,490 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:07:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:07:00,575 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 16:07:00,575 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:07:00,576 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-12 16:07:00,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-12 16:07:00,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-12 16:07:00,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-12 16:07:00,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-12 16:07:00,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-12 16:07:00,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-12 16:07:00,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:07:00,779 INFO L421 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-12 16:07:00,840 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 16:07:00,840 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:07:00,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:07:00 BasicIcfg [2024-11-12 16:07:00,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:07:00,845 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:07:00,845 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:07:00,845 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:07:00,845 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:06:57" (3/4) ... [2024-11-12 16:07:00,847 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 16:07:00,847 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:07:00,848 INFO L158 Benchmark]: Toolchain (without parser) took 4745.25ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 43.8MB in the beginning and 61.8MB in the end (delta: -18.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-12 16:07:00,848 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 46.1MB. Free memory is still 26.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:07:00,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.05ms. Allocated memory is still 71.3MB. Free memory was 43.6MB in the beginning and 38.6MB in the end (delta: 5.0MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-12 16:07:00,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.61ms. Allocated memory is still 71.3MB. Free memory was 38.6MB in the beginning and 36.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:07:00,849 INFO L158 Benchmark]: Boogie Preprocessor took 50.59ms. Allocated memory is still 71.3MB. Free memory was 36.2MB in the beginning and 33.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 16:07:00,849 INFO L158 Benchmark]: RCFGBuilder took 649.63ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 32.7MB in the beginning and 65.4MB in the end (delta: -32.7MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-11-12 16:07:00,850 INFO L158 Benchmark]: TraceAbstraction took 3522.03ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 64.1MB in the beginning and 61.8MB in the end (delta: 2.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-11-12 16:07:00,853 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 109.1MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:07:00,854 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 46.1MB. Free memory is still 26.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.05ms. Allocated memory is still 71.3MB. Free memory was 43.6MB in the beginning and 38.6MB in the end (delta: 5.0MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.61ms. Allocated memory is still 71.3MB. Free memory was 38.6MB in the beginning and 36.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.59ms. Allocated memory is still 71.3MB. Free memory was 36.2MB in the beginning and 33.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 649.63ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 32.7MB in the beginning and 65.4MB in the end (delta: -32.7MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3522.03ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 64.1MB in the beginning and 61.8MB in the end (delta: 2.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 109.1MB. Free memory is still 61.8MB. 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; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L720] 0 int z = 0; [L721] 0 _Bool z$flush_delayed; [L722] 0 int z$mem_tmp; [L723] 0 _Bool z$r_buff0_thd0; [L724] 0 _Bool z$r_buff0_thd1; [L725] 0 _Bool z$r_buff0_thd2; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$read_delayed; [L730] 0 int *z$read_delayed_var; [L731] 0 int z$w_buff0; [L732] 0 _Bool z$w_buff0_used; [L733] 0 int z$w_buff1; [L734] 0 _Bool z$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1089; [L816] FCALL, FORK 0 pthread_create(&t1089, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1089=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L740] 1 z$w_buff1 = z$w_buff0 [L741] 1 z$w_buff0 = 1 [L742] 1 z$w_buff1_used = z$w_buff0_used [L743] 1 z$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L745] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L746] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L747] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 0 pthread_t t1090; [L818] FCALL, FORK 0 pthread_create(&t1090, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1089=0, t1090=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L793] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L794] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L795] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L796] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L797] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089=0, t1090=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L825] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L826] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L827] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L828] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089=0, t1090=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L831] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089=0, t1090=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L833] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix041_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 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: 3.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 480 IncrementalHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 0 mSDtfsCounter, 480 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=3, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 360 SizeOfPredicates, 8 NumberOfNonLiveVariables, 538 ConjunctsInSsa, 30 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 16:07:00,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample