./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/mix054_power.oepc_power.opt_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 f58f201da760ce0979516aee35f163e5c35cd587f19dc7144725dfa101235aca --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:16:45,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:16:45,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:16:45,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:16:45,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:16:46,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:16:46,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:16:46,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:16:46,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:16:46,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:16:46,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:16:46,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:16:46,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:16:46,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:16:46,010 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:16:46,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:16:46,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:16:46,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:16:46,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:16:46,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:16:46,012 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:16:46,016 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:16:46,016 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:16:46,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:16:46,017 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:16:46,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:16:46,017 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:16:46,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:16:46,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:16:46,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:16:46,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:16:46,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:16:46,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:16:46,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:16:46,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:16:46,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:16:46,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:16:46,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:16:46,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:16:46,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:16:46,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:16:46,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:16:46,022 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 -> f58f201da760ce0979516aee35f163e5c35cd587f19dc7144725dfa101235aca [2024-11-17 03:16:46,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:16:46,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:16:46,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:16:46,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:16:46,325 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:16:46,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-11-17 03:16:47,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:16:48,048 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:16:48,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-11-17 03:16:48,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3605ab21/725ee2c746fe41f9b2c0af5a86ca4aca/FLAG98ff16238 [2024-11-17 03:16:48,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3605ab21/725ee2c746fe41f9b2c0af5a86ca4aca [2024-11-17 03:16:48,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:16:48,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:16:48,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:16:48,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:16:48,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:16:48,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e700ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48, skipping insertion in model container [2024-11-17 03:16:48,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:16:48,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:16:48,561 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:16:48,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:16:48,675 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:16:48,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48 WrapperNode [2024-11-17 03:16:48,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:16:48,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:16:48,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:16:48,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:16:48,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,748 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 107 [2024-11-17 03:16:48,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:16:48,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:16:48,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:16:48,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:16:48,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,802 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-17 03:16:48,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:16:48,830 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:16:48,830 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:16:48,831 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:16:48,831 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (1/1) ... [2024-11-17 03:16:48,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:16:48,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:16:48,868 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-17 03:16:48,877 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-17 03:16:48,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:16:48,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:16:48,927 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:16:48,928 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:16:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:16:48,928 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:16:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:16:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:16:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:16:48,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:16:48,931 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:16:49,067 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:16:49,070 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:16:49,361 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:16:49,362 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:16:49,627 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:16:49,631 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:16:49,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:16:49 BoogieIcfgContainer [2024-11-17 03:16:49,632 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:16:49,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:16:49,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:16:49,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:16:49,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:16:48" (1/3) ... [2024-11-17 03:16:49,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3306648f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:16:49, skipping insertion in model container [2024-11-17 03:16:49,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:48" (2/3) ... [2024-11-17 03:16:49,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3306648f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:16:49, skipping insertion in model container [2024-11-17 03:16:49,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:16:49" (3/3) ... [2024-11-17 03:16:49,645 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-11-17 03:16:49,664 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:16:49,664 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:16:49,664 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:16:49,724 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:16:49,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2024-11-17 03:16:49,796 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-17 03:16:49,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:16:49,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 2/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-11-17 03:16:49,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2024-11-17 03:16:49,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2024-11-17 03:16:49,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:16:49,831 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;@73978d55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:16:49,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 03:16:49,836 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:16:49,836 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-17 03:16:49,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:16:49,836 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:16:49,837 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-17 03:16:49,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:16:49,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:16:49,844 INFO L85 PathProgramCache]: Analyzing trace with hash 10130404, now seen corresponding path program 1 times [2024-11-17 03:16:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:16:49,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516006707] [2024-11-17 03:16:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:16:49,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:16:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:16:50,324 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-17 03:16:50,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:16:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516006707] [2024-11-17 03:16:50,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516006707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:16:50,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:16:50,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:16:50,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117035970] [2024-11-17 03:16:50,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:16:50,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:16:50,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:16:50,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:16:50,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:16:50,373 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-11-17 03:16:50,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-17 03:16:50,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:16:50,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-11-17 03:16:50,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:16:50,759 INFO L124 PetriNetUnfolderBase]: 575/974 cut-off events. [2024-11-17 03:16:50,760 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-17 03:16:50,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 974 events. 575/974 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4714 event pairs, 45 based on Foata normal form. 72/1045 useless extension candidates. Maximal degree in co-relation 1930. Up to 841 conditions per place. [2024-11-17 03:16:50,773 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 35 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2024-11-17 03:16:50,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 177 flow [2024-11-17 03:16:50,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:16:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:16:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-11-17 03:16:50,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2024-11-17 03:16:50,803 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 68 transitions. [2024-11-17 03:16:50,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 177 flow [2024-11-17 03:16:50,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:16:50,816 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2024-11-17 03:16:50,817 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-11-17 03:16:50,825 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2024-11-17 03:16:50,826 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2024-11-17 03:16:50,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-17 03:16:50,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:16:50,827 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:16:50,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:16:50,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:16:50,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:16:50,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1716073646, now seen corresponding path program 1 times [2024-11-17 03:16:50,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:16:50,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190670030] [2024-11-17 03:16:50,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:16:50,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:16:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:16:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:16:50,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:16:50,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190670030] [2024-11-17 03:16:50,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190670030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:16:50,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:16:50,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:16:50,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863133031] [2024-11-17 03:16:50,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:16:50,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:16:50,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:16:50,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:16:50,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:16:50,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2024-11-17 03:16:50,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-17 03:16:50,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:16:50,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2024-11-17 03:16:50,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:16:51,075 INFO L124 PetriNetUnfolderBase]: 515/963 cut-off events. [2024-11-17 03:16:51,075 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-11-17 03:16:51,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 963 events. 515/963 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4714 event pairs, 515 based on Foata normal form. 36/998 useless extension candidates. Maximal degree in co-relation 1879. Up to 852 conditions per place. [2024-11-17 03:16:51,083 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 20 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2024-11-17 03:16:51,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 106 flow [2024-11-17 03:16:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:16:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:16:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2024-11-17 03:16:51,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2024-11-17 03:16:51,085 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 44 transitions. [2024-11-17 03:16:51,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 106 flow [2024-11-17 03:16:51,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:16:51,087 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2024-11-17 03:16:51,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2024-11-17 03:16:51,088 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2024-11-17 03:16:51,088 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2024-11-17 03:16:51,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-17 03:16:51,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:16:51,089 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:16:51,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:16:51,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:16:51,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:16:51,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1716073138, now seen corresponding path program 1 times [2024-11-17 03:16:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:16:51,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179509804] [2024-11-17 03:16:51,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:16:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:16:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:16:51,324 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-17 03:16:51,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:16:51,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179509804] [2024-11-17 03:16:51,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179509804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:16:51,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:16:51,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:16:51,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930552760] [2024-11-17 03:16:51,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:16:51,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:16:51,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:16:51,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:16:51,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:16:51,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2024-11-17 03:16:51,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-17 03:16:51,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:16:51,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2024-11-17 03:16:51,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:16:51,691 INFO L124 PetriNetUnfolderBase]: 645/1153 cut-off events. [2024-11-17 03:16:51,691 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:16:51,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2253 conditions, 1153 events. 645/1153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5807 event pairs, 235 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 2247. Up to 718 conditions per place. [2024-11-17 03:16:51,699 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 27 selfloop transitions, 3 changer transitions 42/76 dead transitions. [2024-11-17 03:16:51,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 76 transitions, 304 flow [2024-11-17 03:16:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:16:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:16:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-11-17 03:16:51,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-11-17 03:16:51,704 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 8 states and 130 transitions. [2024-11-17 03:16:51,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 76 transitions, 304 flow [2024-11-17 03:16:51,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:16:51,707 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 90 flow [2024-11-17 03:16:51,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2024-11-17 03:16:51,708 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2024-11-17 03:16:51,709 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 90 flow [2024-11-17 03:16:51,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-17 03:16:51,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:16:51,710 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:16:51,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:16:51,710 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:16:51,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:16:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash -376587105, now seen corresponding path program 1 times [2024-11-17 03:16:51,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:16:51,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736671675] [2024-11-17 03:16:51,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:16:51,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:16:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:16:51,867 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-17 03:16:51,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:16:51,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736671675] [2024-11-17 03:16:51,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736671675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:16:51,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:16:51,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:16:51,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328107185] [2024-11-17 03:16:51,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:16:51,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:16:51,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:16:51,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:16:51,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:16:51,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-11-17 03:16:51,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-17 03:16:51,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:16:51,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-11-17 03:16:51,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:16:52,031 INFO L124 PetriNetUnfolderBase]: 303/587 cut-off events. [2024-11-17 03:16:52,032 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2024-11-17 03:16:52,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 587 events. 303/587 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2512 event pairs, 60 based on Foata normal form. 36/622 useless extension candidates. Maximal degree in co-relation 1418. Up to 289 conditions per place. [2024-11-17 03:16:52,035 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 40 selfloop transitions, 4 changer transitions 1/49 dead transitions. [2024-11-17 03:16:52,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 250 flow [2024-11-17 03:16:52,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:16:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:16:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2024-11-17 03:16:52,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-11-17 03:16:52,038 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 90 flow. Second operand 4 states and 77 transitions. [2024-11-17 03:16:52,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 250 flow [2024-11-17 03:16:52,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 243 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-17 03:16:52,041 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 109 flow [2024-11-17 03:16:52,041 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2024-11-17 03:16:52,045 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2024-11-17 03:16:52,045 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 109 flow [2024-11-17 03:16:52,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-17 03:16:52,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:16:52,046 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:16:52,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:16:52,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:16:52,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:16:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1397033582, now seen corresponding path program 1 times [2024-11-17 03:16:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:16:52,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617823334] [2024-11-17 03:16:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:16:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:16:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:16:52,302 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-17 03:16:52,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:16:52,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617823334] [2024-11-17 03:16:52,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617823334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:16:52,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:16:52,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:16:52,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854150136] [2024-11-17 03:16:52,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:16:52,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:16:52,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:16:52,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:16:52,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:16:52,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2024-11-17 03:16:52,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:16:52,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:16:52,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2024-11-17 03:16:52,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:16:52,594 INFO L124 PetriNetUnfolderBase]: 435/831 cut-off events. [2024-11-17 03:16:52,594 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2024-11-17 03:16:52,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2150 conditions, 831 events. 435/831 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3945 event pairs, 143 based on Foata normal form. 26/856 useless extension candidates. Maximal degree in co-relation 2137. Up to 395 conditions per place. [2024-11-17 03:16:52,599 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 35 selfloop transitions, 3 changer transitions 33/75 dead transitions. [2024-11-17 03:16:52,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 75 transitions, 398 flow [2024-11-17 03:16:52,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:16:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:16:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-11-17 03:16:52,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2024-11-17 03:16:52,601 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 109 flow. Second operand 7 states and 117 transitions. [2024-11-17 03:16:52,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 75 transitions, 398 flow [2024-11-17 03:16:52,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 75 transitions, 379 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-17 03:16:52,604 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 119 flow [2024-11-17 03:16:52,605 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=119, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2024-11-17 03:16:52,605 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2024-11-17 03:16:52,605 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 119 flow [2024-11-17 03:16:52,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:16:52,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:16:52,606 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:16:52,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:16:52,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:16:52,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:16:52,607 INFO L85 PathProgramCache]: Analyzing trace with hash 833854327, now seen corresponding path program 1 times [2024-11-17 03:16:52,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:16:52,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759481745] [2024-11-17 03:16:52,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:16:52,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:16:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:16:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:16:52,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:16:52,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759481745] [2024-11-17 03:16:52,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759481745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:16:52,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:16:52,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:16:52,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286702281] [2024-11-17 03:16:52,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:16:52,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:16:52,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:16:52,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:16:52,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:16:52,867 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-11-17 03:16:52,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 29 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-17 03:16:52,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:16:52,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-11-17 03:16:52,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:16:53,021 INFO L124 PetriNetUnfolderBase]: 212/418 cut-off events. [2024-11-17 03:16:53,021 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2024-11-17 03:16:53,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 418 events. 212/418 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1597 event pairs, 60 based on Foata normal form. 34/451 useless extension candidates. Maximal degree in co-relation 1057. Up to 179 conditions per place. [2024-11-17 03:16:53,025 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 29 selfloop transitions, 6 changer transitions 5/44 dead transitions. [2024-11-17 03:16:53,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 248 flow [2024-11-17 03:16:53,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:16:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:16:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-11-17 03:16:53,027 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-11-17 03:16:53,027 INFO L175 Difference]: Start difference. First operand has 49 places, 29 transitions, 119 flow. Second operand 5 states and 80 transitions. [2024-11-17 03:16:53,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 248 flow [2024-11-17 03:16:53,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 213 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-11-17 03:16:53,031 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 107 flow [2024-11-17 03:16:53,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=107, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2024-11-17 03:16:53,032 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2024-11-17 03:16:53,033 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 107 flow [2024-11-17 03:16:53,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-17 03:16:53,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:16:53,033 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:16:53,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:16:53,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:16:53,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:16:53,034 INFO L85 PathProgramCache]: Analyzing trace with hash -405280701, now seen corresponding path program 1 times [2024-11-17 03:16:53,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:16:53,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038343097] [2024-11-17 03:16:53,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:16:53,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:16:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:16:53,858 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-17 03:16:53,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:16:53,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038343097] [2024-11-17 03:16:53,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038343097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:16:53,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:16:53,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:16:53,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842352548] [2024-11-17 03:16:53,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:16:53,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:16:53,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:16:53,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:16:53,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:16:53,863 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2024-11-17 03:16:53,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 107 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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-17 03:16:53,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:16:53,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2024-11-17 03:16:53,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:16:54,140 INFO L124 PetriNetUnfolderBase]: 131/274 cut-off events. [2024-11-17 03:16:54,141 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2024-11-17 03:16:54,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 274 events. 131/274 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 877 event pairs, 16 based on Foata normal form. 4/277 useless extension candidates. Maximal degree in co-relation 722. Up to 106 conditions per place. [2024-11-17 03:16:54,143 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 28 selfloop transitions, 4 changer transitions 23/59 dead transitions. [2024-11-17 03:16:54,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 329 flow [2024-11-17 03:16:54,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:16:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:16:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-11-17 03:16:54,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2024-11-17 03:16:54,145 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 107 flow. Second operand 9 states and 115 transitions. [2024-11-17 03:16:54,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 329 flow [2024-11-17 03:16:54,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 261 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-11-17 03:16:54,149 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 89 flow [2024-11-17 03:16:54,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=89, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2024-11-17 03:16:54,150 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2024-11-17 03:16:54,150 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 89 flow [2024-11-17 03:16:54,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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-17 03:16:54,151 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:16:54,151 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:16:54,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:16:54,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:16:54,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:16:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1895003113, now seen corresponding path program 2 times [2024-11-17 03:16:54,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:16:54,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571820469] [2024-11-17 03:16:54,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:16:54,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:16:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:16:54,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:16:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:16:54,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:16:54,388 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:16:54,390 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-17 03:16:54,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-17 03:16:54,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-17 03:16:54,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-17 03:16:54,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-17 03:16:54,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-17 03:16:54,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:16:54,393 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-11-17 03:16:54,464 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:16:54,464 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:16:54,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:16:54 BasicIcfg [2024-11-17 03:16:54,473 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:16:54,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:16:54,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:16:54,473 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:16:54,474 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:16:49" (3/4) ... [2024-11-17 03:16:54,476 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:16:54,477 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:16:54,477 INFO L158 Benchmark]: Toolchain (without parser) took 6390.12ms. Allocated memory was 165.7MB in the beginning and 260.0MB in the end (delta: 94.4MB). Free memory was 109.0MB in the beginning and 126.7MB in the end (delta: -17.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-11-17 03:16:54,478 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:16:54,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.72ms. Allocated memory is still 165.7MB. Free memory was 108.8MB in the beginning and 82.9MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-17 03:16:54,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.98ms. Allocated memory is still 165.7MB. Free memory was 82.9MB in the beginning and 80.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:16:54,479 INFO L158 Benchmark]: Boogie Preprocessor took 74.78ms. Allocated memory is still 165.7MB. Free memory was 80.3MB in the beginning and 77.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:16:54,479 INFO L158 Benchmark]: IcfgBuilder took 801.76ms. Allocated memory was 165.7MB in the beginning and 216.0MB in the end (delta: 50.3MB). Free memory was 77.4MB in the beginning and 168.5MB in the end (delta: -91.1MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2024-11-17 03:16:54,479 INFO L158 Benchmark]: TraceAbstraction took 4838.47ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 167.4MB in the beginning and 126.7MB in the end (delta: 40.8MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. [2024-11-17 03:16:54,480 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 260.0MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:16:54,481 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.19ms. Allocated memory is still 165.7MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.72ms. Allocated memory is still 165.7MB. Free memory was 108.8MB in the beginning and 82.9MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.98ms. Allocated memory is still 165.7MB. Free memory was 82.9MB in the beginning and 80.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.78ms. Allocated memory is still 165.7MB. Free memory was 80.3MB in the beginning and 77.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 801.76ms. Allocated memory was 165.7MB in the beginning and 216.0MB in the end (delta: 50.3MB). Free memory was 77.4MB in the beginning and 168.5MB in the end (delta: -91.1MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4838.47ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 167.4MB in the beginning and 126.7MB in the end (delta: 40.8MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 260.0MB. Free memory is still 126.7MB. 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; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L805] 0 pthread_t t1441; [L806] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L807] 0 pthread_t t1442; [L808] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 1 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L783] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L784] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L785] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L786] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L787] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L810] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L812] RET 0 assume_abort_if_not(main$tmp_guard0) [L814] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L815] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L816] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L817] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L818] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L821] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L823] 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=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 803]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 808]: 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: 806]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 715 IncrementalHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 3 mSDtfsCounter, 715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=5, InterpolantAutomatonStates: 39, 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.9s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 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-17 03:16:54,511 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/mix054_power.oepc_power.opt_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 f58f201da760ce0979516aee35f163e5c35cd587f19dc7144725dfa101235aca --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:16:56,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:16:56,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:16:56,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:16:56,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:16:56,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:16:56,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:16:56,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:16:56,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:16:56,803 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:16:56,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:16:56,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:16:56,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:16:56,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:16:56,808 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:16:56,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:16:56,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:16:56,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:16:56,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:16:56,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:16:56,812 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:16:56,812 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:16:56,812 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:16:56,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:16:56,813 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:16:56,813 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:16:56,813 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:16:56,814 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:16:56,815 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:16:56,815 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:16:56,816 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:16:56,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:16:56,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:16:56,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:16:56,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:16:56,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:16:56,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:16:56,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:16:56,818 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:16:56,818 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:16:56,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:16:56,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:16:56,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:16:56,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:16:56,820 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 -> f58f201da760ce0979516aee35f163e5c35cd587f19dc7144725dfa101235aca [2024-11-17 03:16:57,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:16:57,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:16:57,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:16:57,163 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:16:57,164 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:16:57,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-11-17 03:16:58,706 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:16:58,997 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:16:58,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-11-17 03:16:59,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c980c53/08c8c939998242a98ef1f881416385ff/FLAGff65ef649 [2024-11-17 03:16:59,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c980c53/08c8c939998242a98ef1f881416385ff [2024-11-17 03:16:59,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:16:59,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:16:59,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:16:59,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:16:59,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:16:59,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:16:59,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5292792b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59, skipping insertion in model container [2024-11-17 03:16:59,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:16:59,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:16:59,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:16:59,794 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:16:59,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:16:59,909 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:16:59,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59 WrapperNode [2024-11-17 03:16:59,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:16:59,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:16:59,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:16:59,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:16:59,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:16:59,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:16:59,973 INFO L138 Inliner]: procedures = 175, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 108 [2024-11-17 03:16:59,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:16:59,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:16:59,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:16:59,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:16:59,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:16:59,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:16:59,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:17:00,024 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-17 03:17:00,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:17:00,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:17:00,033 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:17:00,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:17:00,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:17:00,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:17:00,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:17:00,040 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:17:00,040 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:17:00,040 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:17:00,041 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59" (1/1) ... [2024-11-17 03:17:00,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:17:00,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:17:00,079 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-17 03:17:00,082 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-17 03:17:00,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:17:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:17:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:17:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:17:00,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:17:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:17:00,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:17:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:17:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:17:00,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:17:00,121 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:17:00,271 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:17:00,273 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:17:00,574 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:17:00,574 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:17:00,819 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:17:00,819 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:17:00,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:17:00 BoogieIcfgContainer [2024-11-17 03:17:00,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:17:00,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:17:00,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:17:00,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:17:00,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:16:59" (1/3) ... [2024-11-17 03:17:00,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728c05c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:17:00, skipping insertion in model container [2024-11-17 03:17:00,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:59" (2/3) ... [2024-11-17 03:17:00,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728c05c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:17:00, skipping insertion in model container [2024-11-17 03:17:00,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:17:00" (3/3) ... [2024-11-17 03:17:00,831 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-11-17 03:17:00,848 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:17:00,849 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:17:00,849 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:17:00,902 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:17:00,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2024-11-17 03:17:00,967 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-17 03:17:00,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:17:00,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 2/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-11-17 03:17:00,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2024-11-17 03:17:00,976 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2024-11-17 03:17:00,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:17:00,998 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;@47613813, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:17:00,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 03:17:01,004 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:17:01,004 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-17 03:17:01,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:17:01,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:17:01,017 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-17 03:17:01,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:17:01,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:17:01,023 INFO L85 PathProgramCache]: Analyzing trace with hash 10191972, now seen corresponding path program 1 times [2024-11-17 03:17:01,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:17:01,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192789729] [2024-11-17 03:17:01,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:17:01,034 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-17 03:17:01,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:17:01,038 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-17 03:17:01,039 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-17 03:17:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:17:01,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:17:01,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:17:01,171 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-17 03:17:01,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:17:01,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:17:01,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192789729] [2024-11-17 03:17:01,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192789729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:17:01,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:17:01,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:17:01,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856413561] [2024-11-17 03:17:01,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:17:01,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:17:01,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:17:01,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:17:01,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:17:01,217 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-11-17 03:17:01,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-17 03:17:01,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:17:01,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-11-17 03:17:01,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:17:01,522 INFO L124 PetriNetUnfolderBase]: 575/974 cut-off events. [2024-11-17 03:17:01,522 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-17 03:17:01,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 974 events. 575/974 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4714 event pairs, 45 based on Foata normal form. 72/1045 useless extension candidates. Maximal degree in co-relation 1930. Up to 841 conditions per place. [2024-11-17 03:17:01,531 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 35 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2024-11-17 03:17:01,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 177 flow [2024-11-17 03:17:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:17:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:17:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-11-17 03:17:01,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2024-11-17 03:17:01,543 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 68 transitions. [2024-11-17 03:17:01,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 177 flow [2024-11-17 03:17:01,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:17:01,547 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2024-11-17 03:17:01,549 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-11-17 03:17:01,553 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2024-11-17 03:17:01,554 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2024-11-17 03:17:01,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-17 03:17:01,554 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:17:01,554 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:17:01,559 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-17 03:17:01,754 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-17 03:17:01,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:17:01,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:17:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash -31790636, now seen corresponding path program 1 times [2024-11-17 03:17:01,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:17:01,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421507310] [2024-11-17 03:17:01,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:17:01,757 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-17 03:17:01,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:17:01,759 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-17 03:17:01,760 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-17 03:17:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:17:01,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:17:01,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:17:01,895 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-17 03:17:01,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:17:01,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:17:01,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421507310] [2024-11-17 03:17:01,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421507310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:17:01,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:17:01,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:17:01,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098995498] [2024-11-17 03:17:01,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:17:01,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:17:01,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:17:01,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:17:01,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:17:01,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-11-17 03:17:01,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-17 03:17:01,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:17:01,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-11-17 03:17:01,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:17:02,118 INFO L124 PetriNetUnfolderBase]: 331/675 cut-off events. [2024-11-17 03:17:02,118 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-17 03:17:02,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1319 conditions, 675 events. 331/675 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3171 event pairs, 69 based on Foata normal form. 36/710 useless extension candidates. Maximal degree in co-relation 1309. Up to 337 conditions per place. [2024-11-17 03:17:02,125 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 39 selfloop transitions, 4 changer transitions 1/50 dead transitions. [2024-11-17 03:17:02,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 50 transitions, 202 flow [2024-11-17 03:17:02,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:17:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:17:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2024-11-17 03:17:02,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-11-17 03:17:02,127 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 4 states and 78 transitions. [2024-11-17 03:17:02,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 50 transitions, 202 flow [2024-11-17 03:17:02,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 50 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:17:02,129 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 86 flow [2024-11-17 03:17:02,129 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-17 03:17:02,130 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2024-11-17 03:17:02,130 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 86 flow [2024-11-17 03:17:02,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-17 03:17:02,131 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:17:02,131 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:17:02,136 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-17 03:17:02,334 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-17 03:17:02,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:17:02,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:17:02,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1982641622, now seen corresponding path program 1 times [2024-11-17 03:17:02,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:17:02,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73930114] [2024-11-17 03:17:02,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:17:02,336 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-17 03:17:02,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:17:02,338 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-17 03:17:02,339 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-17 03:17:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:17:02,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:17:02,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:17:02,468 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-17 03:17:02,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:17:02,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:17:02,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73930114] [2024-11-17 03:17:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73930114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:17:02,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:17:02,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:17:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352277960] [2024-11-17 03:17:02,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:17:02,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:17:02,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:17:02,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:17:02,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:17:02,471 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-11-17 03:17:02,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-17 03:17:02,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:17:02,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-11-17 03:17:02,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:17:02,601 INFO L124 PetriNetUnfolderBase]: 147/299 cut-off events. [2024-11-17 03:17:02,602 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-11-17 03:17:02,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 299 events. 147/299 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 984 event pairs, 47 based on Foata normal form. 20/318 useless extension candidates. Maximal degree in co-relation 683. Up to 116 conditions per place. [2024-11-17 03:17:02,604 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 32 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2024-11-17 03:17:02,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 199 flow [2024-11-17 03:17:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:17:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:17:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-11-17 03:17:02,607 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2024-11-17 03:17:02,607 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 86 flow. Second operand 5 states and 81 transitions. [2024-11-17 03:17:02,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 199 flow [2024-11-17 03:17:02,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 190 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-17 03:17:02,611 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 102 flow [2024-11-17 03:17:02,611 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2024-11-17 03:17:02,612 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2024-11-17 03:17:02,613 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 102 flow [2024-11-17 03:17:02,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-17 03:17:02,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:17:02,613 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:17:02,618 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-17 03:17:02,817 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-17 03:17:02,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:17:02,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:17:02,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1051989063, now seen corresponding path program 1 times [2024-11-17 03:17:02,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:17:02,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65648508] [2024-11-17 03:17:02,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:17:02,819 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-17 03:17:02,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:17:02,820 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-17 03:17:02,821 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-17 03:17:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:17:02,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:17:02,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:17:02,949 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-17 03:17:02,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:17:02,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:17:02,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65648508] [2024-11-17 03:17:02,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65648508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:17:02,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:17:02,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:17:02,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690668479] [2024-11-17 03:17:02,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:17:02,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:17:02,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:17:02,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:17:02,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:17:02,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2024-11-17 03:17:02,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-17 03:17:02,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:17:02,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2024-11-17 03:17:02,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:17:03,026 INFO L124 PetriNetUnfolderBase]: 123/251 cut-off events. [2024-11-17 03:17:03,026 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-11-17 03:17:03,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 251 events. 123/251 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 762 event pairs, 119 based on Foata normal form. 4/254 useless extension candidates. Maximal degree in co-relation 593. Up to 236 conditions per place. [2024-11-17 03:17:03,028 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 22 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2024-11-17 03:17:03,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 148 flow [2024-11-17 03:17:03,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:17:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:17:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2024-11-17 03:17:03,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2024-11-17 03:17:03,031 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 102 flow. Second operand 3 states and 44 transitions. [2024-11-17 03:17:03,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 148 flow [2024-11-17 03:17:03,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 120 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-17 03:17:03,033 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 72 flow [2024-11-17 03:17:03,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=72, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2024-11-17 03:17:03,034 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2024-11-17 03:17:03,035 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 72 flow [2024-11-17 03:17:03,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-17 03:17:03,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:17:03,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:17:03,040 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-17 03:17:03,235 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-17 03:17:03,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:17:03,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:17:03,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1639733877, now seen corresponding path program 1 times [2024-11-17 03:17:03,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:17:03,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974902879] [2024-11-17 03:17:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:17:03,238 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-17 03:17:03,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:17:03,239 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-17 03:17:03,240 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-17 03:17:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:17:03,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:17:03,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:17:03,374 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-17 03:17:03,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:17:03,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:17:03,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974902879] [2024-11-17 03:17:03,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974902879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:17:03,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:17:03,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:17:03,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054321421] [2024-11-17 03:17:03,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:17:03,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:17:03,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:17:03,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:17:03,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:17:03,384 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-11-17 03:17:03,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-17 03:17:03,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:17:03,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-11-17 03:17:03,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:17:03,587 INFO L124 PetriNetUnfolderBase]: 181/369 cut-off events. [2024-11-17 03:17:03,588 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-17 03:17:03,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 369 events. 181/369 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1353 event pairs, 71 based on Foata normal form. 4/372 useless extension candidates. Maximal degree in co-relation 775. Up to 191 conditions per place. [2024-11-17 03:17:03,589 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 27 selfloop transitions, 2 changer transitions 16/50 dead transitions. [2024-11-17 03:17:03,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 217 flow [2024-11-17 03:17:03,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:17:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:17:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-11-17 03:17:03,592 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4685714285714286 [2024-11-17 03:17:03,592 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 72 flow. Second operand 5 states and 82 transitions. [2024-11-17 03:17:03,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 217 flow [2024-11-17 03:17:03,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:17:03,595 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 83 flow [2024-11-17 03:17:03,595 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2024-11-17 03:17:03,596 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2024-11-17 03:17:03,597 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 83 flow [2024-11-17 03:17:03,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-17 03:17:03,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:17:03,598 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:17:03,603 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 (6)] Forceful destruction successful, exit code 0 [2024-11-17 03:17:03,798 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-17 03:17:03,799 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:17:03,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:17:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1300905939, now seen corresponding path program 2 times [2024-11-17 03:17:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:17:03,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109265375] [2024-11-17 03:17:03,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:17:03,800 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-17 03:17:03,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:17:03,803 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-17 03:17:03,804 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-17 03:17:03,877 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:17:03,878 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:17:03,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 03:17:03,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:17:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:17:04,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:17:04,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:17:04,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109265375] [2024-11-17 03:17:04,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109265375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:17:04,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:17:04,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:17:04,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122482177] [2024-11-17 03:17:04,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:17:04,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:17:04,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:17:04,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:17:04,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:17:04,107 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-11-17 03:17:04,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 83 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-17 03:17:04,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:17:04,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-11-17 03:17:04,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:17:04,350 INFO L124 PetriNetUnfolderBase]: 131/282 cut-off events. [2024-11-17 03:17:04,351 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-17 03:17:04,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 282 events. 131/282 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 930 event pairs, 16 based on Foata normal form. 4/285 useless extension candidates. Maximal degree in co-relation 634. Up to 106 conditions per place. [2024-11-17 03:17:04,352 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 28 selfloop transitions, 4 changer transitions 23/60 dead transitions. [2024-11-17 03:17:04,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 279 flow [2024-11-17 03:17:04,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:17:04,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:17:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-11-17 03:17:04,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39365079365079364 [2024-11-17 03:17:04,354 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 83 flow. Second operand 9 states and 124 transitions. [2024-11-17 03:17:04,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 279 flow [2024-11-17 03:17:04,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 263 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-17 03:17:04,356 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 91 flow [2024-11-17 03:17:04,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=91, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2024-11-17 03:17:04,357 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2024-11-17 03:17:04,357 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 91 flow [2024-11-17 03:17:04,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-17 03:17:04,357 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:17:04,358 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:17:04,363 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-17 03:17:04,558 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-17 03:17:04,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:17:04,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:17:04,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1604204843, now seen corresponding path program 3 times [2024-11-17 03:17:04,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:17:04,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924421124] [2024-11-17 03:17:04,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:17:04,560 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-17 03:17:04,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:17:04,561 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-17 03:17:04,562 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-17 03:17:04,642 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-17 03:17:04,643 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-17 03:17:04,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:17:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:17:04,753 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 03:17:04,753 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:17:04,754 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-17 03:17:04,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-17 03:17:04,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-17 03:17:04,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-17 03:17:04,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-17 03:17:04,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-17 03:17:04,762 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 (8)] Ended with exit code 0 [2024-11-17 03:17:04,957 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-17 03:17:04,958 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-17 03:17:05,023 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:17:05,023 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:17:05,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:17:05 BasicIcfg [2024-11-17 03:17:05,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:17:05,032 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:17:05,032 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:17:05,032 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:17:05,033 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:17:00" (3/4) ... [2024-11-17 03:17:05,034 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:17:05,036 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:17:05,037 INFO L158 Benchmark]: Toolchain (without parser) took 5744.29ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 41.9MB in the beginning and 42.1MB in the end (delta: -199.3kB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-11-17 03:17:05,037 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 56.6MB. Free memory was 28.2MB in the beginning and 28.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:17:05,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.71ms. Allocated memory is still 73.4MB. Free memory was 41.7MB in the beginning and 35.5MB in the end (delta: 6.2MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-11-17 03:17:05,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.78ms. Allocated memory is still 73.4MB. Free memory was 35.2MB in the beginning and 32.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:17:05,039 INFO L158 Benchmark]: Boogie Preprocessor took 62.24ms. Allocated memory is still 73.4MB. Free memory was 32.9MB in the beginning and 51.2MB in the end (delta: -18.3MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-11-17 03:17:05,039 INFO L158 Benchmark]: IcfgBuilder took 780.78ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 51.2MB in the beginning and 53.0MB in the end (delta: -1.8MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-17 03:17:05,040 INFO L158 Benchmark]: TraceAbstraction took 4209.13ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 52.4MB in the beginning and 42.1MB in the end (delta: 10.4MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2024-11-17 03:17:05,041 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 107.0MB. Free memory is still 42.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:17:05,043 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.09ms. Allocated memory is still 56.6MB. Free memory was 28.2MB in the beginning and 28.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 617.71ms. Allocated memory is still 73.4MB. Free memory was 41.7MB in the beginning and 35.5MB in the end (delta: 6.2MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.78ms. Allocated memory is still 73.4MB. Free memory was 35.2MB in the beginning and 32.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.24ms. Allocated memory is still 73.4MB. Free memory was 32.9MB in the beginning and 51.2MB in the end (delta: -18.3MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * IcfgBuilder took 780.78ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 51.2MB in the beginning and 53.0MB in the end (delta: -1.8MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4209.13ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 52.4MB in the beginning and 42.1MB in the end (delta: 10.4MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 107.0MB. Free memory is still 42.1MB. 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; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L805] 0 pthread_t t1441; [L806] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L807] 0 pthread_t t1442; [L808] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=0, t1442=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 1 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L783] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L784] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L785] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L786] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L787] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L810] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=0, t1442=1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L812] RET 0 assume_abort_if_not(main$tmp_guard0) [L814] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L815] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L816] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L817] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L818] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=0, t1442=1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L821] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=0, t1442=1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L823] 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=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 803]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 808]: 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: 806]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 570 IncrementalHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 4 mSDtfsCounter, 570 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred 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, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 349 SizeOfPredicates, 8 NumberOfNonLiveVariables, 520 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-17 03:17:05,078 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