./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/stack-2.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 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:21:52,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:21:52,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:21:52,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:21:52,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:21:52,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:21:52,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:21:52,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:21:52,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:21:52,684 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:21:52,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:21:52,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:21:52,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:21:52,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:21:52,685 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:21:52,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:21:52,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:21:52,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:21:52,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:21:52,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:21:52,688 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:21:52,691 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:21:52,691 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:21:52,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:21:52,692 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:21:52,692 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:21:52,692 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:21:52,692 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:21:52,692 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:21:52,693 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:21:52,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:21:52,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:21:52,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:21:52,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:21:52,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:21:52,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:21:52,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:21:52,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:21:52,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:21:52,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:21:52,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:21:52,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:21:52,696 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2024-11-09 10:21:52,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:21:52,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:21:52,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:21:52,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:21:52,949 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:21:52,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-2.i [2024-11-09 10:21:54,393 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:21:54,650 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:21:54,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2024-11-09 10:21:54,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87746fe2e/7c485167b392459f9044989e0e363743/FLAGe912cd291 [2024-11-09 10:21:54,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87746fe2e/7c485167b392459f9044989e0e363743 [2024-11-09 10:21:54,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:21:54,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:21:54,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:21:54,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:21:54,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:21:54,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:21:54" (1/1) ... [2024-11-09 10:21:54,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37703191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:54, skipping insertion in model container [2024-11-09 10:21:54,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:21:54" (1/1) ... [2024-11-09 10:21:54,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:21:55,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:21:55,169 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:21:55,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:21:55,259 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:21:55,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55 WrapperNode [2024-11-09 10:21:55,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:21:55,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:21:55,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:21:55,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:21:55,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55" (1/1) ... [2024-11-09 10:21:55,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55" (1/1) ... [2024-11-09 10:21:55,310 INFO L138 Inliner]: procedures = 277, calls = 37, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 161 [2024-11-09 10:21:55,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:21:55,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:21:55,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:21:55,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:21:55,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55" (1/1) ... [2024-11-09 10:21:55,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55" (1/1) ... [2024-11-09 10:21:55,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55" (1/1) ... [2024-11-09 10:21:55,347 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 1, 0]. [2024-11-09 10:21:55,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55" (1/1) ... [2024-11-09 10:21:55,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55" (1/1) ... [2024-11-09 10:21:55,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55" (1/1) ... [2024-11-09 10:21:55,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55" (1/1) ... [2024-11-09 10:21:55,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55" (1/1) ... [2024-11-09 10:21:55,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55" (1/1) ... [2024-11-09 10:21:55,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:21:55,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:21:55,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:21:55,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:21:55,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55" (1/1) ... [2024-11-09 10:21:55,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:21:55,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:21:55,406 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-09 10:21:55,413 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-09 10:21:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-09 10:21:55,459 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-09 10:21:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-09 10:21:55,459 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-09 10:21:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:21:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:21:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:21:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:21:55,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:21:55,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:21:55,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:21:55,462 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:21:55,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:21:55,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:21:55,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:21:55,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:21:55,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:21:55,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:21:55,464 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:21:55,603 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:21:55,604 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:21:55,810 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:21:55,811 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:21:56,013 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:21:56,013 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 10:21:56,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:21:56 BoogieIcfgContainer [2024-11-09 10:21:56,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:21:56,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:21:56,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:21:56,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:21:56,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:21:54" (1/3) ... [2024-11-09 10:21:56,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c333b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:21:56, skipping insertion in model container [2024-11-09 10:21:56,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:55" (2/3) ... [2024-11-09 10:21:56,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c333b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:21:56, skipping insertion in model container [2024-11-09 10:21:56,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:21:56" (3/3) ... [2024-11-09 10:21:56,023 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2024-11-09 10:21:56,036 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:21:56,036 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-09 10:21:56,037 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:21:56,103 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:21:56,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2024-11-09 10:21:56,175 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2024-11-09 10:21:56,175 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:21:56,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 9/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 135 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2024-11-09 10:21:56,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2024-11-09 10:21:56,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2024-11-09 10:21:56,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:21:56,216 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;@2786841a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:21:56,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-09 10:21:56,223 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:21:56,223 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-11-09 10:21:56,223 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:21:56,223 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:56,224 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:56,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:21:56,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:56,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1884156541, now seen corresponding path program 1 times [2024-11-09 10:21:56,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:56,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110929780] [2024-11-09 10:21:56,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:56,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:56,627 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-09 10:21:56,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:56,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110929780] [2024-11-09 10:21:56,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110929780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:56,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:56,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:21:56,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730703802] [2024-11-09 10:21:56,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:56,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:21:56,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:56,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:21:56,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:21:56,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:21:56,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-09 10:21:56,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:56,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:21:56,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:57,025 INFO L124 PetriNetUnfolderBase]: 454/883 cut-off events. [2024-11-09 10:21:57,031 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-09 10:21:57,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 883 events. 454/883 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4507 event pairs, 242 based on Foata normal form. 90/851 useless extension candidates. Maximal degree in co-relation 1570. Up to 512 conditions per place. [2024-11-09 10:21:57,048 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-11-09 10:21:57,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2024-11-09 10:21:57,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:21:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:21:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-11-09 10:21:57,060 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2024-11-09 10:21:57,061 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2024-11-09 10:21:57,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2024-11-09 10:21:57,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:21:57,067 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2024-11-09 10:21:57,070 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-11-09 10:21:57,073 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-11-09 10:21:57,073 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2024-11-09 10:21:57,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-09 10:21:57,073 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:57,074 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:57,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:21:57,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:21:57,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:57,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1884156542, now seen corresponding path program 1 times [2024-11-09 10:21:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:57,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910820572] [2024-11-09 10:21:57,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:57,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:57,389 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-09 10:21:57,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:57,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910820572] [2024-11-09 10:21:57,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910820572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:57,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:57,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:21:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185709556] [2024-11-09 10:21:57,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:57,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:21:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:57,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:21:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:21:57,410 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:21:57,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-09 10:21:57,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:57,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:21:57,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:57,698 INFO L124 PetriNetUnfolderBase]: 750/1388 cut-off events. [2024-11-09 10:21:57,699 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-09 10:21:57,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1388 events. 750/1388 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7411 event pairs, 125 based on Foata normal form. 0/1220 useless extension candidates. Maximal degree in co-relation 807. Up to 848 conditions per place. [2024-11-09 10:21:57,706 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2024-11-09 10:21:57,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2024-11-09 10:21:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:21:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:21:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-11-09 10:21:57,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-11-09 10:21:57,708 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2024-11-09 10:21:57,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2024-11-09 10:21:57,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:21:57,712 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2024-11-09 10:21:57,712 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2024-11-09 10:21:57,713 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-09 10:21:57,713 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2024-11-09 10:21:57,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-09 10:21:57,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:57,713 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:57,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:21:57,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:21:57,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1982671279, now seen corresponding path program 1 times [2024-11-09 10:21:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:57,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690105683] [2024-11-09 10:21:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:57,753 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-09 10:21:57,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:57,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690105683] [2024-11-09 10:21:57,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690105683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:57,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:57,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:21:57,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288575364] [2024-11-09 10:21:57,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:57,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:21:57,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:57,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:21:57,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:21:57,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:21:57,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-09 10:21:57,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:57,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:21:57,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:57,905 INFO L124 PetriNetUnfolderBase]: 663/1274 cut-off events. [2024-11-09 10:21:57,906 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2024-11-09 10:21:57,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1274 events. 663/1274 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6567 event pairs, 176 based on Foata normal form. 34/1197 useless extension candidates. Maximal degree in co-relation 2591. Up to 721 conditions per place. [2024-11-09 10:21:57,911 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2024-11-09 10:21:57,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 376 flow [2024-11-09 10:21:57,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:21:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:21:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-11-09 10:21:57,913 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-11-09 10:21:57,913 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 5 states and 160 transitions. [2024-11-09 10:21:57,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 376 flow [2024-11-09 10:21:57,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 374 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 10:21:57,916 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 161 flow [2024-11-09 10:21:57,916 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-11-09 10:21:57,917 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-09 10:21:57,917 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 161 flow [2024-11-09 10:21:57,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-09 10:21:57,917 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:57,917 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:57,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:21:57,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:21:57,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:57,918 INFO L85 PathProgramCache]: Analyzing trace with hash -606823708, now seen corresponding path program 1 times [2024-11-09 10:21:57,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:57,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23999036] [2024-11-09 10:21:57,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:57,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:57,950 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-09 10:21:57,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:57,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23999036] [2024-11-09 10:21:57,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23999036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:57,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:57,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:21:57,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765747859] [2024-11-09 10:21:57,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:57,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:21:57,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:57,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:21:57,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:21:57,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:21:57,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-09 10:21:57,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:57,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:21:57,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:58,134 INFO L124 PetriNetUnfolderBase]: 971/1835 cut-off events. [2024-11-09 10:21:58,134 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2024-11-09 10:21:58,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4026 conditions, 1835 events. 971/1835 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 9714 event pairs, 464 based on Foata normal form. 0/1713 useless extension candidates. Maximal degree in co-relation 3355. Up to 1051 conditions per place. [2024-11-09 10:21:58,141 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 73 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2024-11-09 10:21:58,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 429 flow [2024-11-09 10:21:58,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:21:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:21:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-11-09 10:21:58,143 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2024-11-09 10:21:58,143 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 161 flow. Second operand 4 states and 139 transitions. [2024-11-09 10:21:58,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 429 flow [2024-11-09 10:21:58,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 429 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:21:58,146 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 197 flow [2024-11-09 10:21:58,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-11-09 10:21:58,147 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-09 10:21:58,147 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 197 flow [2024-11-09 10:21:58,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-09 10:21:58,147 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:58,147 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:58,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:21:58,147 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:21:58,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:58,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2114840908, now seen corresponding path program 1 times [2024-11-09 10:21:58,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:58,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034894237] [2024-11-09 10:21:58,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:58,168 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-09 10:21:58,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:58,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034894237] [2024-11-09 10:21:58,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034894237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:58,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:58,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:21:58,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207314985] [2024-11-09 10:21:58,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:58,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:21:58,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:58,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:21:58,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:21:58,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:21:58,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:21:58,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:58,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:21:58,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:58,344 INFO L124 PetriNetUnfolderBase]: 1096/2029 cut-off events. [2024-11-09 10:21:58,344 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2024-11-09 10:21:58,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4873 conditions, 2029 events. 1096/2029 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10942 event pairs, 514 based on Foata normal form. 22/1932 useless extension candidates. Maximal degree in co-relation 4011. Up to 1284 conditions per place. [2024-11-09 10:21:58,352 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 62 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-11-09 10:21:58,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 397 flow [2024-11-09 10:21:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:21:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:21:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-09 10:21:58,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-09 10:21:58,354 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 197 flow. Second operand 3 states and 106 transitions. [2024-11-09 10:21:58,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 397 flow [2024-11-09 10:21:58,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 391 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 10:21:58,358 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 203 flow [2024-11-09 10:21:58,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2024-11-09 10:21:58,359 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-11-09 10:21:58,359 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 203 flow [2024-11-09 10:21:58,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:21:58,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:58,359 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:58,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:21:58,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:21:58,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:58,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1369334572, now seen corresponding path program 1 times [2024-11-09 10:21:58,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:58,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517564432] [2024-11-09 10:21:58,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:58,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:58,396 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-09 10:21:58,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:58,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517564432] [2024-11-09 10:21:58,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517564432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:58,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:58,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:21:58,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51142835] [2024-11-09 10:21:58,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:58,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:21:58,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:58,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:21:58,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:21:58,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:21:58,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-09 10:21:58,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:58,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:21:58,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:58,537 INFO L124 PetriNetUnfolderBase]: 1006/1856 cut-off events. [2024-11-09 10:21:58,537 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2024-11-09 10:21:58,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4370 conditions, 1856 events. 1006/1856 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9917 event pairs, 361 based on Foata normal form. 14/1750 useless extension candidates. Maximal degree in co-relation 3871. Up to 1410 conditions per place. [2024-11-09 10:21:58,548 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 49 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-09 10:21:58,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 313 flow [2024-11-09 10:21:58,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:21:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:21:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-09 10:21:58,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-11-09 10:21:58,549 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 203 flow. Second operand 3 states and 96 transitions. [2024-11-09 10:21:58,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 313 flow [2024-11-09 10:21:58,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 303 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-09 10:21:58,552 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 180 flow [2024-11-09 10:21:58,552 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2024-11-09 10:21:58,553 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2024-11-09 10:21:58,553 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 180 flow [2024-11-09 10:21:58,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-09 10:21:58,553 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:58,553 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:58,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:21:58,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:21:58,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:58,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1602994892, now seen corresponding path program 1 times [2024-11-09 10:21:58,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:58,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30856702] [2024-11-09 10:21:58,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:58,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:21:58,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:58,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30856702] [2024-11-09 10:21:58,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30856702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:21:58,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718893213] [2024-11-09 10:21:58,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:58,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:21:58,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:21:58,819 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-09 10:21:58,820 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-09 10:21:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:58,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 10:21:58,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:21:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:21:59,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:21:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:21:59,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718893213] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:21:59,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:21:59,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-11-09 10:21:59,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833829064] [2024-11-09 10:21:59,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:21:59,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:21:59,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:59,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:21:59,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:21:59,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:21:59,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 180 flow. Second operand has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 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-09 10:21:59,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:59,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:21:59,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:00,698 INFO L124 PetriNetUnfolderBase]: 4128/7722 cut-off events. [2024-11-09 10:22:00,699 INFO L125 PetriNetUnfolderBase]: For 2485/2485 co-relation queries the response was YES. [2024-11-09 10:22:00,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17864 conditions, 7722 events. 4128/7722 cut-off events. For 2485/2485 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 50434 event pairs, 309 based on Foata normal form. 192/7404 useless extension candidates. Maximal degree in co-relation 7413. Up to 1423 conditions per place. [2024-11-09 10:22:00,742 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/386 dead transitions. [2024-11-09 10:22:00,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 386 transitions, 1892 flow [2024-11-09 10:22:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 10:22:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-09 10:22:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2024-11-09 10:22:00,744 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-09 10:22:00,744 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 180 flow. Second operand 20 states and 685 transitions. [2024-11-09 10:22:00,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 386 transitions, 1892 flow [2024-11-09 10:22:00,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 386 transitions, 1850 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:00,755 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 592 flow [2024-11-09 10:22:00,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=592, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2024-11-09 10:22:00,756 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2024-11-09 10:22:00,756 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 592 flow [2024-11-09 10:22:00,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 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-09 10:22:00,757 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:00,757 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:00,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:22:00,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:00,962 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:00,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash -268637720, now seen corresponding path program 1 times [2024-11-09 10:22:00,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:00,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093330485] [2024-11-09 10:22:00,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:01,014 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-09 10:22:01,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:01,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093330485] [2024-11-09 10:22:01,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093330485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:01,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:01,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:01,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116046548] [2024-11-09 10:22:01,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:01,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:01,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:01,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:01,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:01,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:22:01,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 10:22:01,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:01,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:22:01,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:01,369 INFO L124 PetriNetUnfolderBase]: 1833/3828 cut-off events. [2024-11-09 10:22:01,369 INFO L125 PetriNetUnfolderBase]: For 2279/2279 co-relation queries the response was YES. [2024-11-09 10:22:01,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9379 conditions, 3828 events. 1833/3828 cut-off events. For 2279/2279 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 22305 event pairs, 372 based on Foata normal form. 234/3906 useless extension candidates. Maximal degree in co-relation 9177. Up to 2311 conditions per place. [2024-11-09 10:22:01,387 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2024-11-09 10:22:01,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 609 flow [2024-11-09 10:22:01,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-09 10:22:01,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2024-11-09 10:22:01,388 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 592 flow. Second operand 3 states and 94 transitions. [2024-11-09 10:22:01,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 609 flow [2024-11-09 10:22:01,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 561 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-11-09 10:22:01,398 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 389 flow [2024-11-09 10:22:01,398 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2024-11-09 10:22:01,399 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-11-09 10:22:01,399 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 389 flow [2024-11-09 10:22:01,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 10:22:01,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:01,399 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:01,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:22:01,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:01,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:01,400 INFO L85 PathProgramCache]: Analyzing trace with hash 700879737, now seen corresponding path program 1 times [2024-11-09 10:22:01,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:01,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066485461] [2024-11-09 10:22:01,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:01,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:01,457 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-09 10:22:01,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:01,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066485461] [2024-11-09 10:22:01,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066485461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:01,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:01,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:22:01,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319116905] [2024-11-09 10:22:01,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:01,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:22:01,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:01,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:22:01,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:22:01,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:22:01,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 389 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-09 10:22:01,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:01,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:22:01,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:01,769 INFO L124 PetriNetUnfolderBase]: 1838/3730 cut-off events. [2024-11-09 10:22:01,770 INFO L125 PetriNetUnfolderBase]: For 1489/1489 co-relation queries the response was YES. [2024-11-09 10:22:01,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9363 conditions, 3730 events. 1838/3730 cut-off events. For 1489/1489 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21405 event pairs, 1002 based on Foata normal form. 0/3605 useless extension candidates. Maximal degree in co-relation 7894. Up to 2166 conditions per place. [2024-11-09 10:22:01,794 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 56 selfloop transitions, 18 changer transitions 0/88 dead transitions. [2024-11-09 10:22:01,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 88 transitions, 565 flow [2024-11-09 10:22:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:22:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:22:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-11-09 10:22:01,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44363636363636366 [2024-11-09 10:22:01,796 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 389 flow. Second operand 5 states and 122 transitions. [2024-11-09 10:22:01,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 88 transitions, 565 flow [2024-11-09 10:22:01,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 88 transitions, 561 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:01,803 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 419 flow [2024-11-09 10:22:01,803 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=419, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2024-11-09 10:22:01,804 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2024-11-09 10:22:01,805 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 419 flow [2024-11-09 10:22:01,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-09 10:22:01,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:01,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:01,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:22:01,806 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:01,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:01,806 INFO L85 PathProgramCache]: Analyzing trace with hash 289520536, now seen corresponding path program 1 times [2024-11-09 10:22:01,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:01,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108729509] [2024-11-09 10:22:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:01,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:02,076 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-09 10:22:02,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:02,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108729509] [2024-11-09 10:22:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108729509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:02,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:22:02,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498531301] [2024-11-09 10:22:02,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:02,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:22:02,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:02,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:22:02,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:22:02,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:22:02,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 419 flow. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 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-09 10:22:02,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:02,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:22:02,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:02,692 INFO L124 PetriNetUnfolderBase]: 1961/3997 cut-off events. [2024-11-09 10:22:02,692 INFO L125 PetriNetUnfolderBase]: For 2197/2197 co-relation queries the response was YES. [2024-11-09 10:22:02,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10051 conditions, 3997 events. 1961/3997 cut-off events. For 2197/2197 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 23178 event pairs, 461 based on Foata normal form. 0/3837 useless extension candidates. Maximal degree in co-relation 8547. Up to 2936 conditions per place. [2024-11-09 10:22:02,722 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 110 selfloop transitions, 9 changer transitions 0/132 dead transitions. [2024-11-09 10:22:02,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 132 transitions, 831 flow [2024-11-09 10:22:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:22:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:22:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2024-11-09 10:22:02,731 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49772727272727274 [2024-11-09 10:22:02,731 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 419 flow. Second operand 8 states and 219 transitions. [2024-11-09 10:22:02,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 132 transitions, 831 flow [2024-11-09 10:22:02,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 132 transitions, 787 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:22:02,742 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 442 flow [2024-11-09 10:22:02,746 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=442, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2024-11-09 10:22:02,747 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2024-11-09 10:22:02,747 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 442 flow [2024-11-09 10:22:02,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 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-09 10:22:02,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:02,747 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:02,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:22:02,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:02,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:02,748 INFO L85 PathProgramCache]: Analyzing trace with hash -798695038, now seen corresponding path program 1 times [2024-11-09 10:22:02,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:02,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225620612] [2024-11-09 10:22:02,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:02,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:02,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:02,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225620612] [2024-11-09 10:22:02,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225620612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:02,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:02,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:02,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604070748] [2024-11-09 10:22:02,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:02,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:02,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:02,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:02,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:02,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:22:02,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 10:22:02,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:02,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:22:02,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:03,541 INFO L124 PetriNetUnfolderBase]: 2879/6069 cut-off events. [2024-11-09 10:22:03,542 INFO L125 PetriNetUnfolderBase]: For 3090/3090 co-relation queries the response was YES. [2024-11-09 10:22:03,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15027 conditions, 6069 events. 2879/6069 cut-off events. For 3090/3090 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 40467 event pairs, 1373 based on Foata normal form. 137/5984 useless extension candidates. Maximal degree in co-relation 13000. Up to 3403 conditions per place. [2024-11-09 10:22:03,612 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 124 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2024-11-09 10:22:03,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 140 transitions, 1054 flow [2024-11-09 10:22:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-09 10:22:03,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-11-09 10:22:03,617 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 442 flow. Second operand 3 states and 107 transitions. [2024-11-09 10:22:03,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 140 transitions, 1054 flow [2024-11-09 10:22:03,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 140 transitions, 1038 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:22:03,647 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 445 flow [2024-11-09 10:22:03,647 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2024-11-09 10:22:03,647 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2024-11-09 10:22:03,648 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 445 flow [2024-11-09 10:22:03,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 10:22:03,648 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:03,648 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:03,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:22:03,648 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:03,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:03,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1104727326, now seen corresponding path program 1 times [2024-11-09 10:22:03,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:03,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623277086] [2024-11-09 10:22:03,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:03,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:03,761 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-09 10:22:03,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:03,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623277086] [2024-11-09 10:22:03,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623277086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:03,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:03,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:22:03,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682511623] [2024-11-09 10:22:03,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:03,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:22:03,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:03,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:22:03,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:22:03,764 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:22:03,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 445 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-09 10:22:03,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:03,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:22:03,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:04,316 INFO L124 PetriNetUnfolderBase]: 3194/6480 cut-off events. [2024-11-09 10:22:04,317 INFO L125 PetriNetUnfolderBase]: For 4317/4317 co-relation queries the response was YES. [2024-11-09 10:22:04,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17913 conditions, 6480 events. 3194/6480 cut-off events. For 4317/4317 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 42389 event pairs, 475 based on Foata normal form. 105/6399 useless extension candidates. Maximal degree in co-relation 14833. Up to 2632 conditions per place. [2024-11-09 10:22:04,351 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 109 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2024-11-09 10:22:04,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 133 transitions, 930 flow [2024-11-09 10:22:04,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:22:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:22:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-11-09 10:22:04,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5527272727272727 [2024-11-09 10:22:04,353 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 445 flow. Second operand 5 states and 152 transitions. [2024-11-09 10:22:04,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 133 transitions, 930 flow [2024-11-09 10:22:04,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 923 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:04,367 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 519 flow [2024-11-09 10:22:04,367 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=519, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-11-09 10:22:04,369 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2024-11-09 10:22:04,369 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 519 flow [2024-11-09 10:22:04,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-09 10:22:04,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:04,370 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:04,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:22:04,370 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:04,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:04,370 INFO L85 PathProgramCache]: Analyzing trace with hash 428939891, now seen corresponding path program 1 times [2024-11-09 10:22:04,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:04,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929292403] [2024-11-09 10:22:04,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:04,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:04,845 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-09 10:22:04,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929292403] [2024-11-09 10:22:04,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929292403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:04,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:04,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 10:22:04,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259074371] [2024-11-09 10:22:04,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:04,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:22:04,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:04,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:22:04,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:22:04,888 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:22:04,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 519 flow. Second operand has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-09 10:22:04,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:04,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:22:04,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:06,027 INFO L124 PetriNetUnfolderBase]: 4726/9654 cut-off events. [2024-11-09 10:22:06,027 INFO L125 PetriNetUnfolderBase]: For 8698/8698 co-relation queries the response was YES. [2024-11-09 10:22:06,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26991 conditions, 9654 events. 4726/9654 cut-off events. For 8698/8698 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 67170 event pairs, 1022 based on Foata normal form. 24/9464 useless extension candidates. Maximal degree in co-relation 21486. Up to 4678 conditions per place. [2024-11-09 10:22:06,084 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 187 selfloop transitions, 25 changer transitions 0/226 dead transitions. [2024-11-09 10:22:06,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 226 transitions, 1602 flow [2024-11-09 10:22:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:22:06,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:22:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 339 transitions. [2024-11-09 10:22:06,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5136363636363637 [2024-11-09 10:22:06,085 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 519 flow. Second operand 12 states and 339 transitions. [2024-11-09 10:22:06,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 226 transitions, 1602 flow [2024-11-09 10:22:06,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 226 transitions, 1600 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:06,112 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 735 flow [2024-11-09 10:22:06,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=735, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2024-11-09 10:22:06,113 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 62 predicate places. [2024-11-09 10:22:06,113 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 735 flow [2024-11-09 10:22:06,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-09 10:22:06,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:06,113 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:06,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:22:06,114 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:06,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:06,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2104434424, now seen corresponding path program 1 times [2024-11-09 10:22:06,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:06,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420125184] [2024-11-09 10:22:06,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:06,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:06,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:06,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420125184] [2024-11-09 10:22:06,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420125184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:22:06,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139372146] [2024-11-09 10:22:06,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:06,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:06,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:06,151 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-09 10:22:06,152 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-09 10:22:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:06,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:22:06,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:06,280 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-09 10:22:06,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:06,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139372146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:06,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 10:22:06,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-11-09 10:22:06,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338936674] [2024-11-09 10:22:06,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:06,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:06,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:06,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:22:06,289 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:22:06,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 735 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-09 10:22:06,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:06,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:22:06,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:07,680 INFO L124 PetriNetUnfolderBase]: 4723/9548 cut-off events. [2024-11-09 10:22:07,680 INFO L125 PetriNetUnfolderBase]: For 11717/11717 co-relation queries the response was YES. [2024-11-09 10:22:07,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28284 conditions, 9548 events. 4723/9548 cut-off events. For 11717/11717 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 67212 event pairs, 3763 based on Foata normal form. 31/9347 useless extension candidates. Maximal degree in co-relation 22595. Up to 8111 conditions per place. [2024-11-09 10:22:07,744 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 89 selfloop transitions, 1 changer transitions 2/104 dead transitions. [2024-11-09 10:22:07,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 104 transitions, 915 flow [2024-11-09 10:22:07,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-09 10:22:07,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-11-09 10:22:07,746 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 735 flow. Second operand 3 states and 80 transitions. [2024-11-09 10:22:07,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 104 transitions, 915 flow [2024-11-09 10:22:07,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 104 transitions, 895 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-09 10:22:07,775 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 710 flow [2024-11-09 10:22:07,776 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2024-11-09 10:22:07,776 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 59 predicate places. [2024-11-09 10:22:07,776 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 710 flow [2024-11-09 10:22:07,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-09 10:22:07,777 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:07,777 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:07,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 10:22:07,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 10:22:07,978 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:07,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:07,978 INFO L85 PathProgramCache]: Analyzing trace with hash -544958678, now seen corresponding path program 1 times [2024-11-09 10:22:07,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:07,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860331675] [2024-11-09 10:22:07,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:07,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:08,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:08,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860331675] [2024-11-09 10:22:08,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860331675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:22:08,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744874867] [2024-11-09 10:22:08,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:08,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:08,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:08,302 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-09 10:22:08,309 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-09 10:22:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:08,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 10:22:08,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:08,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:08,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744874867] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:08,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:22:08,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 19 [2024-11-09 10:22:08,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864817021] [2024-11-09 10:22:08,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:08,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 10:22:08,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:08,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 10:22:08,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-09 10:22:08,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:22:08,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 710 flow. Second operand has 21 states, 21 states have (on average 19.571428571428573) internal successors, (411), 21 states have internal predecessors, (411), 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-09 10:22:08,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:08,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:22:08,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:12,636 INFO L124 PetriNetUnfolderBase]: 10813/21786 cut-off events. [2024-11-09 10:22:12,637 INFO L125 PetriNetUnfolderBase]: For 26818/26818 co-relation queries the response was YES. [2024-11-09 10:22:12,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64121 conditions, 21786 events. 10813/21786 cut-off events. For 26818/26818 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 172642 event pairs, 1522 based on Foata normal form. 209/21467 useless extension candidates. Maximal degree in co-relation 64079. Up to 3494 conditions per place. [2024-11-09 10:22:12,888 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 485 selfloop transitions, 167 changer transitions 0/663 dead transitions. [2024-11-09 10:22:12,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 663 transitions, 4929 flow [2024-11-09 10:22:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-09 10:22:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-11-09 10:22:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 1214 transitions. [2024-11-09 10:22:12,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4798418972332016 [2024-11-09 10:22:12,896 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 710 flow. Second operand 46 states and 1214 transitions. [2024-11-09 10:22:12,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 663 transitions, 4929 flow [2024-11-09 10:22:12,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 663 transitions, 4926 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:12,969 INFO L231 Difference]: Finished difference. Result has 163 places, 259 transitions, 2535 flow [2024-11-09 10:22:12,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=2535, PETRI_PLACES=163, PETRI_TRANSITIONS=259} [2024-11-09 10:22:12,971 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 113 predicate places. [2024-11-09 10:22:12,971 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 259 transitions, 2535 flow [2024-11-09 10:22:12,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 19.571428571428573) internal successors, (411), 21 states have internal predecessors, (411), 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-09 10:22:12,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:12,972 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:12,985 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-09 10:22:13,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:13,173 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:13,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:13,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1146432797, now seen corresponding path program 1 times [2024-11-09 10:22:13,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:13,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439332303] [2024-11-09 10:22:13,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:13,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:13,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439332303] [2024-11-09 10:22:13,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439332303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:22:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852819439] [2024-11-09 10:22:13,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:13,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:13,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:13,305 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-09 10:22:13,306 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-09 10:22:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:13,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:22:13,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:13,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:13,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852819439] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:13,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:22:13,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-11-09 10:22:13,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253565901] [2024-11-09 10:22:13,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:13,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:22:13,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:13,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:22:13,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:22:13,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:22:13,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 259 transitions, 2535 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-09 10:22:13,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:13,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:22:13,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:16,240 INFO L124 PetriNetUnfolderBase]: 8907/18084 cut-off events. [2024-11-09 10:22:16,241 INFO L125 PetriNetUnfolderBase]: For 34003/34003 co-relation queries the response was YES. [2024-11-09 10:22:16,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57557 conditions, 18084 events. 8907/18084 cut-off events. For 34003/34003 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 135071 event pairs, 2924 based on Foata normal form. 14/17658 useless extension candidates. Maximal degree in co-relation 57502. Up to 13651 conditions per place. [2024-11-09 10:22:16,362 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 256 selfloop transitions, 15 changer transitions 0/283 dead transitions. [2024-11-09 10:22:16,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 283 transitions, 3006 flow [2024-11-09 10:22:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:22:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:22:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-11-09 10:22:16,363 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5636363636363636 [2024-11-09 10:22:16,363 INFO L175 Difference]: Start difference. First operand has 163 places, 259 transitions, 2535 flow. Second operand 6 states and 186 transitions. [2024-11-09 10:22:16,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 283 transitions, 3006 flow [2024-11-09 10:22:16,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 283 transitions, 2615 flow, removed 188 selfloop flow, removed 5 redundant places. [2024-11-09 10:22:16,498 INFO L231 Difference]: Finished difference. Result has 166 places, 235 transitions, 1935 flow [2024-11-09 10:22:16,499 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1935, PETRI_PLACES=166, PETRI_TRANSITIONS=235} [2024-11-09 10:22:16,499 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 116 predicate places. [2024-11-09 10:22:16,499 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 235 transitions, 1935 flow [2024-11-09 10:22:16,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-09 10:22:16,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:16,500 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2024-11-09 10:22:16,513 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-09 10:22:16,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 10:22:16,700 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:16,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:16,701 INFO L85 PathProgramCache]: Analyzing trace with hash -200995681, now seen corresponding path program 1 times [2024-11-09 10:22:16,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:16,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835778829] [2024-11-09 10:22:16,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:16,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:22:16,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:22:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:22:16,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:22:16,774 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:22:16,775 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-09 10:22:16,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-09 10:22:16,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-09 10:22:16,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-09 10:22:16,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-09 10:22:16,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-09 10:22:16,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-09 10:22:16,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-09 10:22:16,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-09 10:22:16,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-09 10:22:16,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-09 10:22:16,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-09 10:22:16,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-09 10:22:16,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-09 10:22:16,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-09 10:22:16,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 10:22:16,779 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:16,836 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:22:16,840 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:22:16,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:22:16 BasicIcfg [2024-11-09 10:22:16,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:22:16,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:22:16,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:22:16,849 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:22:16,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:21:56" (3/4) ... [2024-11-09 10:22:16,851 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:22:16,856 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:22:16,857 INFO L158 Benchmark]: Toolchain (without parser) took 22170.62ms. Allocated memory was 176.2MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 105.4MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 589.1MB. Max. memory is 16.1GB. [2024-11-09 10:22:16,857 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:22:16,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.73ms. Allocated memory is still 176.2MB. Free memory was 105.1MB in the beginning and 128.7MB in the end (delta: -23.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-09 10:22:16,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.21ms. Allocated memory is still 176.2MB. Free memory was 128.7MB in the beginning and 125.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:22:16,858 INFO L158 Benchmark]: Boogie Preprocessor took 56.82ms. Allocated memory is still 176.2MB. Free memory was 125.4MB in the beginning and 122.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:22:16,858 INFO L158 Benchmark]: RCFGBuilder took 645.29ms. Allocated memory is still 176.2MB. Free memory was 122.4MB in the beginning and 81.4MB in the end (delta: 41.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-09 10:22:16,858 INFO L158 Benchmark]: TraceAbstraction took 20832.21ms. Allocated memory was 176.2MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 80.4MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 565.7MB. Max. memory is 16.1GB. [2024-11-09 10:22:16,859 INFO L158 Benchmark]: Witness Printer took 7.62ms. Allocated memory is still 3.5GB. Free memory was 2.9GB in the beginning and 2.8GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:22:16,860 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 176.2MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.73ms. Allocated memory is still 176.2MB. Free memory was 105.1MB in the beginning and 128.7MB in the end (delta: -23.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.21ms. Allocated memory is still 176.2MB. Free memory was 128.7MB in the beginning and 125.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.82ms. Allocated memory is still 176.2MB. Free memory was 125.4MB in the beginning and 122.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 645.29ms. Allocated memory is still 176.2MB. Free memory was 122.4MB in the beginning and 81.4MB in the end (delta: 41.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 20832.21ms. Allocated memory was 176.2MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 80.4MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 565.7MB. Max. memory is 16.1GB. * Witness Printer took 7.62ms. Allocated memory is still 3.5GB. Free memory was 2.9GB in the beginning and 2.8GB 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: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, id2=0, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=4, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=4] [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=4, top=1] [L1007] COND TRUE 2 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] CALL 2 reach_error() [L20] COND FALSE 2 !(0) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L20] 2 __assert_fail ("0", "stack-2.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1024]: 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: 1023]: 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 15 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: 20.6s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1870 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1812 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 266 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4691 IncrementalHoareTripleChecker+Invalid, 4754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 3 mSDtfsCounter, 4691 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2535occurred in iteration=15, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 3542 SizeOfPredicates, 14 NumberOfNonLiveVariables, 867 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 11/65 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-09 10:22:16,909 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/stack-2.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 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:22:19,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:22:19,080 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:22:19,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:22:19,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:22:19,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:22:19,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:22:19,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:22:19,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:22:19,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:22:19,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:22:19,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:22:19,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:22:19,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:22:19,120 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:22:19,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:22:19,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:22:19,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:22:19,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:22:19,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:22:19,125 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:22:19,125 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:22:19,125 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:22:19,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:22:19,126 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:22:19,126 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:22:19,126 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:22:19,126 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:22:19,126 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:22:19,126 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:22:19,127 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:22:19,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:22:19,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:22:19,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:22:19,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:22:19,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:19,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:22:19,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:22:19,130 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:22:19,130 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:22:19,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:22:19,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:22:19,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:22:19,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:22:19,131 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2024-11-09 10:22:19,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:22:19,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:22:19,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:22:19,506 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:22:19,506 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:22:19,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-2.i [2024-11-09 10:22:21,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:22:21,377 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:22:21,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2024-11-09 10:22:21,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e06f6ffb3/370a944468dd4338ac3e894abfef595b/FLAG3e184e45d [2024-11-09 10:22:21,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e06f6ffb3/370a944468dd4338ac3e894abfef595b [2024-11-09 10:22:21,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:22:21,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:22:21,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:21,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:22:21,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:22:21,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b977db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21, skipping insertion in model container [2024-11-09 10:22:21,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:22:21,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:21,800 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:22:21,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:21,884 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:22:21,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21 WrapperNode [2024-11-09 10:22:21,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:21,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:21,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:22:21,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:22:21,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,931 INFO L138 Inliner]: procedures = 281, calls = 37, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 157 [2024-11-09 10:22:21,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:21,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:22:21,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:22:21,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:22:21,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,969 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 0, 1]. [2024-11-09 10:22:21,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:22:21,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:22:21,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:22:21,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:22:21,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21" (1/1) ... [2024-11-09 10:22:21,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:22,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:22,024 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-09 10:22:22,029 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-09 10:22:22,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:22:22,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:22:22,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:22:22,064 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-09 10:22:22,064 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-09 10:22:22,064 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-09 10:22:22,065 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-09 10:22:22,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:22:22,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:22:22,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:22:22,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:22:22,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:22:22,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:22:22,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 10:22:22,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 10:22:22,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 10:22:22,070 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:22:22,070 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:22:22,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:22:22,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:22:22,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:22:22,072 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:22:22,227 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:22:22,228 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:22:22,503 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:22:22,503 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:22:22,735 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:22:22,735 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 10:22:22,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:22 BoogieIcfgContainer [2024-11-09 10:22:22,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:22:22,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:22:22,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:22:22,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:22:22,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:22:21" (1/3) ... [2024-11-09 10:22:22,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fd7450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:22, skipping insertion in model container [2024-11-09 10:22:22,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:21" (2/3) ... [2024-11-09 10:22:22,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fd7450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:22, skipping insertion in model container [2024-11-09 10:22:22,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:22" (3/3) ... [2024-11-09 10:22:22,743 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2024-11-09 10:22:22,755 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:22:22,756 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-09 10:22:22,756 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:22:22,821 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:22:22,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2024-11-09 10:22:22,880 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2024-11-09 10:22:22,880 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:22:22,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 9/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2024-11-09 10:22:22,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2024-11-09 10:22:22,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2024-11-09 10:22:22,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:22:22,897 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;@4b26f7bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:22:22,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-09 10:22:22,902 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:22:22,902 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-11-09 10:22:22,902 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:22:22,903 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:22,903 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:22,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:22,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:22,909 INFO L85 PathProgramCache]: Analyzing trace with hash -472343716, now seen corresponding path program 1 times [2024-11-09 10:22:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:22,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882976025] [2024-11-09 10:22:22,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:22,921 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-09 10:22:22,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:22,924 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-09 10:22:22,944 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-09 10:22:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:23,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:22:23,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:23,268 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-09 10:22:23,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:23,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:23,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882976025] [2024-11-09 10:22:23,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882976025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:23,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:23,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:22:23,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742903102] [2024-11-09 10:22:23,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:23,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:22:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:23,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:22:23,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:22:23,329 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:22:23,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-09 10:22:23,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:23,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:22:23,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:23,594 INFO L124 PetriNetUnfolderBase]: 454/883 cut-off events. [2024-11-09 10:22:23,594 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-09 10:22:23,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 883 events. 454/883 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4544 event pairs, 242 based on Foata normal form. 90/851 useless extension candidates. Maximal degree in co-relation 1570. Up to 512 conditions per place. [2024-11-09 10:22:23,601 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-11-09 10:22:23,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2024-11-09 10:22:23,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:22:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:22:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-11-09 10:22:23,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2024-11-09 10:22:23,612 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2024-11-09 10:22:23,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2024-11-09 10:22:23,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:22:23,616 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2024-11-09 10:22:23,618 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-11-09 10:22:23,620 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-11-09 10:22:23,620 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2024-11-09 10:22:23,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-09 10:22:23,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:23,621 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:23,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 10:22:23,824 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-09 10:22:23,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:23,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash -472343715, now seen corresponding path program 1 times [2024-11-09 10:22:23,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:23,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641759656] [2024-11-09 10:22:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:23,826 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-09 10:22:23,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:23,831 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-09 10:22:23,832 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-09 10:22:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:23,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:22:23,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:24,021 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-09 10:22:24,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:24,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:24,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641759656] [2024-11-09 10:22:24,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641759656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:24,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:24,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:24,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650843515] [2024-11-09 10:22:24,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:24,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:22:24,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:24,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:22:24,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:22:24,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:22:24,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-09 10:22:24,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:24,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:22:24,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:24,339 INFO L124 PetriNetUnfolderBase]: 750/1388 cut-off events. [2024-11-09 10:22:24,339 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-09 10:22:24,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1388 events. 750/1388 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7437 event pairs, 125 based on Foata normal form. 0/1220 useless extension candidates. Maximal degree in co-relation 807. Up to 848 conditions per place. [2024-11-09 10:22:24,347 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2024-11-09 10:22:24,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2024-11-09 10:22:24,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:22:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:22:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-11-09 10:22:24,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-11-09 10:22:24,350 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2024-11-09 10:22:24,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2024-11-09 10:22:24,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:22:24,352 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2024-11-09 10:22:24,352 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2024-11-09 10:22:24,353 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-09 10:22:24,353 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2024-11-09 10:22:24,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-09 10:22:24,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:24,354 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:24,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 10:22:24,554 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-09 10:22:24,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:24,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1851356261, now seen corresponding path program 1 times [2024-11-09 10:22:24,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:24,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433489023] [2024-11-09 10:22:24,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:24,556 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-09 10:22:24,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:24,558 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-09 10:22:24,559 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-09 10:22:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:24,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:22:24,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:24,627 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-09 10:22:24,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:24,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:24,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433489023] [2024-11-09 10:22:24,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433489023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:24,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:24,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:22:24,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442994690] [2024-11-09 10:22:24,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:24,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:24,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:24,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:24,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:24,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2024-11-09 10:22:24,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-09 10:22:24,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:24,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2024-11-09 10:22:24,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:24,768 INFO L124 PetriNetUnfolderBase]: 793/1531 cut-off events. [2024-11-09 10:22:24,768 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-11-09 10:22:24,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3149 conditions, 1531 events. 793/1531 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8001 event pairs, 348 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 3064. Up to 734 conditions per place. [2024-11-09 10:22:24,774 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 56 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2024-11-09 10:22:24,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 303 flow [2024-11-09 10:22:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-09 10:22:24,775 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-09 10:22:24,775 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 3 states and 102 transitions. [2024-11-09 10:22:24,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 303 flow [2024-11-09 10:22:24,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 301 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:24,778 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 148 flow [2024-11-09 10:22:24,778 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-11-09 10:22:24,779 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2024-11-09 10:22:24,779 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 148 flow [2024-11-09 10:22:24,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-09 10:22:24,779 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:24,779 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:24,783 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 (4)] Ended with exit code 0 [2024-11-09 10:22:24,982 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-09 10:22:24,983 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:24,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:24,983 INFO L85 PathProgramCache]: Analyzing trace with hash -972162493, now seen corresponding path program 1 times [2024-11-09 10:22:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235369888] [2024-11-09 10:22:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:24,984 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-09 10:22:24,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:24,989 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-09 10:22:24,990 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-09 10:22:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:25,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:22:25,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:25,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:25,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:25,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235369888] [2024-11-09 10:22:25,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235369888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:25,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:25,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:22:25,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765825477] [2024-11-09 10:22:25,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:25,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:22:25,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:25,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:22:25,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:22:25,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:22:25,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-09 10:22:25,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:25,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:22:25,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:25,303 INFO L124 PetriNetUnfolderBase]: 1096/2111 cut-off events. [2024-11-09 10:22:25,303 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2024-11-09 10:22:25,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4374 conditions, 2111 events. 1096/2111 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12189 event pairs, 518 based on Foata normal form. 0/1975 useless extension candidates. Maximal degree in co-relation 1577. Up to 1077 conditions per place. [2024-11-09 10:22:25,313 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 68 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2024-11-09 10:22:25,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 386 flow [2024-11-09 10:22:25,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:22:25,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:22:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-11-09 10:22:25,315 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2024-11-09 10:22:25,315 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 148 flow. Second operand 4 states and 139 transitions. [2024-11-09 10:22:25,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 386 flow [2024-11-09 10:22:25,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:25,318 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 175 flow [2024-11-09 10:22:25,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-11-09 10:22:25,318 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2024-11-09 10:22:25,319 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 175 flow [2024-11-09 10:22:25,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-09 10:22:25,319 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:25,319 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:25,324 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-09 10:22:25,519 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-09 10:22:25,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:25,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:25,520 INFO L85 PathProgramCache]: Analyzing trace with hash -412343804, now seen corresponding path program 1 times [2024-11-09 10:22:25,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:25,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939991619] [2024-11-09 10:22:25,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:25,521 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-09 10:22:25,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:25,524 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-09 10:22:25,525 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-09 10:22:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:25,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:22:25,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:25,583 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-09 10:22:25,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:25,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939991619] [2024-11-09 10:22:25,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939991619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:25,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:25,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:25,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112020623] [2024-11-09 10:22:25,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:25,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:25,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:25,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:25,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:22:25,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:25,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:25,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:22:25,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:25,792 INFO L124 PetriNetUnfolderBase]: 1158/2185 cut-off events. [2024-11-09 10:22:25,792 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2024-11-09 10:22:25,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4957 conditions, 2185 events. 1158/2185 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12673 event pairs, 599 based on Foata normal form. 12/2076 useless extension candidates. Maximal degree in co-relation 2137. Up to 1555 conditions per place. [2024-11-09 10:22:25,803 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 55 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-11-09 10:22:25,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 342 flow [2024-11-09 10:22:25,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-09 10:22:25,805 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-09 10:22:25,806 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 175 flow. Second operand 3 states and 106 transitions. [2024-11-09 10:22:25,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 342 flow [2024-11-09 10:22:25,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 337 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:25,811 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 182 flow [2024-11-09 10:22:25,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-11-09 10:22:25,812 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2024-11-09 10:22:25,812 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 182 flow [2024-11-09 10:22:25,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:25,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:25,812 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:25,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 10:22:26,012 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-09 10:22:26,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:26,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:26,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1061099091, now seen corresponding path program 1 times [2024-11-09 10:22:26,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:26,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113019878] [2024-11-09 10:22:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:26,015 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-09 10:22:26,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:26,020 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-09 10:22:26,021 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-09 10:22:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:26,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:22:26,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:26,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:26,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:26,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113019878] [2024-11-09 10:22:26,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113019878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:26,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:22:26,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-09 10:22:26,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549739668] [2024-11-09 10:22:26,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:26,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:22:26,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:26,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:22:26,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:22:26,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:22:26,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 182 flow. Second operand has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 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-09 10:22:26,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:26,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:22:26,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:31,761 INFO L124 PetriNetUnfolderBase]: 5619/10734 cut-off events. [2024-11-09 10:22:31,762 INFO L125 PetriNetUnfolderBase]: For 2728/2728 co-relation queries the response was YES. [2024-11-09 10:22:31,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24314 conditions, 10734 events. 5619/10734 cut-off events. For 2728/2728 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 76285 event pairs, 736 based on Foata normal form. 264/10371 useless extension candidates. Maximal degree in co-relation 10831. Up to 1905 conditions per place. [2024-11-09 10:22:31,832 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/387 dead transitions. [2024-11-09 10:22:31,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 387 transitions, 1861 flow [2024-11-09 10:22:31,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 10:22:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-09 10:22:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2024-11-09 10:22:31,837 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-09 10:22:31,837 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 182 flow. Second operand 20 states and 685 transitions. [2024-11-09 10:22:31,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 387 transitions, 1861 flow [2024-11-09 10:22:31,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 387 transitions, 1856 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:31,855 INFO L231 Difference]: Finished difference. Result has 92 places, 99 transitions, 598 flow [2024-11-09 10:22:31,856 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=598, PETRI_PLACES=92, PETRI_TRANSITIONS=99} [2024-11-09 10:22:31,857 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2024-11-09 10:22:31,858 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 99 transitions, 598 flow [2024-11-09 10:22:31,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 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-09 10:22:31,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:31,859 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:31,871 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-09 10:22:32,059 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-09 10:22:32,060 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:32,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:32,061 INFO L85 PathProgramCache]: Analyzing trace with hash -781759324, now seen corresponding path program 1 times [2024-11-09 10:22:32,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:32,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334123501] [2024-11-09 10:22:32,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:32,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-09 10:22:32,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:32,064 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-09 10:22:32,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 (8)] Waiting until timeout for monitored process [2024-11-09 10:22:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:32,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:22:32,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:32,232 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-09 10:22:32,253 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-09 10:22:32,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:32,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:32,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334123501] [2024-11-09 10:22:32,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334123501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:32,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:32,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:32,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198163871] [2024-11-09 10:22:32,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:32,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:32,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:32,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:32,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:32,259 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:22:32,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 99 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 10:22:32,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:32,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:22:32,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:32,795 INFO L124 PetriNetUnfolderBase]: 2678/5618 cut-off events. [2024-11-09 10:22:32,795 INFO L125 PetriNetUnfolderBase]: For 3569/3569 co-relation queries the response was YES. [2024-11-09 10:22:32,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13892 conditions, 5618 events. 2678/5618 cut-off events. For 3569/3569 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 36181 event pairs, 589 based on Foata normal form. 364/5802 useless extension candidates. Maximal degree in co-relation 13558. Up to 3210 conditions per place. [2024-11-09 10:22:32,827 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2024-11-09 10:22:32,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 615 flow [2024-11-09 10:22:32,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-09 10:22:32,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2024-11-09 10:22:32,828 INFO L175 Difference]: Start difference. First operand has 92 places, 99 transitions, 598 flow. Second operand 3 states and 94 transitions. [2024-11-09 10:22:32,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 615 flow [2024-11-09 10:22:32,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 90 transitions, 567 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-11-09 10:22:32,843 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 395 flow [2024-11-09 10:22:32,843 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2024-11-09 10:22:32,843 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-11-09 10:22:32,844 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 395 flow [2024-11-09 10:22:32,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 10:22:32,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:32,844 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:32,848 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-09 10:22:33,044 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-09 10:22:33,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:33,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:33,045 INFO L85 PathProgramCache]: Analyzing trace with hash 868213147, now seen corresponding path program 1 times [2024-11-09 10:22:33,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:33,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378997235] [2024-11-09 10:22:33,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:33,046 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-09 10:22:33,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:33,048 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-09 10:22:33,049 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-09 10:22:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:33,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:22:33,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:33,233 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-09 10:22:33,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:33,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:33,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378997235] [2024-11-09 10:22:33,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378997235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:33,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:33,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:22:33,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617981444] [2024-11-09 10:22:33,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:33,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:22:33,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:33,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:22:33,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:22:33,243 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:22:33,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 395 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:33,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:33,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:22:33,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:33,682 INFO L124 PetriNetUnfolderBase]: 2633/5407 cut-off events. [2024-11-09 10:22:33,683 INFO L125 PetriNetUnfolderBase]: For 2298/2298 co-relation queries the response was YES. [2024-11-09 10:22:33,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13642 conditions, 5407 events. 2633/5407 cut-off events. For 2298/2298 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 34486 event pairs, 1881 based on Foata normal form. 0/5250 useless extension candidates. Maximal degree in co-relation 11211. Up to 4039 conditions per place. [2024-11-09 10:22:33,705 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 65 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2024-11-09 10:22:33,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 546 flow [2024-11-09 10:22:33,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:22:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:22:33,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-11-09 10:22:33,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-11-09 10:22:33,706 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 395 flow. Second operand 4 states and 100 transitions. [2024-11-09 10:22:33,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 546 flow [2024-11-09 10:22:33,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 83 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:33,716 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 395 flow [2024-11-09 10:22:33,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=395, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2024-11-09 10:22:33,717 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2024-11-09 10:22:33,718 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 395 flow [2024-11-09 10:22:33,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:33,718 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:33,718 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:33,728 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-09 10:22:33,922 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-09 10:22:33,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:33,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1194180862, now seen corresponding path program 1 times [2024-11-09 10:22:33,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:33,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403287615] [2024-11-09 10:22:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:33,923 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-09 10:22:33,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:33,927 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-09 10:22:33,934 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-09 10:22:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:33,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 10:22:33,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:34,270 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-09 10:22:34,270 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:34,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:34,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403287615] [2024-11-09 10:22:34,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403287615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:34,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:34,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:22:34,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992333412] [2024-11-09 10:22:34,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:34,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:22:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:34,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:22:34,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:22:34,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:22:34,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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-09 10:22:34,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:34,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:22:34,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:34,925 INFO L124 PetriNetUnfolderBase]: 2709/5584 cut-off events. [2024-11-09 10:22:34,925 INFO L125 PetriNetUnfolderBase]: For 2667/2667 co-relation queries the response was YES. [2024-11-09 10:22:34,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13825 conditions, 5584 events. 2709/5584 cut-off events. For 2667/2667 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 35295 event pairs, 859 based on Foata normal form. 0/5406 useless extension candidates. Maximal degree in co-relation 11395. Up to 3583 conditions per place. [2024-11-09 10:22:34,956 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 107 selfloop transitions, 9 changer transitions 0/130 dead transitions. [2024-11-09 10:22:34,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 792 flow [2024-11-09 10:22:34,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:22:34,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:22:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-11-09 10:22:34,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-11-09 10:22:34,958 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 395 flow. Second operand 6 states and 185 transitions. [2024-11-09 10:22:34,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 792 flow [2024-11-09 10:22:34,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 130 transitions, 778 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:22:34,971 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 433 flow [2024-11-09 10:22:34,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=433, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2024-11-09 10:22:34,973 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2024-11-09 10:22:34,973 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 433 flow [2024-11-09 10:22:34,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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-09 10:22:34,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:34,973 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:34,977 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 (10)] Forceful destruction successful, exit code 0 [2024-11-09 10:22:35,174 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-09 10:22:35,174 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:35,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash -286825246, now seen corresponding path program 1 times [2024-11-09 10:22:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:35,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363378923] [2024-11-09 10:22:35,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:35,175 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-09 10:22:35,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:35,177 INFO L229 MonitoredProcess]: Starting monitored process 11 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-09 10:22:35,179 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 (11)] Waiting until timeout for monitored process [2024-11-09 10:22:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:35,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:22:35,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:35,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:35,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:35,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363378923] [2024-11-09 10:22:35,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363378923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:35,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:35,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:35,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056070672] [2024-11-09 10:22:35,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:35,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:35,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:35,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:35,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:35,262 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:22:35,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 10:22:35,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:35,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:22:35,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:35,996 INFO L124 PetriNetUnfolderBase]: 3805/7957 cut-off events. [2024-11-09 10:22:35,996 INFO L125 PetriNetUnfolderBase]: For 3931/3931 co-relation queries the response was YES. [2024-11-09 10:22:36,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19829 conditions, 7957 events. 3805/7957 cut-off events. For 3931/3931 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 55970 event pairs, 1889 based on Foata normal form. 137/7846 useless extension candidates. Maximal degree in co-relation 16740. Up to 4730 conditions per place. [2024-11-09 10:22:36,035 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 121 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2024-11-09 10:22:36,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 138 transitions, 1028 flow [2024-11-09 10:22:36,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-09 10:22:36,036 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-11-09 10:22:36,036 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 433 flow. Second operand 3 states and 107 transitions. [2024-11-09 10:22:36,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 138 transitions, 1028 flow [2024-11-09 10:22:36,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 138 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:36,052 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 442 flow [2024-11-09 10:22:36,053 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2024-11-09 10:22:36,054 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2024-11-09 10:22:36,054 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 442 flow [2024-11-09 10:22:36,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 10:22:36,054 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:36,054 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:36,059 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 (11)] Ended with exit code 0 [2024-11-09 10:22:36,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-09 10:22:36,255 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:36,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:36,256 INFO L85 PathProgramCache]: Analyzing trace with hash 740525856, now seen corresponding path program 1 times [2024-11-09 10:22:36,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:36,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644757570] [2024-11-09 10:22:36,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:36,257 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-09 10:22:36,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:36,260 INFO L229 MonitoredProcess]: Starting monitored process 12 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-09 10:22:36,261 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 (12)] Waiting until timeout for monitored process [2024-11-09 10:22:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:36,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:22:36,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:36,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:36,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:36,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644757570] [2024-11-09 10:22:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644757570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:36,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:36,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:22:36,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246184122] [2024-11-09 10:22:36,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:36,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:22:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:36,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:22:36,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:22:36,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:22:36,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 442 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-09 10:22:36,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:36,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:22:36,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:37,349 INFO L124 PetriNetUnfolderBase]: 3746/7782 cut-off events. [2024-11-09 10:22:37,349 INFO L125 PetriNetUnfolderBase]: For 5048/5048 co-relation queries the response was YES. [2024-11-09 10:22:37,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20948 conditions, 7782 events. 3746/7782 cut-off events. For 5048/5048 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 53197 event pairs, 1180 based on Foata normal form. 16/7573 useless extension candidates. Maximal degree in co-relation 17598. Up to 5140 conditions per place. [2024-11-09 10:22:37,386 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 102 selfloop transitions, 7 changer transitions 0/124 dead transitions. [2024-11-09 10:22:37,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 124 transitions, 808 flow [2024-11-09 10:22:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:22:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:22:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-11-09 10:22:37,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-09 10:22:37,387 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 442 flow. Second operand 5 states and 165 transitions. [2024-11-09 10:22:37,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 124 transitions, 808 flow [2024-11-09 10:22:37,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 124 transitions, 796 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:37,403 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 448 flow [2024-11-09 10:22:37,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=448, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2024-11-09 10:22:37,403 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 44 predicate places. [2024-11-09 10:22:37,404 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 448 flow [2024-11-09 10:22:37,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-09 10:22:37,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:37,404 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:37,414 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 (12)] Ended with exit code 0 [2024-11-09 10:22:37,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-09 10:22:37,607 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:37,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:37,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2023596201, now seen corresponding path program 1 times [2024-11-09 10:22:37,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:37,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274904050] [2024-11-09 10:22:37,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:37,609 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-09 10:22:37,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:37,611 INFO L229 MonitoredProcess]: Starting monitored process 13 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-09 10:22:37,612 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 (13)] Waiting until timeout for monitored process [2024-11-09 10:22:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:37,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 10:22:37,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:37,783 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 15 treesize of output 1 [2024-11-09 10:22:37,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 10:22:37,899 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-09 10:22:37,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:37,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:37,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274904050] [2024-11-09 10:22:37,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274904050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:37,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:37,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 10:22:37,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397296846] [2024-11-09 10:22:37,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:37,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:22:37,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:37,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:22:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:22:37,945 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:22:37,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 81 transitions, 448 flow. Second operand has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-09 10:22:37,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:37,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:22:37,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:39,400 INFO L124 PetriNetUnfolderBase]: 5266/10862 cut-off events. [2024-11-09 10:22:39,400 INFO L125 PetriNetUnfolderBase]: For 7250/7250 co-relation queries the response was YES. [2024-11-09 10:22:39,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29205 conditions, 10862 events. 5266/10862 cut-off events. For 7250/7250 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 75880 event pairs, 1414 based on Foata normal form. 0/10581 useless extension candidates. Maximal degree in co-relation 23605. Up to 5182 conditions per place. [2024-11-09 10:22:39,467 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 190 selfloop transitions, 21 changer transitions 0/226 dead transitions. [2024-11-09 10:22:39,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 226 transitions, 1496 flow [2024-11-09 10:22:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:22:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 10:22:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 396 transitions. [2024-11-09 10:22:39,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-11-09 10:22:39,471 INFO L175 Difference]: Start difference. First operand has 94 places, 81 transitions, 448 flow. Second operand 14 states and 396 transitions. [2024-11-09 10:22:39,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 226 transitions, 1496 flow [2024-11-09 10:22:39,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 226 transitions, 1476 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:22:39,499 INFO L231 Difference]: Finished difference. Result has 106 places, 90 transitions, 556 flow [2024-11-09 10:22:39,502 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=556, PETRI_PLACES=106, PETRI_TRANSITIONS=90} [2024-11-09 10:22:39,503 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 56 predicate places. [2024-11-09 10:22:39,503 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 556 flow [2024-11-09 10:22:39,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-09 10:22:39,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:39,503 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:39,508 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 (13)] Ended with exit code 0 [2024-11-09 10:22:39,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-09 10:22:39,704 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:39,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash -180184538, now seen corresponding path program 1 times [2024-11-09 10:22:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:39,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702290652] [2024-11-09 10:22:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:39,706 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-09 10:22:39,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:39,708 INFO L229 MonitoredProcess]: Starting monitored process 14 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-09 10:22:39,709 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 (14)] Waiting until timeout for monitored process [2024-11-09 10:22:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:39,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:22:39,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:39,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:39,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:39,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702290652] [2024-11-09 10:22:39,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702290652] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:39,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:22:39,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-09 10:22:39,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049109738] [2024-11-09 10:22:39,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:39,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:22:39,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:39,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:22:39,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:22:39,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:22:39,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 90 transitions, 556 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-09 10:22:39,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:39,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:22:39,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:42,320 INFO L124 PetriNetUnfolderBase]: 13641/26402 cut-off events. [2024-11-09 10:22:42,320 INFO L125 PetriNetUnfolderBase]: For 25752/25752 co-relation queries the response was YES. [2024-11-09 10:22:42,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73216 conditions, 26402 events. 13641/26402 cut-off events. For 25752/25752 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 208529 event pairs, 1455 based on Foata normal form. 1703/27509 useless extension candidates. Maximal degree in co-relation 61145. Up to 6709 conditions per place. [2024-11-09 10:22:42,525 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 311 selfloop transitions, 6 changer transitions 0/331 dead transitions. [2024-11-09 10:22:42,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 331 transitions, 2881 flow [2024-11-09 10:22:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:22:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:22:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2024-11-09 10:22:42,527 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6696969696969697 [2024-11-09 10:22:42,527 INFO L175 Difference]: Start difference. First operand has 106 places, 90 transitions, 556 flow. Second operand 6 states and 221 transitions. [2024-11-09 10:22:42,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 331 transitions, 2881 flow [2024-11-09 10:22:42,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 331 transitions, 2687 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-11-09 10:22:42,610 INFO L231 Difference]: Finished difference. Result has 107 places, 93 transitions, 548 flow [2024-11-09 10:22:42,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=548, PETRI_PLACES=107, PETRI_TRANSITIONS=93} [2024-11-09 10:22:42,611 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 57 predicate places. [2024-11-09 10:22:42,612 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 93 transitions, 548 flow [2024-11-09 10:22:42,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-09 10:22:42,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:42,612 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:42,621 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 (14)] Ended with exit code 0 [2024-11-09 10:22:42,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-09 10:22:42,816 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:42,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1650130818, now seen corresponding path program 1 times [2024-11-09 10:22:42,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:42,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615769876] [2024-11-09 10:22:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:42,817 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-09 10:22:42,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:42,820 INFO L229 MonitoredProcess]: Starting monitored process 15 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-09 10:22:42,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 10:22:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:42,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:22:42,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:43,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:43,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:43,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615769876] [2024-11-09 10:22:43,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615769876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:43,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:22:43,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-11-09 10:22:43,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978310498] [2024-11-09 10:22:43,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:43,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:22:43,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:22:43,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:22:44,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-09 10:22:44,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 93 transitions, 548 flow. Second operand has 12 states, 12 states have (on average 20.166666666666668) internal successors, (242), 12 states have internal predecessors, (242), 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-09 10:22:44,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:44,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-09 10:22:44,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:53,431 INFO L124 PetriNetUnfolderBase]: 23596/49692 cut-off events. [2024-11-09 10:22:53,431 INFO L125 PetriNetUnfolderBase]: For 68098/68098 co-relation queries the response was YES. [2024-11-09 10:22:53,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150545 conditions, 49692 events. 23596/49692 cut-off events. For 68098/68098 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 459478 event pairs, 5913 based on Foata normal form. 210/48359 useless extension candidates. Maximal degree in co-relation 86689. Up to 8212 conditions per place. [2024-11-09 10:22:53,865 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 353 selfloop transitions, 63 changer transitions 0/431 dead transitions. [2024-11-09 10:22:53,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 431 transitions, 3110 flow [2024-11-09 10:22:53,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 10:22:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-09 10:22:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 626 transitions. [2024-11-09 10:22:53,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5690909090909091 [2024-11-09 10:22:53,867 INFO L175 Difference]: Start difference. First operand has 107 places, 93 transitions, 548 flow. Second operand 20 states and 626 transitions. [2024-11-09 10:22:53,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 431 transitions, 3110 flow [2024-11-09 10:22:54,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 431 transitions, 3032 flow, removed 31 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:54,383 INFO L231 Difference]: Finished difference. Result has 140 places, 138 transitions, 1054 flow [2024-11-09 10:22:54,384 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1054, PETRI_PLACES=140, PETRI_TRANSITIONS=138} [2024-11-09 10:22:54,384 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 90 predicate places. [2024-11-09 10:22:54,384 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 138 transitions, 1054 flow [2024-11-09 10:22:54,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.166666666666668) internal successors, (242), 12 states have internal predecessors, (242), 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-09 10:22:54,385 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:54,385 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:54,389 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 (15)] Ended with exit code 0 [2024-11-09 10:22:54,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-09 10:22:54,590 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:22:54,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash -941985837, now seen corresponding path program 1 times [2024-11-09 10:22:54,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:54,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395952405] [2024-11-09 10:22:54,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:54,591 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-09 10:22:54,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:54,593 INFO L229 MonitoredProcess]: Starting monitored process 16 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-09 10:22:54,595 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 (16)] Waiting until timeout for monitored process [2024-11-09 10:22:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:54,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:22:54,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:54,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:54,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:54,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395952405] [2024-11-09 10:22:54,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395952405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:54,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:22:54,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-11-09 10:22:54,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492380662] [2024-11-09 10:22:54,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:54,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:22:54,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:54,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:22:54,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:22:54,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:22:54,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 138 transitions, 1054 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-09 10:22:54,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:54,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:22:54,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:01,369 INFO L124 PetriNetUnfolderBase]: 21740/46004 cut-off events. [2024-11-09 10:23:01,369 INFO L125 PetriNetUnfolderBase]: For 81647/81647 co-relation queries the response was YES. [2024-11-09 10:23:01,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144448 conditions, 46004 events. 21740/46004 cut-off events. For 81647/81647 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 419702 event pairs, 8430 based on Foata normal form. 25/44780 useless extension candidates. Maximal degree in co-relation 140724. Up to 33279 conditions per place. [2024-11-09 10:23:01,858 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 153 selfloop transitions, 10 changer transitions 0/179 dead transitions. [2024-11-09 10:23:01,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 179 transitions, 1565 flow [2024-11-09 10:23:01,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:23:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:23:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-11-09 10:23:01,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5963636363636363 [2024-11-09 10:23:01,861 INFO L175 Difference]: Start difference. First operand has 140 places, 138 transitions, 1054 flow. Second operand 5 states and 164 transitions. [2024-11-09 10:23:01,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 179 transitions, 1565 flow [2024-11-09 10:23:02,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 179 transitions, 1515 flow, removed 21 selfloop flow, removed 2 redundant places. [2024-11-09 10:23:02,626 INFO L231 Difference]: Finished difference. Result has 144 places, 135 transitions, 1024 flow [2024-11-09 10:23:02,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1024, PETRI_PLACES=144, PETRI_TRANSITIONS=135} [2024-11-09 10:23:02,627 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 94 predicate places. [2024-11-09 10:23:02,627 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 135 transitions, 1024 flow [2024-11-09 10:23:02,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-09 10:23:02,627 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:02,627 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:02,632 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 (16)] Ended with exit code 0 [2024-11-09 10:23:02,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-09 10:23:02,828 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:23:02,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:02,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1516650404, now seen corresponding path program 1 times [2024-11-09 10:23:02,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:23:02,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753584963] [2024-11-09 10:23:02,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:02,829 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-09 10:23:02,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:23:02,830 INFO L229 MonitoredProcess]: Starting monitored process 17 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-09 10:23:02,832 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 (17)] Waiting until timeout for monitored process [2024-11-09 10:23:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:02,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:23:02,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:23:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:02,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:23:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:03,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:23:03,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753584963] [2024-11-09 10:23:03,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753584963] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:23:03,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:23:03,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-09 10:23:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644117547] [2024-11-09 10:23:03,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:23:03,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:23:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:23:03,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:23:03,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:23:03,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-09 10:23:03,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 135 transitions, 1024 flow. Second operand has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 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-09 10:23:03,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:03,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-09 10:23:03,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:12,737 INFO L124 PetriNetUnfolderBase]: 29796/62415 cut-off events. [2024-11-09 10:23:12,737 INFO L125 PetriNetUnfolderBase]: For 124135/124153 co-relation queries the response was YES. [2024-11-09 10:23:13,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201983 conditions, 62415 events. 29796/62415 cut-off events. For 124135/124153 co-relation queries the response was YES. Maximal size of possible extension queue 923. Compared 585194 event pairs, 6690 based on Foata normal form. 560/61833 useless extension candidates. Maximal degree in co-relation 195816. Up to 14386 conditions per place. [2024-11-09 10:23:13,506 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 317 selfloop transitions, 104 changer transitions 0/437 dead transitions. [2024-11-09 10:23:13,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 437 transitions, 3645 flow [2024-11-09 10:23:13,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 10:23:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-09 10:23:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 588 transitions. [2024-11-09 10:23:13,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.593939393939394 [2024-11-09 10:23:13,508 INFO L175 Difference]: Start difference. First operand has 144 places, 135 transitions, 1024 flow. Second operand 18 states and 588 transitions. [2024-11-09 10:23:13,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 437 transitions, 3645 flow [2024-11-09 10:23:14,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 437 transitions, 3528 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-11-09 10:23:14,450 INFO L231 Difference]: Finished difference. Result has 165 places, 187 transitions, 1800 flow [2024-11-09 10:23:14,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1800, PETRI_PLACES=165, PETRI_TRANSITIONS=187} [2024-11-09 10:23:14,451 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 115 predicate places. [2024-11-09 10:23:14,451 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 187 transitions, 1800 flow [2024-11-09 10:23:14,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 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-09 10:23:14,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:14,451 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2024-11-09 10:23:14,460 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 (17)] Ended with exit code 0 [2024-11-09 10:23:14,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-09 10:23:14,652 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:23:14,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:14,653 INFO L85 PathProgramCache]: Analyzing trace with hash 615720737, now seen corresponding path program 1 times [2024-11-09 10:23:14,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:23:14,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252051183] [2024-11-09 10:23:14,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:14,653 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-09 10:23:14,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:23:14,656 INFO L229 MonitoredProcess]: Starting monitored process 18 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-09 10:23:14,657 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 (18)] Waiting until timeout for monitored process [2024-11-09 10:23:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:23:14,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:23:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:23:14,870 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:23:14,870 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:23:14,871 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-09 10:23:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-09 10:23:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-09 10:23:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-09 10:23:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-09 10:23:14,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-09 10:23:14,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-09 10:23:14,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-09 10:23:14,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-09 10:23:14,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-09 10:23:14,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-09 10:23:14,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-09 10:23:14,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-09 10:23:14,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-09 10:23:14,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-09 10:23:14,880 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 (18)] Forceful destruction successful, exit code 0 [2024-11-09 10:23:15,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-09 10:23:15,075 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:15,123 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:23:15,123 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:23:15,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:23:15 BasicIcfg [2024-11-09 10:23:15,127 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:23:15,127 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:23:15,127 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:23:15,127 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:23:15,128 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:22" (3/4) ... [2024-11-09 10:23:15,129 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:23:15,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:23:15,130 INFO L158 Benchmark]: Toolchain (without parser) took 53710.77ms. Allocated memory was 71.3MB in the beginning and 12.4GB in the end (delta: 12.3GB). Free memory was 48.9MB in the beginning and 9.8GB in the end (delta: -9.8GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-11-09 10:23:15,130 INFO L158 Benchmark]: CDTParser took 3.88ms. Allocated memory is still 71.3MB. Free memory was 47.8MB in the beginning and 47.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:23:15,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.75ms. Allocated memory was 71.3MB in the beginning and 102.8MB in the end (delta: 31.5MB). Free memory was 48.7MB in the beginning and 64.5MB in the end (delta: -15.8MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-11-09 10:23:15,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.77ms. Allocated memory is still 102.8MB. Free memory was 64.5MB in the beginning and 61.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:23:15,131 INFO L158 Benchmark]: Boogie Preprocessor took 50.40ms. Allocated memory is still 102.8MB. Free memory was 61.5MB in the beginning and 58.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:23:15,131 INFO L158 Benchmark]: RCFGBuilder took 752.95ms. Allocated memory is still 102.8MB. Free memory was 58.7MB in the beginning and 70.5MB in the end (delta: -11.9MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2024-11-09 10:23:15,131 INFO L158 Benchmark]: TraceAbstraction took 52388.48ms. Allocated memory was 102.8MB in the beginning and 12.4GB in the end (delta: 12.3GB). Free memory was 69.9MB in the beginning and 9.8GB in the end (delta: -9.8GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-11-09 10:23:15,131 INFO L158 Benchmark]: Witness Printer took 2.28ms. Allocated memory is still 12.4GB. Free memory is still 9.8GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:23:15,132 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.88ms. Allocated memory is still 71.3MB. Free memory was 47.8MB in the beginning and 47.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 464.75ms. Allocated memory was 71.3MB in the beginning and 102.8MB in the end (delta: 31.5MB). Free memory was 48.7MB in the beginning and 64.5MB in the end (delta: -15.8MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.77ms. Allocated memory is still 102.8MB. Free memory was 64.5MB in the beginning and 61.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.40ms. Allocated memory is still 102.8MB. Free memory was 61.5MB in the beginning and 58.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 752.95ms. Allocated memory is still 102.8MB. Free memory was 58.7MB in the beginning and 70.5MB in the end (delta: -11.9MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 52388.48ms. Allocated memory was 102.8MB in the beginning and 12.4GB in the end (delta: 12.3GB). Free memory was 69.9MB in the beginning and 9.8GB in the end (delta: -9.8GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 2.28ms. Allocated memory is still 12.4GB. Free memory is still 9.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=0, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=0, id2=1, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=0, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=0] [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L1007] COND TRUE 2 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] CALL 2 reach_error() [L20] COND FALSE 2 !(0) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L20] 2 __assert_fail ("0", "stack-2.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: 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: 1024]: 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 15 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: 52.2s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 44.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1718 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1674 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4319 IncrementalHoareTripleChecker+Invalid, 4382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 6 mSDtfsCounter, 4319 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1800occurred in iteration=16, InterpolantAutomatonStates: 124, 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, 2.8s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 3457 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1612 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 5/63 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-09 10:23:15,165 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