./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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-deagle/arithmetic_prog_bad.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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:24:31,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:24:31,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 18:24:31,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:24:31,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:24:31,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:24:31,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:24:31,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:24:31,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:24:31,385 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:24:31,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:24:31,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:24:31,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:24:31,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:24:31,389 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:24:31,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:24:31,389 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:24:31,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:24:31,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:24:31,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:24:31,390 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:24:31,394 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:24:31,395 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:24:31,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:24:31,395 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:24:31,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:24:31,395 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:24:31,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:24:31,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:24:31,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:24:31,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:24:31,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:24:31,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:24:31,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:24:31,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:24:31,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:24:31,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:24:31,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:24:31,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:24:31,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:24:31,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:24:31,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:24:31,401 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2024-11-10 18:24:31,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:24:31,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:24:31,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:24:31,692 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:24:31,693 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:24:31,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-10 18:24:33,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:24:33,464 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:24:33,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-10 18:24:33,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb00c7c6c/708c9377d0474b3286581e687c9e939b/FLAG366d3d824 [2024-11-10 18:24:33,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb00c7c6c/708c9377d0474b3286581e687c9e939b [2024-11-10 18:24:33,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:24:33,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:24:33,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:24:33,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:24:33,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:24:33,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:24:33" (1/1) ... [2024-11-10 18:24:33,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9c46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:33, skipping insertion in model container [2024-11-10 18:24:33,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:24:33" (1/1) ... [2024-11-10 18:24:33,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:24:34,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:24:34,092 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:24:34,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:24:34,223 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:24:34,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34 WrapperNode [2024-11-10 18:24:34,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:24:34,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:24:34,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:24:34,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:24:34,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34" (1/1) ... [2024-11-10 18:24:34,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34" (1/1) ... [2024-11-10 18:24:34,302 INFO L138 Inliner]: procedures = 243, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 262 [2024-11-10 18:24:34,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:24:34,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:24:34,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:24:34,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:24:34,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34" (1/1) ... [2024-11-10 18:24:34,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34" (1/1) ... [2024-11-10 18:24:34,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34" (1/1) ... [2024-11-10 18:24:34,362 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2024-11-10 18:24:34,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34" (1/1) ... [2024-11-10 18:24:34,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34" (1/1) ... [2024-11-10 18:24:34,379 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34" (1/1) ... [2024-11-10 18:24:34,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34" (1/1) ... [2024-11-10 18:24:34,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34" (1/1) ... [2024-11-10 18:24:34,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34" (1/1) ... [2024-11-10 18:24:34,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:24:34,400 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:24:34,404 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:24:34,404 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:24:34,405 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34" (1/1) ... [2024-11-10 18:24:34,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:24:34,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:24:34,498 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-10 18:24:34,514 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-10 18:24:34,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 18:24:34,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 18:24:34,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 18:24:34,556 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 18:24:34,556 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 18:24:34,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 18:24:34,556 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 18:24:34,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 18:24:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 18:24:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:24:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:24:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 18:24:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 18:24:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:24:34,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:24:34,559 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:24:34,715 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:24:34,718 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:24:35,043 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:24:35,044 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:24:35,793 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:24:35,793 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:24:35,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:24:35 BoogieIcfgContainer [2024-11-10 18:24:35,794 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:24:35,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:24:35,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:24:35,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:24:35,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:24:33" (1/3) ... [2024-11-10 18:24:35,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758bcbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:24:35, skipping insertion in model container [2024-11-10 18:24:35,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:34" (2/3) ... [2024-11-10 18:24:35,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758bcbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:24:35, skipping insertion in model container [2024-11-10 18:24:35,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:24:35" (3/3) ... [2024-11-10 18:24:35,806 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-11-10 18:24:35,824 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:24:35,825 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 18:24:35,825 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:24:35,891 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 18:24:35,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 55 transitions, 124 flow [2024-11-10 18:24:36,012 INFO L124 PetriNetUnfolderBase]: 11/53 cut-off events. [2024-11-10 18:24:36,013 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:24:36,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 11/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 39. Up to 3 conditions per place. [2024-11-10 18:24:36,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 55 transitions, 124 flow [2024-11-10 18:24:36,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 52 transitions, 116 flow [2024-11-10 18:24:36,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:24:36,044 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;@22c9bff3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:24:36,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 18:24:36,078 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:24:36,080 INFO L124 PetriNetUnfolderBase]: 11/50 cut-off events. [2024-11-10 18:24:36,080 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:24:36,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:36,081 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:24:36,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:36,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:36,087 INFO L85 PathProgramCache]: Analyzing trace with hash -642884102, now seen corresponding path program 1 times [2024-11-10 18:24:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:24:36,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135220955] [2024-11-10 18:24:36,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:24:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:36,851 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-10 18:24:36,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:24:36,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135220955] [2024-11-10 18:24:36,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135220955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:24:36,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:24:36,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:24:36,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874008660] [2024-11-10 18:24:36,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:24:36,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:24:36,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:24:36,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:24:36,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:24:36,898 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-10 18:24:36,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 52 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-10 18:24:36,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:36,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-10 18:24:36,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:24:37,091 INFO L124 PetriNetUnfolderBase]: 251/547 cut-off events. [2024-11-10 18:24:37,093 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-10 18:24:37,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 547 events. 251/547 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2761 event pairs, 159 based on Foata normal form. 88/547 useless extension candidates. Maximal degree in co-relation 900. Up to 393 conditions per place. [2024-11-10 18:24:37,102 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 25 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2024-11-10 18:24:37,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 152 flow [2024-11-10 18:24:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:24:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:24:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2024-11-10 18:24:37,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2024-11-10 18:24:37,115 INFO L175 Difference]: Start difference. First operand has 48 places, 52 transitions, 116 flow. Second operand 2 states and 75 transitions. [2024-11-10 18:24:37,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 152 flow [2024-11-10 18:24:37,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 144 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:24:37,120 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 94 flow [2024-11-10 18:24:37,122 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2024-11-10 18:24:37,126 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2024-11-10 18:24:37,127 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 94 flow [2024-11-10 18:24:37,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-10 18:24:37,127 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:37,128 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-10 18:24:37,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:24:37,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:37,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:37,130 INFO L85 PathProgramCache]: Analyzing trace with hash -333697957, now seen corresponding path program 1 times [2024-11-10 18:24:37,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:24:37,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544181424] [2024-11-10 18:24:37,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:37,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:24:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:37,577 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-10 18:24:37,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:24:37,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544181424] [2024-11-10 18:24:37,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544181424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:24:37,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:24:37,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:24:37,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156546932] [2024-11-10 18:24:37,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:24:37,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:24:37,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:24:37,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:24:37,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:24:37,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-10 18:24:37,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10 18:24:37,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:37,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-10 18:24:37,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:24:37,810 INFO L124 PetriNetUnfolderBase]: 455/1000 cut-off events. [2024-11-10 18:24:37,810 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 18:24:37,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 1000 events. 455/1000 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5604 event pairs, 190 based on Foata normal form. 18/889 useless extension candidates. Maximal degree in co-relation 1720. Up to 442 conditions per place. [2024-11-10 18:24:37,826 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 41 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-11-10 18:24:37,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 215 flow [2024-11-10 18:24:37,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:24:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:24:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-10 18:24:37,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-11-10 18:24:37,832 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 94 flow. Second operand 3 states and 107 transitions. [2024-11-10 18:24:37,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 215 flow [2024-11-10 18:24:37,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:24:37,837 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 106 flow [2024-11-10 18:24:37,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2024-11-10 18:24:37,842 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-11-10 18:24:37,842 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 106 flow [2024-11-10 18:24:37,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10 18:24:37,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:37,842 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:24:37,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:24:37,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:37,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:37,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1875641236, now seen corresponding path program 1 times [2024-11-10 18:24:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:24:37,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963514904] [2024-11-10 18:24:37,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:24:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:24:38,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:24:38,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963514904] [2024-11-10 18:24:38,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963514904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:24:38,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180880158] [2024-11-10 18:24:38,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:38,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:24:38,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:24:38,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:24:38,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 18:24:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:38,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:24:38,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:24:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:24:38,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:24:38,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180880158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:24:38,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:24:38,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-11-10 18:24:38,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756597059] [2024-11-10 18:24:38,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:24:38,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:24:38,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:24:38,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:24:38,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:24:38,974 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-10 18:24:38,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:24:38,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:38,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-10 18:24:38,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:24:39,112 INFO L124 PetriNetUnfolderBase]: 439/955 cut-off events. [2024-11-10 18:24:39,112 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-11-10 18:24:39,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 955 events. 439/955 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5368 event pairs, 286 based on Foata normal form. 1/827 useless extension candidates. Maximal degree in co-relation 1730. Up to 677 conditions per place. [2024-11-10 18:24:39,119 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 24 selfloop transitions, 1 changer transitions 3/45 dead transitions. [2024-11-10 18:24:39,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 156 flow [2024-11-10 18:24:39,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:24:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:24:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-10 18:24:39,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2024-11-10 18:24:39,121 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 106 flow. Second operand 3 states and 89 transitions. [2024-11-10 18:24:39,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 156 flow [2024-11-10 18:24:39,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:24:39,124 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 98 flow [2024-11-10 18:24:39,124 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-11-10 18:24:39,124 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-11-10 18:24:39,125 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 98 flow [2024-11-10 18:24:39,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:24:39,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:39,125 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:24:39,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:24:39,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:24:39,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:39,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:39,328 INFO L85 PathProgramCache]: Analyzing trace with hash -558150719, now seen corresponding path program 1 times [2024-11-10 18:24:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:24:39,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654842250] [2024-11-10 18:24:39,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:24:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:24:39,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:24:39,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654842250] [2024-11-10 18:24:39,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654842250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:24:39,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:24:39,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:24:39,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267789224] [2024-11-10 18:24:39,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:24:39,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:24:39,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:24:39,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:24:39,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:24:39,676 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-10 18:24:39,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:24:39,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:39,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-10 18:24:39,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:24:39,934 INFO L124 PetriNetUnfolderBase]: 778/1665 cut-off events. [2024-11-10 18:24:39,935 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-10 18:24:39,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2979 conditions, 1665 events. 778/1665 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9975 event pairs, 333 based on Foata normal form. 29/1520 useless extension candidates. Maximal degree in co-relation 2974. Up to 757 conditions per place. [2024-11-10 18:24:39,945 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 41 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2024-11-10 18:24:39,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 225 flow [2024-11-10 18:24:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:24:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:24:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-11-10 18:24:39,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-10 18:24:39,948 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 98 flow. Second operand 3 states and 105 transitions. [2024-11-10 18:24:39,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 225 flow [2024-11-10 18:24:39,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:24:39,950 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 109 flow [2024-11-10 18:24:39,950 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2024-11-10 18:24:39,951 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-11-10 18:24:39,952 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 109 flow [2024-11-10 18:24:39,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:24:39,953 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:39,953 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:24:39,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:24:39,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:39,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:39,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1727017145, now seen corresponding path program 1 times [2024-11-10 18:24:39,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:24:39,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017971292] [2024-11-10 18:24:39,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:39,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:24:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:24:40,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:24:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017971292] [2024-11-10 18:24:40,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017971292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:24:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317389538] [2024-11-10 18:24:40,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:40,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:24:40,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:24:40,404 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:24:40,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 18:24:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:40,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:24:40,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:24:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:24:40,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:24:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:24:40,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317389538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:24:40,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:24:40,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-10 18:24:40,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285089026] [2024-11-10 18:24:40,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:24:40,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:24:40,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:24:40,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:24:40,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:24:40,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2024-11-10 18:24:40,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-10 18:24:40,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:40,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2024-11-10 18:24:40,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:24:41,244 INFO L124 PetriNetUnfolderBase]: 1230/2456 cut-off events. [2024-11-10 18:24:41,244 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2024-11-10 18:24:41,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4685 conditions, 2456 events. 1230/2456 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 14406 event pairs, 160 based on Foata normal form. 58/2355 useless extension candidates. Maximal degree in co-relation 4679. Up to 536 conditions per place. [2024-11-10 18:24:41,260 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2024-11-10 18:24:41,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 90 transitions, 376 flow [2024-11-10 18:24:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:24:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:24:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2024-11-10 18:24:41,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6290909090909091 [2024-11-10 18:24:41,267 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 109 flow. Second operand 5 states and 173 transitions. [2024-11-10 18:24:41,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 90 transitions, 376 flow [2024-11-10 18:24:41,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:24:41,272 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 137 flow [2024-11-10 18:24:41,273 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-11-10 18:24:41,274 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2024-11-10 18:24:41,275 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 137 flow [2024-11-10 18:24:41,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-10 18:24:41,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:41,276 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:24:41,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 18:24:41,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:24:41,477 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:41,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:41,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1085866023, now seen corresponding path program 2 times [2024-11-10 18:24:41,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:24:41,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786532689] [2024-11-10 18:24:41,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:41,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:24:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-10 18:24:41,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:24:41,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786532689] [2024-11-10 18:24:41,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786532689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:24:41,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:24:41,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:24:41,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945241440] [2024-11-10 18:24:41,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:24:41,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:24:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:24:41,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:24:41,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:24:41,847 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-10 18:24:41,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-10 18:24:41,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:41,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-10 18:24:41,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:24:42,031 INFO L124 PetriNetUnfolderBase]: 618/1602 cut-off events. [2024-11-10 18:24:42,032 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2024-11-10 18:24:42,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3175 conditions, 1602 events. 618/1602 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9041 event pairs, 274 based on Foata normal form. 96/1582 useless extension candidates. Maximal degree in co-relation 3167. Up to 524 conditions per place. [2024-11-10 18:24:42,044 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 32 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2024-11-10 18:24:42,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 273 flow [2024-11-10 18:24:42,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:24:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:24:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-10 18:24:42,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-11-10 18:24:42,046 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 137 flow. Second operand 3 states and 104 transitions. [2024-11-10 18:24:42,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 273 flow [2024-11-10 18:24:42,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 261 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-10 18:24:42,050 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 147 flow [2024-11-10 18:24:42,050 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-11-10 18:24:42,051 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2024-11-10 18:24:42,051 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 147 flow [2024-11-10 18:24:42,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-10 18:24:42,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:42,051 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:24:42,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:24:42,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:42,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1704348957, now seen corresponding path program 3 times [2024-11-10 18:24:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:24:42,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901140168] [2024-11-10 18:24:42,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:42,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:24:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 18:24:42,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:24:42,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901140168] [2024-11-10 18:24:42,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901140168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:24:42,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237419971] [2024-11-10 18:24:42,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:24:42,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:24:42,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:24:42,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:24:42,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 18:24:43,019 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 18:24:43,019 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:24:43,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:24:43,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:24:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 18:24:43,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:24:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 18:24:43,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237419971] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:24:43,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:24:43,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-10 18:24:43,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526342802] [2024-11-10 18:24:43,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:24:43,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:24:43,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:24:43,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:24:43,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:24:43,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2024-11-10 18:24:43,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 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-10 18:24:43,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:43,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2024-11-10 18:24:43,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:24:43,493 INFO L124 PetriNetUnfolderBase]: 1233/2920 cut-off events. [2024-11-10 18:24:43,494 INFO L125 PetriNetUnfolderBase]: For 1167/1171 co-relation queries the response was YES. [2024-11-10 18:24:43,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6430 conditions, 2920 events. 1233/2920 cut-off events. For 1167/1171 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 18102 event pairs, 244 based on Foata normal form. 88/2753 useless extension candidates. Maximal degree in co-relation 6421. Up to 569 conditions per place. [2024-11-10 18:24:43,517 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 77 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2024-11-10 18:24:43,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 98 transitions, 510 flow [2024-11-10 18:24:43,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:24:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:24:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2024-11-10 18:24:43,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-11-10 18:24:43,519 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 147 flow. Second operand 5 states and 176 transitions. [2024-11-10 18:24:43,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 98 transitions, 510 flow [2024-11-10 18:24:43,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 98 transitions, 482 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:24:43,527 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 169 flow [2024-11-10 18:24:43,527 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-11-10 18:24:43,528 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 12 predicate places. [2024-11-10 18:24:43,528 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 169 flow [2024-11-10 18:24:43,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 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-10 18:24:43,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:43,529 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:24:43,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 18:24:43,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:24:43,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:43,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:43,730 INFO L85 PathProgramCache]: Analyzing trace with hash -4843427, now seen corresponding path program 4 times [2024-11-10 18:24:43,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:24:43,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002443462] [2024-11-10 18:24:43,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:43,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:24:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 18:24:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:24:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002443462] [2024-11-10 18:24:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002443462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:24:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865308938] [2024-11-10 18:24:44,139 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 18:24:44,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:24:44,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:24:44,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:24:44,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 18:24:44,597 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 18:24:44,598 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:24:44,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:24:44,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:24:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 18:24:44,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:24:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 18:24:44,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865308938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:24:44,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:24:44,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2024-11-10 18:24:44,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203100758] [2024-11-10 18:24:44,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:24:44,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:24:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:24:44,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:24:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:24:44,713 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2024-11-10 18:24:44,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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-10 18:24:44,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:44,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2024-11-10 18:24:44,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:24:44,911 INFO L124 PetriNetUnfolderBase]: 493/1273 cut-off events. [2024-11-10 18:24:44,911 INFO L125 PetriNetUnfolderBase]: For 863/871 co-relation queries the response was YES. [2024-11-10 18:24:44,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1273 events. 493/1273 cut-off events. For 863/871 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5915 event pairs, 156 based on Foata normal form. 0/1251 useless extension candidates. Maximal degree in co-relation 2932. Up to 475 conditions per place. [2024-11-10 18:24:44,919 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 48 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-11-10 18:24:44,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 349 flow [2024-11-10 18:24:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:24:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:24:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-11-10 18:24:44,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5409090909090909 [2024-11-10 18:24:44,921 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 169 flow. Second operand 4 states and 119 transitions. [2024-11-10 18:24:44,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 349 flow [2024-11-10 18:24:44,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 66 transitions, 338 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-10 18:24:44,925 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 182 flow [2024-11-10 18:24:44,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-11-10 18:24:44,926 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2024-11-10 18:24:44,926 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 182 flow [2024-11-10 18:24:44,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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-10 18:24:44,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:44,927 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:24:44,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 18:24:45,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:24:45,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:45,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:45,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2114007357, now seen corresponding path program 5 times [2024-11-10 18:24:45,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:24:45,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386393853] [2024-11-10 18:24:45,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:45,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:24:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:24:45,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:24:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:24:45,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:24:45,465 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:24:45,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-10 18:24:45,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-10 18:24:45,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-10 18:24:45,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-10 18:24:45,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:24:45,470 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2024-11-10 18:24:45,583 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:24:45,583 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:24:45,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:24:45 BasicIcfg [2024-11-10 18:24:45,592 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:24:45,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:24:45,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:24:45,593 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:24:45,593 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:24:35" (3/4) ... [2024-11-10 18:24:45,596 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:24:45,597 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:24:45,598 INFO L158 Benchmark]: Toolchain (without parser) took 12090.31ms. Allocated memory was 176.2MB in the beginning and 593.5MB in the end (delta: 417.3MB). Free memory was 103.5MB in the beginning and 366.4MB in the end (delta: -262.9MB). Peak memory consumption was 155.9MB. Max. memory is 16.1GB. [2024-11-10 18:24:45,599 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:24:45,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 714.67ms. Allocated memory is still 176.2MB. Free memory was 103.2MB in the beginning and 72.3MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-10 18:24:45,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.45ms. Allocated memory is still 176.2MB. Free memory was 72.3MB in the beginning and 69.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:24:45,600 INFO L158 Benchmark]: Boogie Preprocessor took 94.14ms. Allocated memory is still 176.2MB. Free memory was 69.3MB in the beginning and 65.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:24:45,600 INFO L158 Benchmark]: IcfgBuilder took 1394.06ms. Allocated memory is still 176.2MB. Free memory was 65.5MB in the beginning and 69.2MB in the end (delta: -3.6MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2024-11-10 18:24:45,600 INFO L158 Benchmark]: TraceAbstraction took 9795.21ms. Allocated memory was 176.2MB in the beginning and 593.5MB in the end (delta: 417.3MB). Free memory was 69.2MB in the beginning and 367.5MB in the end (delta: -298.3MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. [2024-11-10 18:24:45,601 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 593.5MB. Free memory was 367.5MB in the beginning and 366.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:24:45,602 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.18ms. Allocated memory is still 117.4MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 714.67ms. Allocated memory is still 176.2MB. Free memory was 103.2MB in the beginning and 72.3MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.45ms. Allocated memory is still 176.2MB. Free memory was 72.3MB in the beginning and 69.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.14ms. Allocated memory is still 176.2MB. Free memory was 69.3MB in the beginning and 65.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1394.06ms. Allocated memory is still 176.2MB. Free memory was 65.5MB in the beginning and 69.2MB in the end (delta: -3.6MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9795.21ms. Allocated memory was 176.2MB in the beginning and 593.5MB in the end (delta: 417.3MB). Free memory was 69.2MB in the beginning and 367.5MB in the end (delta: -298.3MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 593.5MB. Free memory was 367.5MB in the beginning and 366.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=-1, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=-1, t2=0, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, t1=-1, t2=0, total=1] [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) [L919] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] [L18] 0 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] - UnprovableResult [Line: 906]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 913]: 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: 914]: 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, 75 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.5s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 516 IncrementalHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 8 mSDtfsCounter, 516 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 359 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=8, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 574 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 651 ConstructedInterpolants, 0 QuantifiedInterpolants, 1165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1732 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 324/356 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-10 18:24:45,636 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 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-deagle/arithmetic_prog_bad.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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:24:48,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:24:48,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 18:24:48,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:24:48,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:24:48,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:24:48,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:24:48,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:24:48,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:24:48,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:24:48,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:24:48,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:24:48,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:24:48,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:24:48,167 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:24:48,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:24:48,167 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:24:48,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:24:48,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:24:48,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:24:48,169 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:24:48,170 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:24:48,170 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:24:48,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:24:48,171 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:24:48,171 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:24:48,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:24:48,172 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:24:48,172 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:24:48,173 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:24:48,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:24:48,174 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:24:48,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:24:48,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:24:48,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:24:48,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:24:48,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:24:48,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:24:48,176 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:24:48,176 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:24:48,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:24:48,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:24:48,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:24:48,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:24:48,179 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2024-11-10 18:24:48,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:24:48,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:24:48,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:24:48,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:24:48,537 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:24:48,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-10 18:24:50,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:24:50,488 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:24:50,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-10 18:24:50,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83de1c2d/51ba2158b1b04da4b5ff21a70d56f7d0/FLAGc953ebf7e [2024-11-10 18:24:50,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83de1c2d/51ba2158b1b04da4b5ff21a70d56f7d0 [2024-11-10 18:24:50,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:24:50,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:24:50,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:24:50,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:24:50,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:24:50,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:24:50" (1/1) ... [2024-11-10 18:24:50,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d64313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:50, skipping insertion in model container [2024-11-10 18:24:50,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:24:50" (1/1) ... [2024-11-10 18:24:50,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:24:51,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:24:51,353 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:24:51,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:24:51,490 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:24:51,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51 WrapperNode [2024-11-10 18:24:51,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:24:51,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:24:51,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:24:51,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:24:51,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51" (1/1) ... [2024-11-10 18:24:51,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51" (1/1) ... [2024-11-10 18:24:51,572 INFO L138 Inliner]: procedures = 250, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 263 [2024-11-10 18:24:51,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:24:51,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:24:51,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:24:51,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:24:51,584 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51" (1/1) ... [2024-11-10 18:24:51,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51" (1/1) ... [2024-11-10 18:24:51,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51" (1/1) ... [2024-11-10 18:24:51,633 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2024-11-10 18:24:51,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51" (1/1) ... [2024-11-10 18:24:51,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51" (1/1) ... [2024-11-10 18:24:51,661 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51" (1/1) ... [2024-11-10 18:24:51,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51" (1/1) ... [2024-11-10 18:24:51,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51" (1/1) ... [2024-11-10 18:24:51,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51" (1/1) ... [2024-11-10 18:24:51,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:24:51,688 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:24:51,688 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:24:51,688 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:24:51,689 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51" (1/1) ... [2024-11-10 18:24:51,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:24:51,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:24:51,727 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-10 18:24:51,729 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-10 18:24:51,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 18:24:51,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 18:24:51,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 18:24:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 18:24:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 18:24:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-10 18:24:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 18:24:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 18:24:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 18:24:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 18:24:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 18:24:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-10 18:24:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 18:24:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 18:24:51,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 18:24:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 18:24:51,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 18:24:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 18:24:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:24:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:24:51,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:24:51,771 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:24:52,007 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:24:52,010 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:24:52,527 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:24:52,527 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:24:53,589 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:24:53,590 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:24:53,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:24:53 BoogieIcfgContainer [2024-11-10 18:24:53,591 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:24:53,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:24:53,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:24:53,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:24:53,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:24:50" (1/3) ... [2024-11-10 18:24:53,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4821dea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:24:53, skipping insertion in model container [2024-11-10 18:24:53,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:51" (2/3) ... [2024-11-10 18:24:53,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4821dea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:24:53, skipping insertion in model container [2024-11-10 18:24:53,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:24:53" (3/3) ... [2024-11-10 18:24:53,601 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-11-10 18:24:53,620 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:24:53,620 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 18:24:53,621 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:24:53,703 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 18:24:53,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 55 transitions, 124 flow [2024-11-10 18:24:53,800 INFO L124 PetriNetUnfolderBase]: 11/53 cut-off events. [2024-11-10 18:24:53,800 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:24:53,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 11/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 39. Up to 3 conditions per place. [2024-11-10 18:24:53,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 55 transitions, 124 flow [2024-11-10 18:24:53,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 52 transitions, 116 flow [2024-11-10 18:24:53,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:24:53,825 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;@7beccc62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:24:53,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 18:24:53,864 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:24:53,865 INFO L124 PetriNetUnfolderBase]: 11/50 cut-off events. [2024-11-10 18:24:53,865 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:24:53,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:53,866 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:24:53,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:53,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2024316922, now seen corresponding path program 1 times [2024-11-10 18:24:53,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:24:53,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144622294] [2024-11-10 18:24:53,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:53,890 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-10 18:24:53,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:24:53,893 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-10 18:24:53,894 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-10 18:24:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:54,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 18:24:54,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:24:54,623 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-10 18:24:54,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:24:54,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:24:54,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144622294] [2024-11-10 18:24:54,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144622294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:24:54,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:24:54,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:24:54,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241156221] [2024-11-10 18:24:54,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:24:54,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:24:54,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:24:54,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:24:54,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:24:54,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-10 18:24:54,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 52 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-10 18:24:54,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:54,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-10 18:24:54,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:24:54,923 INFO L124 PetriNetUnfolderBase]: 251/547 cut-off events. [2024-11-10 18:24:54,924 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-10 18:24:54,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 547 events. 251/547 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2761 event pairs, 159 based on Foata normal form. 88/547 useless extension candidates. Maximal degree in co-relation 900. Up to 393 conditions per place. [2024-11-10 18:24:54,936 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 25 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2024-11-10 18:24:54,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 152 flow [2024-11-10 18:24:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:24:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:24:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2024-11-10 18:24:54,952 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2024-11-10 18:24:54,954 INFO L175 Difference]: Start difference. First operand has 48 places, 52 transitions, 116 flow. Second operand 2 states and 75 transitions. [2024-11-10 18:24:54,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 152 flow [2024-11-10 18:24:54,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 144 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:24:54,960 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 94 flow [2024-11-10 18:24:54,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2024-11-10 18:24:54,967 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2024-11-10 18:24:54,968 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 94 flow [2024-11-10 18:24:54,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-10 18:24:54,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:54,968 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-10 18:24:54,973 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 (2)] Forceful destruction successful, exit code 0 [2024-11-10 18:24:55,169 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-10 18:24:55,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:55,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:55,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1248989541, now seen corresponding path program 1 times [2024-11-10 18:24:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:24:55,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245225040] [2024-11-10 18:24:55,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:55,172 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-10 18:24:55,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:24:55,175 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-10 18:24:55,176 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-10 18:24:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:55,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:24:55,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:24:55,739 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-10 18:24:55,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:24:55,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:24:55,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245225040] [2024-11-10 18:24:55,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245225040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:24:55,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:24:55,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:24:55,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044856416] [2024-11-10 18:24:55,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:24:55,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:24:55,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:24:55,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:24:55,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:24:55,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-10 18:24:55,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10 18:24:55,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:55,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-10 18:24:55,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:24:56,077 INFO L124 PetriNetUnfolderBase]: 477/986 cut-off events. [2024-11-10 18:24:56,078 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:24:56,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1739 conditions, 986 events. 477/986 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5151 event pairs, 201 based on Foata normal form. 16/875 useless extension candidates. Maximal degree in co-relation 1736. Up to 467 conditions per place. [2024-11-10 18:24:56,103 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 41 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-11-10 18:24:56,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 215 flow [2024-11-10 18:24:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:24:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:24:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-10 18:24:56,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-11-10 18:24:56,106 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 94 flow. Second operand 3 states and 107 transitions. [2024-11-10 18:24:56,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 215 flow [2024-11-10 18:24:56,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:24:56,111 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 106 flow [2024-11-10 18:24:56,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2024-11-10 18:24:56,112 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-11-10 18:24:56,113 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 106 flow [2024-11-10 18:24:56,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10 18:24:56,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:56,114 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:24:56,124 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 (3)] Forceful destruction successful, exit code 0 [2024-11-10 18:24:56,318 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-10 18:24:56,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:56,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:56,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1823225250, now seen corresponding path program 1 times [2024-11-10 18:24:56,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:24:56,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171047359] [2024-11-10 18:24:56,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:56,321 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-10 18:24:56,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:24:56,325 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-10 18:24:56,327 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-10 18:24:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:56,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:24:56,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:24:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:24:56,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:24:56,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:24:56,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171047359] [2024-11-10 18:24:56,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171047359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:24:56,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:24:56,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:24:56,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239364686] [2024-11-10 18:24:56,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:24:56,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:24:56,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:24:56,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:24:56,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:24:56,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-10 18:24:56,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:24:56,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:56,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-10 18:24:56,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:24:57,135 INFO L124 PetriNetUnfolderBase]: 779/1669 cut-off events. [2024-11-10 18:24:57,135 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-11-10 18:24:57,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3013 conditions, 1669 events. 779/1669 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 10036 event pairs, 333 based on Foata normal form. 29/1523 useless extension candidates. Maximal degree in co-relation 3008. Up to 758 conditions per place. [2024-11-10 18:24:57,147 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 42 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-11-10 18:24:57,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 237 flow [2024-11-10 18:24:57,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:24:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:24:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-10 18:24:57,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-10 18:24:57,150 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 106 flow. Second operand 3 states and 106 transitions. [2024-11-10 18:24:57,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 237 flow [2024-11-10 18:24:57,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:24:57,152 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 116 flow [2024-11-10 18:24:57,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2024-11-10 18:24:57,154 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2024-11-10 18:24:57,154 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 116 flow [2024-11-10 18:24:57,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:24:57,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:57,154 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:24:57,162 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-10 18:24:57,355 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-10 18:24:57,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:57,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:57,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1463168616, now seen corresponding path program 1 times [2024-11-10 18:24:57,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:24:57,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082957460] [2024-11-10 18:24:57,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:57,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:24:57,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:24:57,360 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-10 18:24:57,361 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-10 18:24:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:57,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:24:57,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:24:57,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-10 18:24:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:24:57,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:24:57,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:24:57,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082957460] [2024-11-10 18:24:57,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082957460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:24:57,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:24:57,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:24:57,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104435136] [2024-11-10 18:24:57,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:24:57,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:24:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:24:57,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:24:57,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:24:57,908 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-10 18:24:57,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-10 18:24:57,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:57,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-10 18:24:57,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:24:58,182 INFO L124 PetriNetUnfolderBase]: 428/1097 cut-off events. [2024-11-10 18:24:58,183 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-11-10 18:24:58,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2043 conditions, 1097 events. 428/1097 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6048 event pairs, 182 based on Foata normal form. 64/1076 useless extension candidates. Maximal degree in co-relation 2037. Up to 374 conditions per place. [2024-11-10 18:24:58,189 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 31 selfloop transitions, 8 changer transitions 0/59 dead transitions. [2024-11-10 18:24:58,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 234 flow [2024-11-10 18:24:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:24:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:24:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-11-10 18:24:58,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-10 18:24:58,190 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 116 flow. Second operand 3 states and 105 transitions. [2024-11-10 18:24:58,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 234 flow [2024-11-10 18:24:58,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:24:58,193 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 130 flow [2024-11-10 18:24:58,193 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-11-10 18:24:58,194 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2024-11-10 18:24:58,194 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 130 flow [2024-11-10 18:24:58,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-10 18:24:58,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:58,194 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:24:58,210 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-10 18:24:58,398 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-10 18:24:58,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:58,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:58,400 INFO L85 PathProgramCache]: Analyzing trace with hash -614856326, now seen corresponding path program 2 times [2024-11-10 18:24:58,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:24:58,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849960233] [2024-11-10 18:24:58,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:24:58,401 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-10 18:24:58,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:24:58,404 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-10 18:24:58,406 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-10 18:24:58,880 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:24:58,880 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:24:58,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:24:58,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:24:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:24:58,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:24:58,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:24:58,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849960233] [2024-11-10 18:24:58,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849960233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:24:58,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:24:58,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:24:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271523943] [2024-11-10 18:24:58,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:24:58,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:24:58,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:24:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:24:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:24:58,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-10 18:24:58,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-10 18:24:58,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:58,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-10 18:24:58,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:24:59,133 INFO L124 PetriNetUnfolderBase]: 469/1166 cut-off events. [2024-11-10 18:24:59,134 INFO L125 PetriNetUnfolderBase]: For 306/322 co-relation queries the response was YES. [2024-11-10 18:24:59,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2466 conditions, 1166 events. 469/1166 cut-off events. For 306/322 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6731 event pairs, 325 based on Foata normal form. 1/1051 useless extension candidates. Maximal degree in co-relation 2460. Up to 786 conditions per place. [2024-11-10 18:24:59,141 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 25 selfloop transitions, 1 changer transitions 3/46 dead transitions. [2024-11-10 18:24:59,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 182 flow [2024-11-10 18:24:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:24:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:24:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-10 18:24:59,143 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2024-11-10 18:24:59,143 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 130 flow. Second operand 3 states and 89 transitions. [2024-11-10 18:24:59,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 182 flow [2024-11-10 18:24:59,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:24:59,146 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 116 flow [2024-11-10 18:24:59,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-11-10 18:24:59,147 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2024-11-10 18:24:59,147 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 116 flow [2024-11-10 18:24:59,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-10 18:24:59,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:24:59,148 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:24:59,155 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-10 18:24:59,352 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-10 18:24:59,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:24:59,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:24:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash -52440389, now seen corresponding path program 1 times [2024-11-10 18:24:59,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:24:59,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818256460] [2024-11-10 18:24:59,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:24:59,356 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-10 18:24:59,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:24:59,359 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-10 18:24:59,372 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-10 18:24:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:24:59,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:24:59,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:24:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:24:59,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:24:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:24:59,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:24:59,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818256460] [2024-11-10 18:24:59,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818256460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:24:59,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:24:59,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-10 18:24:59,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592318481] [2024-11-10 18:24:59,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:24:59,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:24:59,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:24:59,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:24:59,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:24:59,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2024-11-10 18:24:59,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-10 18:24:59,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:24:59,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2024-11-10 18:24:59,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:00,439 INFO L124 PetriNetUnfolderBase]: 858/1994 cut-off events. [2024-11-10 18:25:00,439 INFO L125 PetriNetUnfolderBase]: For 347/349 co-relation queries the response was YES. [2024-11-10 18:25:00,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 1994 events. 858/1994 cut-off events. For 347/349 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 11594 event pairs, 158 based on Foata normal form. 60/1881 useless extension candidates. Maximal degree in co-relation 3998. Up to 397 conditions per place. [2024-11-10 18:25:00,452 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 73 selfloop transitions, 5 changer transitions 0/93 dead transitions. [2024-11-10 18:25:00,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 93 transitions, 415 flow [2024-11-10 18:25:00,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:25:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:25:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2024-11-10 18:25:00,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-11-10 18:25:00,454 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 116 flow. Second operand 5 states and 176 transitions. [2024-11-10 18:25:00,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 93 transitions, 415 flow [2024-11-10 18:25:00,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 93 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:25:00,457 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 145 flow [2024-11-10 18:25:00,457 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-11-10 18:25:00,458 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2024-11-10 18:25:00,458 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 145 flow [2024-11-10 18:25:00,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-10 18:25:00,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:00,459 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:25:00,466 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 (7)] Forceful destruction successful, exit code 0 [2024-11-10 18:25:00,660 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-10 18:25:00,660 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:25:00,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1604291489, now seen corresponding path program 2 times [2024-11-10 18:25:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:25:00,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437833742] [2024-11-10 18:25:00,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:25:00,662 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-10 18:25:00,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:25:00,663 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-10 18:25:00,664 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-10 18:25:01,094 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:25:01,094 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:25:01,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:25:01,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:25:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-10 18:25:01,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:25:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-10 18:25:01,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:25:01,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437833742] [2024-11-10 18:25:01,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437833742] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:25:01,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:25:01,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-10 18:25:01,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98294176] [2024-11-10 18:25:01,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:25:01,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:25:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:25:01,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:25:01,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:25:01,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2024-11-10 18:25:01,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-10 18:25:01,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:01,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2024-11-10 18:25:01,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:01,816 INFO L124 PetriNetUnfolderBase]: 1222/2870 cut-off events. [2024-11-10 18:25:01,816 INFO L125 PetriNetUnfolderBase]: For 1263/1263 co-relation queries the response was YES. [2024-11-10 18:25:01,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6089 conditions, 2870 events. 1222/2870 cut-off events. For 1263/1263 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 17771 event pairs, 219 based on Foata normal form. 86/2719 useless extension candidates. Maximal degree in co-relation 6080. Up to 554 conditions per place. [2024-11-10 18:25:01,851 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 74 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2024-11-10 18:25:01,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 95 transitions, 494 flow [2024-11-10 18:25:01,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:25:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:25:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2024-11-10 18:25:01,853 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6290909090909091 [2024-11-10 18:25:01,853 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 145 flow. Second operand 5 states and 173 transitions. [2024-11-10 18:25:01,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 95 transitions, 494 flow [2024-11-10 18:25:01,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 95 transitions, 470 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-11-10 18:25:01,857 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 169 flow [2024-11-10 18:25:01,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-11-10 18:25:01,858 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 12 predicate places. [2024-11-10 18:25:01,858 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 169 flow [2024-11-10 18:25:01,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-10 18:25:01,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:01,859 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:25:01,868 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-10 18:25:02,059 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-10 18:25:02,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:25:02,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:02,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1704409735, now seen corresponding path program 3 times [2024-11-10 18:25:02,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:25:02,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335811986] [2024-11-10 18:25:02,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:25:02,061 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-10 18:25:02,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:25:02,063 INFO L229 MonitoredProcess]: Starting monitored process 9 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-10 18:25:02,064 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 (9)] Waiting until timeout for monitored process [2024-11-10 18:25:02,639 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-10 18:25:02,640 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:25:02,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:25:02,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:25:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 18:25:02,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:25:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 18:25:02,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:25:02,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335811986] [2024-11-10 18:25:02,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335811986] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:25:02,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:25:02,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2024-11-10 18:25:02,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693460648] [2024-11-10 18:25:02,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:25:02,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:25:02,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:25:02,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:25:02,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:25:02,787 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2024-11-10 18:25:02,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-10 18:25:02,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:02,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2024-11-10 18:25:02,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:03,107 INFO L124 PetriNetUnfolderBase]: 492/1280 cut-off events. [2024-11-10 18:25:03,107 INFO L125 PetriNetUnfolderBase]: For 862/870 co-relation queries the response was YES. [2024-11-10 18:25:03,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2958 conditions, 1280 events. 492/1280 cut-off events. For 862/870 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5958 event pairs, 155 based on Foata normal form. 0/1262 useless extension candidates. Maximal degree in co-relation 2946. Up to 475 conditions per place. [2024-11-10 18:25:03,118 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 48 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-11-10 18:25:03,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 350 flow [2024-11-10 18:25:03,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:25:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:25:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-11-10 18:25:03,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5409090909090909 [2024-11-10 18:25:03,121 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 169 flow. Second operand 4 states and 119 transitions. [2024-11-10 18:25:03,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 350 flow [2024-11-10 18:25:03,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 66 transitions, 338 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-10 18:25:03,128 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 182 flow [2024-11-10 18:25:03,128 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-11-10 18:25:03,130 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2024-11-10 18:25:03,130 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 182 flow [2024-11-10 18:25:03,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-10 18:25:03,131 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:03,131 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:25:03,143 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 (9)] Ended with exit code 0 [2024-11-10 18:25:03,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-10 18:25:03,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 18:25:03,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:03,333 INFO L85 PathProgramCache]: Analyzing trace with hash -207431233, now seen corresponding path program 4 times [2024-11-10 18:25:03,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:25:03,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81908959] [2024-11-10 18:25:03,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 18:25:03,334 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-10 18:25:03,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:25:03,337 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10 18:25:03,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 (10)] Waiting until timeout for monitored process [2024-11-10 18:25:03,780 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 18:25:03,780 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-10 18:25:03,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:25:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:25:03,952 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 18:25:03,952 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:25:03,954 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-10 18:25:03,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-10 18:25:03,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-10 18:25:03,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-10 18:25:03,969 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 (10)] Ended with exit code 0 [2024-11-10 18:25:04,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-10 18:25:04,160 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1] [2024-11-10 18:25:04,253 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:25:04,253 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:25:04,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:25:04 BasicIcfg [2024-11-10 18:25:04,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:25:04,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:25:04,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:25:04,259 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:25:04,260 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:24:53" (3/4) ... [2024-11-10 18:25:04,262 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:25:04,263 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:25:04,264 INFO L158 Benchmark]: Toolchain (without parser) took 13495.11ms. Allocated memory was 73.4MB in the beginning and 507.5MB in the end (delta: 434.1MB). Free memory was 39.8MB in the beginning and 308.6MB in the end (delta: -268.7MB). Peak memory consumption was 165.2MB. Max. memory is 16.1GB. [2024-11-10 18:25:04,264 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 52.4MB. Free memory is still 28.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:25:04,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 719.64ms. Allocated memory is still 73.4MB. Free memory was 39.7MB in the beginning and 48.3MB in the end (delta: -8.6MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-11-10 18:25:04,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.47ms. Allocated memory is still 73.4MB. Free memory was 47.9MB in the beginning and 44.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:25:04,265 INFO L158 Benchmark]: Boogie Preprocessor took 113.48ms. Allocated memory is still 73.4MB. Free memory was 44.9MB in the beginning and 40.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:25:04,266 INFO L158 Benchmark]: IcfgBuilder took 1903.51ms. Allocated memory was 73.4MB in the beginning and 123.7MB in the end (delta: 50.3MB). Free memory was 40.7MB in the beginning and 47.7MB in the end (delta: -7.0MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2024-11-10 18:25:04,266 INFO L158 Benchmark]: TraceAbstraction took 10665.15ms. Allocated memory was 123.7MB in the beginning and 507.5MB in the end (delta: 383.8MB). Free memory was 47.2MB in the beginning and 308.6MB in the end (delta: -261.4MB). Peak memory consumption was 122.4MB. Max. memory is 16.1GB. [2024-11-10 18:25:04,266 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 507.5MB. Free memory is still 308.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:25:04,270 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.14ms. Allocated memory is still 52.4MB. Free memory is still 28.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 719.64ms. Allocated memory is still 73.4MB. Free memory was 39.7MB in the beginning and 48.3MB in the end (delta: -8.6MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.47ms. Allocated memory is still 73.4MB. Free memory was 47.9MB in the beginning and 44.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.48ms. Allocated memory is still 73.4MB. Free memory was 44.9MB in the beginning and 40.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1903.51ms. Allocated memory was 73.4MB in the beginning and 123.7MB in the end (delta: 50.3MB). Free memory was 40.7MB in the beginning and 47.7MB in the end (delta: -7.0MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10665.15ms. Allocated memory was 123.7MB in the beginning and 507.5MB in the end (delta: 383.8MB). Free memory was 47.2MB in the beginning and 308.6MB in the end (delta: -261.4MB). Peak memory consumption was 122.4MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 507.5MB. Free memory is still 308.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=0, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=0, t2=1, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, t1=0, t2=1, total=1] [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=0, t2=1, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=0, t2=1, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) [L919] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] [L18] 0 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] - UnprovableResult [Line: 906]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 914]: 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: 913]: 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, 75 locations, 4 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: 10.4s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 626 IncrementalHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 5 mSDtfsCounter, 626 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=8, InterpolantAutomatonStates: 28, 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.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 371 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 452 ConstructedInterpolants, 0 QuantifiedInterpolants, 1126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1708 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 200/220 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-10 18:25:04,304 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample