./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.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 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:15:33,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:15:33,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 17:15:34,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:15:34,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:15:34,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:15:34,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:15:34,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:15:34,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:15:34,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:15:34,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:15:34,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:15:34,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:15:34,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:15:34,036 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:15:34,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:15:34,036 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:15:34,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:15:34,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:15:34,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:15:34,037 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:15:34,038 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:15:34,039 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:15:34,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:15:34,042 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:15:34,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:15:34,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:15:34,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:15:34,043 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:15:34,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:15:34,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:15:34,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:15:34,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:15:34,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:15:34,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:15:34,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:15:34,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:15:34,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:15:34,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:15:34,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:15:34,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:15:34,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:15:34,045 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 -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2024-11-20 17:15:34,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:15:34,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:15:34,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:15:34,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:15:34,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:15:34,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-20 17:15:35,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:15:35,644 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:15:35,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-20 17:15:35,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e13e102c/2e2e1d1f836c4a689a657331a12c7ebe/FLAG725acd013 [2024-11-20 17:15:35,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e13e102c/2e2e1d1f836c4a689a657331a12c7ebe [2024-11-20 17:15:35,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:15:35,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:15:35,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:15:35,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:15:35,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:15:35,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:15:35" (1/1) ... [2024-11-20 17:15:35,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127a73a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:35, skipping insertion in model container [2024-11-20 17:15:35,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:15:35" (1/1) ... [2024-11-20 17:15:36,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:15:36,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:15:36,414 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:15:36,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:15:36,559 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:15:36,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36 WrapperNode [2024-11-20 17:15:36,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:15:36,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:15:36,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:15:36,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:15:36,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36" (1/1) ... [2024-11-20 17:15:36,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36" (1/1) ... [2024-11-20 17:15:36,646 INFO L138 Inliner]: procedures = 277, calls = 832, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 956 [2024-11-20 17:15:36,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:15:36,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:15:36,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:15:36,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:15:36,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36" (1/1) ... [2024-11-20 17:15:36,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36" (1/1) ... [2024-11-20 17:15:36,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36" (1/1) ... [2024-11-20 17:15:36,700 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 5, 802]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 5, 800]. The 1 writes are split as follows [0, 0, 1]. [2024-11-20 17:15:36,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36" (1/1) ... [2024-11-20 17:15:36,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36" (1/1) ... [2024-11-20 17:15:36,742 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36" (1/1) ... [2024-11-20 17:15:36,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36" (1/1) ... [2024-11-20 17:15:36,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36" (1/1) ... [2024-11-20 17:15:36,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36" (1/1) ... [2024-11-20 17:15:36,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:15:36,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:15:36,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:15:36,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:15:36,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36" (1/1) ... [2024-11-20 17:15:36,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:15:36,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:15:36,840 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-20 17:15:36,842 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-20 17:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-20 17:15:36,878 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-20 17:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-20 17:15:36,878 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-20 17:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-20 17:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 17:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 17:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 17:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 17:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 17:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 17:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-20 17:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 17:15:36,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 17:15:36,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 17:15:36,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:15:36,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:15:36,881 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:15:36,995 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:15:36,996 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:15:37,820 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:15:37,821 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:15:47,535 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:15:47,536 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 17:15:47,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:15:47 BoogieIcfgContainer [2024-11-20 17:15:47,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:15:47,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:15:47,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:15:47,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:15:47,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:15:35" (1/3) ... [2024-11-20 17:15:47,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71268e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:15:47, skipping insertion in model container [2024-11-20 17:15:47,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:36" (2/3) ... [2024-11-20 17:15:47,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71268e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:15:47, skipping insertion in model container [2024-11-20 17:15:47,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:15:47" (3/3) ... [2024-11-20 17:15:47,543 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2024-11-20 17:15:47,556 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:15:47,556 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-20 17:15:47,556 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:15:47,614 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-20 17:15:47,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2024-11-20 17:15:47,684 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2024-11-20 17:15:47,684 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 17:15:47,688 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-20 17:15:47,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2024-11-20 17:15:47,690 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2024-11-20 17:15:47,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:15:47,706 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;@7059cbd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:15:47,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-20 17:15:47,732 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:15:47,733 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-11-20 17:15:47,733 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 17:15:47,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:47,734 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:15:47,734 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-20 17:15:47,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:47,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1668128280, now seen corresponding path program 1 times [2024-11-20 17:15:47,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:47,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767557742] [2024-11-20 17:15:47,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:47,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:15:48,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:48,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767557742] [2024-11-20 17:15:48,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767557742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:15:48,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:15:48,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:15:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81443178] [2024-11-20 17:15:48,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:15:48,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:15:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:15:48,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:15:48,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:15:48,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-20 17:15:48,374 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-20 17:15:48,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:15:48,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-20 17:15:48,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:15:48,618 INFO L124 PetriNetUnfolderBase]: 459/880 cut-off events. [2024-11-20 17:15:48,618 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-20 17:15:48,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 880 events. 459/880 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4527 event pairs, 245 based on Foata normal form. 94/846 useless extension candidates. Maximal degree in co-relation 1574. Up to 520 conditions per place. [2024-11-20 17:15:48,626 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-11-20 17:15:48,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2024-11-20 17:15:48,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:15:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:15:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-11-20 17:15:48,637 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2024-11-20 17:15:48,639 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2024-11-20 17:15:48,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2024-11-20 17:15:48,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:15:48,645 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2024-11-20 17:15:48,647 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-20 17:15:48,650 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-11-20 17:15:48,650 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2024-11-20 17:15:48,650 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-20 17:15:48,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:48,650 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:15:48,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 17:15:48,651 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-20 17:15:48,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:48,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1668128281, now seen corresponding path program 1 times [2024-11-20 17:15:48,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:48,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003859262] [2024-11-20 17:15:48,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:48,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:49,265 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-20 17:15:49,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:49,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003859262] [2024-11-20 17:15:49,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003859262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:15:49,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:15:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:15:49,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744199191] [2024-11-20 17:15:49,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:15:49,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:15:49,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:15:49,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:15:49,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:15:49,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-20 17:15:49,286 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-20 17:15:49,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:15:49,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-20 17:15:49,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:15:49,706 INFO L124 PetriNetUnfolderBase]: 755/1387 cut-off events. [2024-11-20 17:15:49,706 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-20 17:15:49,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1387 events. 755/1387 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7466 event pairs, 125 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 810. Up to 848 conditions per place. [2024-11-20 17:15:49,713 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2024-11-20 17:15:49,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2024-11-20 17:15:49,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:15:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:15:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-11-20 17:15:49,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-11-20 17:15:49,716 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2024-11-20 17:15:49,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2024-11-20 17:15:49,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 17:15:49,718 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2024-11-20 17:15:49,718 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-20 17:15:49,719 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-20 17:15:49,719 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2024-11-20 17:15:49,719 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-20 17:15:49,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:49,719 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:15:49,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 17:15:49,720 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-20 17:15:49,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash 491241438, now seen corresponding path program 1 times [2024-11-20 17:15:49,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:49,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89976375] [2024-11-20 17:15:49,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:49,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:15:49,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:49,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89976375] [2024-11-20 17:15:49,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89976375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:15:49,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:15:49,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:15:49,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774569482] [2024-11-20 17:15:49,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:15:49,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:15:49,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:15:49,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:15:49,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:15:49,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:15:49,867 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-20 17:15:49,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:15:49,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:15:49,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:15:50,041 INFO L124 PetriNetUnfolderBase]: 668/1270 cut-off events. [2024-11-20 17:15:50,041 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2024-11-20 17:15:50,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 1270 events. 668/1270 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6582 event pairs, 181 based on Foata normal form. 34/1183 useless extension candidates. Maximal degree in co-relation 2598. Up to 721 conditions per place. [2024-11-20 17:15:50,047 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2024-11-20 17:15:50,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 376 flow [2024-11-20 17:15:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:15:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:15:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-11-20 17:15:50,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-11-20 17:15:50,049 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 5 states and 160 transitions. [2024-11-20 17:15:50,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 376 flow [2024-11-20 17:15:50,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 374 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-20 17:15:50,052 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 161 flow [2024-11-20 17:15:50,052 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-20 17:15:50,052 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-20 17:15:50,052 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 161 flow [2024-11-20 17:15:50,053 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-20 17:15:50,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:50,053 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:15:50,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 17:15:50,053 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-20 17:15:50,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1667638626, now seen corresponding path program 1 times [2024-11-20 17:15:50,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:50,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516887483] [2024-11-20 17:15:50,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:50,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:50,176 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-20 17:15:50,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:50,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516887483] [2024-11-20 17:15:50,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516887483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:15:50,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:15:50,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:15:50,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327850447] [2024-11-20 17:15:50,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:15:50,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:15:50,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:15:50,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:15:50,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:15:50,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:15:50,178 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-20 17:15:50,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:15:50,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:15:50,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:15:50,389 INFO L124 PetriNetUnfolderBase]: 976/1831 cut-off events. [2024-11-20 17:15:50,390 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2024-11-20 17:15:50,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4033 conditions, 1831 events. 976/1831 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 9772 event pairs, 469 based on Foata normal form. 0/1699 useless extension candidates. Maximal degree in co-relation 3362. Up to 1060 conditions per place. [2024-11-20 17:15:50,399 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 73 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2024-11-20 17:15:50,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 429 flow [2024-11-20 17:15:50,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:15:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:15:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-11-20 17:15:50,402 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2024-11-20 17:15:50,403 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 161 flow. Second operand 4 states and 139 transitions. [2024-11-20 17:15:50,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 429 flow [2024-11-20 17:15:50,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 429 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 17:15:50,407 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 197 flow [2024-11-20 17:15:50,407 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-20 17:15:50,409 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-20 17:15:50,409 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 197 flow [2024-11-20 17:15:50,409 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-20 17:15:50,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:50,409 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:15:50,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 17:15:50,410 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-20 17:15:50,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:50,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1862289814, now seen corresponding path program 1 times [2024-11-20 17:15:50,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:50,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858769614] [2024-11-20 17:15:50,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:50,498 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-20 17:15:50,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:50,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858769614] [2024-11-20 17:15:50,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858769614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:15:50,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:15:50,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:15:50,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627940585] [2024-11-20 17:15:50,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:15:50,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:15:50,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:15:50,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:15:50,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:15:50,502 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:15:50,502 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-20 17:15:50,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:15:50,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:15:50,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:15:50,683 INFO L124 PetriNetUnfolderBase]: 1100/2025 cut-off events. [2024-11-20 17:15:50,684 INFO L125 PetriNetUnfolderBase]: For 573/573 co-relation queries the response was YES. [2024-11-20 17:15:50,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4879 conditions, 2025 events. 1100/2025 cut-off events. For 573/573 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10913 event pairs, 511 based on Foata normal form. 22/1918 useless extension candidates. Maximal degree in co-relation 4019. Up to 1290 conditions per place. [2024-11-20 17:15:50,694 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 62 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-11-20 17:15:50,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 397 flow [2024-11-20 17:15:50,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:15:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:15:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-20 17:15:50,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-20 17:15:50,696 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 197 flow. Second operand 3 states and 106 transitions. [2024-11-20 17:15:50,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 397 flow [2024-11-20 17:15:50,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 391 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-20 17:15:50,702 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 203 flow [2024-11-20 17:15:50,702 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-20 17:15:50,702 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-11-20 17:15:50,703 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 203 flow [2024-11-20 17:15:50,703 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-20 17:15:50,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:50,703 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:15:50,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 17:15:50,703 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-20 17:15:50,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:50,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1621197331, now seen corresponding path program 1 times [2024-11-20 17:15:50,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:50,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597378487] [2024-11-20 17:15:50,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:50,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:50,962 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-20 17:15:50,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:50,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597378487] [2024-11-20 17:15:50,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597378487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:15:50,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:15:50,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:15:50,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258976749] [2024-11-20 17:15:50,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:15:50,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:15:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:15:50,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:15:50,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:15:50,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-20 17:15:50,966 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-20 17:15:50,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:15:50,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-20 17:15:50,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:15:51,125 INFO L124 PetriNetUnfolderBase]: 1006/1847 cut-off events. [2024-11-20 17:15:51,126 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2024-11-20 17:15:51,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4361 conditions, 1847 events. 1006/1847 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9843 event pairs, 361 based on Foata normal form. 12/1735 useless extension candidates. Maximal degree in co-relation 3862. Up to 1410 conditions per place. [2024-11-20 17:15:51,135 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 49 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-20 17:15:51,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 313 flow [2024-11-20 17:15:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:15:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:15:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-20 17:15:51,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-11-20 17:15:51,136 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 203 flow. Second operand 3 states and 96 transitions. [2024-11-20 17:15:51,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 313 flow [2024-11-20 17:15:51,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 303 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-20 17:15:51,138 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 180 flow [2024-11-20 17:15:51,138 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-20 17:15:51,139 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2024-11-20 17:15:51,139 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 180 flow [2024-11-20 17:15:51,139 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-20 17:15:51,139 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:51,140 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:15:51,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 17:15:51,140 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-20 17:15:51,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash 952426321, now seen corresponding path program 1 times [2024-11-20 17:15:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:51,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579917277] [2024-11-20 17:15:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:51,583 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-20 17:15:51,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:51,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579917277] [2024-11-20 17:15:51,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579917277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:15:51,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187470771] [2024-11-20 17:15:51,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:51,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:15:51,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:15:51,586 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-20 17:15:51,587 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-20 17:15:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:51,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 1758 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-20 17:15:51,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:15:51,975 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-20 17:15:51,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:15:52,081 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-20 17:15:52,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187470771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:15:52,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:15:52,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-11-20 17:15:52,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720882091] [2024-11-20 17:15:52,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:15:52,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 17:15:52,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:15:52,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 17:15:52,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-20 17:15:52,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-20 17:15:52,213 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-20 17:15:52,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:15:52,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-20 17:15:52,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:15:53,494 INFO L124 PetriNetUnfolderBase]: 4128/7712 cut-off events. [2024-11-20 17:15:53,494 INFO L125 PetriNetUnfolderBase]: For 2487/2487 co-relation queries the response was YES. [2024-11-20 17:15:53,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17854 conditions, 7712 events. 4128/7712 cut-off events. For 2487/2487 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 50391 event pairs, 309 based on Foata normal form. 192/7387 useless extension candidates. Maximal degree in co-relation 7413. Up to 1423 conditions per place. [2024-11-20 17:15:53,547 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/386 dead transitions. [2024-11-20 17:15:53,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 386 transitions, 1892 flow [2024-11-20 17:15:53,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 17:15:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-20 17:15:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2024-11-20 17:15:53,550 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-20 17:15:53,550 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 180 flow. Second operand 20 states and 685 transitions. [2024-11-20 17:15:53,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 386 transitions, 1892 flow [2024-11-20 17:15:53,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 386 transitions, 1850 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-11-20 17:15:53,560 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 592 flow [2024-11-20 17:15:53,561 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-20 17:15:53,561 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2024-11-20 17:15:53,562 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 592 flow [2024-11-20 17:15:53,562 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-20 17:15:53,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:53,562 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-20 17:15:53,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 17:15:53,765 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-20 17:15:53,766 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-20 17:15:53,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash 402194878, now seen corresponding path program 1 times [2024-11-20 17:15:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:53,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802305770] [2024-11-20 17:15:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:53,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:54,080 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-20 17:15:54,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:54,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802305770] [2024-11-20 17:15:54,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802305770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:15:54,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:15:54,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:15:54,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131669209] [2024-11-20 17:15:54,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:15:54,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:15:54,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:15:54,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:15:54,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:15:54,082 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:15:54,082 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-20 17:15:54,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:15:54,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:15:54,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:15:54,482 INFO L124 PetriNetUnfolderBase]: 1833/3824 cut-off events. [2024-11-20 17:15:54,483 INFO L125 PetriNetUnfolderBase]: For 2280/2280 co-relation queries the response was YES. [2024-11-20 17:15:54,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9375 conditions, 3824 events. 1833/3824 cut-off events. For 2280/2280 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 22372 event pairs, 372 based on Foata normal form. 234/3899 useless extension candidates. Maximal degree in co-relation 9173. Up to 2311 conditions per place. [2024-11-20 17:15:54,504 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2024-11-20 17:15:54,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 609 flow [2024-11-20 17:15:54,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:15:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:15:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-20 17:15:54,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2024-11-20 17:15:54,508 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 592 flow. Second operand 3 states and 94 transitions. [2024-11-20 17:15:54,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 609 flow [2024-11-20 17:15:54,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 561 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-11-20 17:15:54,518 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 389 flow [2024-11-20 17:15:54,518 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-20 17:15:54,520 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-11-20 17:15:54,520 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 389 flow [2024-11-20 17:15:54,520 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-20 17:15:54,520 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:54,520 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-20 17:15:54,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 17:15:54,521 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-20 17:15:54,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:54,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1021159314, now seen corresponding path program 1 times [2024-11-20 17:15:54,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:54,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687473291] [2024-11-20 17:15:54,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:54,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-20 17:15:54,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687473291] [2024-11-20 17:15:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687473291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:15:54,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:15:54,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:15:54,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733692701] [2024-11-20 17:15:54,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:15:54,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:15:54,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:15:54,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:15:54,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:15:54,769 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-20 17:15:54,770 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-20 17:15:54,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:15:54,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-20 17:15:54,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:15:55,182 INFO L124 PetriNetUnfolderBase]: 1838/3722 cut-off events. [2024-11-20 17:15:55,182 INFO L125 PetriNetUnfolderBase]: For 1504/1504 co-relation queries the response was YES. [2024-11-20 17:15:55,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9355 conditions, 3722 events. 1838/3722 cut-off events. For 1504/1504 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21481 event pairs, 1002 based on Foata normal form. 0/3593 useless extension candidates. Maximal degree in co-relation 7886. Up to 2166 conditions per place. [2024-11-20 17:15:55,204 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 56 selfloop transitions, 18 changer transitions 0/88 dead transitions. [2024-11-20 17:15:55,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 88 transitions, 565 flow [2024-11-20 17:15:55,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:15:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:15:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-11-20 17:15:55,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44363636363636366 [2024-11-20 17:15:55,206 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 389 flow. Second operand 5 states and 122 transitions. [2024-11-20 17:15:55,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 88 transitions, 565 flow [2024-11-20 17:15:55,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 88 transitions, 561 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:15:55,214 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 419 flow [2024-11-20 17:15:55,214 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-20 17:15:55,215 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2024-11-20 17:15:55,215 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 419 flow [2024-11-20 17:15:55,215 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-20 17:15:55,215 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:55,215 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-20 17:15:55,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 17:15:55,216 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-20 17:15:55,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2146835729, now seen corresponding path program 1 times [2024-11-20 17:15:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:55,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400478515] [2024-11-20 17:15:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:55,733 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-20 17:15:55,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400478515] [2024-11-20 17:15:55,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400478515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:15:55,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:15:55,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:15:55,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244952283] [2024-11-20 17:15:55,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:15:55,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:15:55,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:15:55,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:15:55,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:15:55,754 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-20 17:15:55,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 419 flow. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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-20 17:15:55,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:15:55,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-20 17:15:55,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:15:56,139 INFO L124 PetriNetUnfolderBase]: 1961/3989 cut-off events. [2024-11-20 17:15:56,140 INFO L125 PetriNetUnfolderBase]: For 2208/2208 co-relation queries the response was YES. [2024-11-20 17:15:56,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10043 conditions, 3989 events. 1961/3989 cut-off events. For 2208/2208 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 23119 event pairs, 461 based on Foata normal form. 0/3825 useless extension candidates. Maximal degree in co-relation 8539. Up to 2936 conditions per place. [2024-11-20 17:15:56,159 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 105 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2024-11-20 17:15:56,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 126 transitions, 806 flow [2024-11-20 17:15:56,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 17:15:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 17:15:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2024-11-20 17:15:56,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5116883116883116 [2024-11-20 17:15:56,160 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 419 flow. Second operand 7 states and 197 transitions. [2024-11-20 17:15:56,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 126 transitions, 806 flow [2024-11-20 17:15:56,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 126 transitions, 762 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:15:56,167 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 440 flow [2024-11-20 17:15:56,167 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2024-11-20 17:15:56,168 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2024-11-20 17:15:56,168 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 440 flow [2024-11-20 17:15:56,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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-20 17:15:56,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:56,168 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-20 17:15:56,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 17:15:56,169 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-20 17:15:56,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1064566788, now seen corresponding path program 1 times [2024-11-20 17:15:56,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:56,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776186943] [2024-11-20 17:15:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:56,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:56,249 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-20 17:15:56,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:56,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776186943] [2024-11-20 17:15:56,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776186943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:15:56,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:15:56,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:15:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326373042] [2024-11-20 17:15:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:15:56,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:15:56,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:15:56,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:15:56,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:15:56,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:15:56,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 440 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-20 17:15:56,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:15:56,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:15:56,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:15:56,729 INFO L124 PetriNetUnfolderBase]: 2879/6062 cut-off events. [2024-11-20 17:15:56,729 INFO L125 PetriNetUnfolderBase]: For 3110/3110 co-relation queries the response was YES. [2024-11-20 17:15:56,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15006 conditions, 6062 events. 2879/6062 cut-off events. For 3110/3110 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 40536 event pairs, 1373 based on Foata normal form. 137/5973 useless extension candidates. Maximal degree in co-relation 12979. Up to 3403 conditions per place. [2024-11-20 17:15:56,759 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 124 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2024-11-20 17:15:56,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 140 transitions, 1050 flow [2024-11-20 17:15:56,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:15:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:15:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-20 17:15:56,760 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-11-20 17:15:56,760 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 440 flow. Second operand 3 states and 107 transitions. [2024-11-20 17:15:56,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 140 transitions, 1050 flow [2024-11-20 17:15:56,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 140 transitions, 1038 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 17:15:56,771 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 445 flow [2024-11-20 17:15:56,772 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-20 17:15:56,772 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2024-11-20 17:15:56,772 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 445 flow [2024-11-20 17:15:56,772 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-20 17:15:56,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:56,773 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-20 17:15:56,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 17:15:56,773 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-20 17:15:56,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:56,773 INFO L85 PathProgramCache]: Analyzing trace with hash -26869291, now seen corresponding path program 1 times [2024-11-20 17:15:56,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:56,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756480536] [2024-11-20 17:15:56,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:56,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:15:56,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756480536] [2024-11-20 17:15:56,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756480536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:15:56,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:15:56,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:15:56,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497042108] [2024-11-20 17:15:56,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:15:56,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:15:56,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:15:56,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:15:56,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:15:56,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:15:56,914 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-20 17:15:56,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:15:56,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:15:56,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:15:57,473 INFO L124 PetriNetUnfolderBase]: 3194/6486 cut-off events. [2024-11-20 17:15:57,473 INFO L125 PetriNetUnfolderBase]: For 4318/4318 co-relation queries the response was YES. [2024-11-20 17:15:57,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17919 conditions, 6486 events. 3194/6486 cut-off events. For 4318/4318 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 42431 event pairs, 475 based on Foata normal form. 105/6409 useless extension candidates. Maximal degree in co-relation 14839. Up to 2632 conditions per place. [2024-11-20 17:15:57,502 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 109 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2024-11-20 17:15:57,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 133 transitions, 930 flow [2024-11-20 17:15:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:15:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:15:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-11-20 17:15:57,503 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5527272727272727 [2024-11-20 17:15:57,504 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 445 flow. Second operand 5 states and 152 transitions. [2024-11-20 17:15:57,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 133 transitions, 930 flow [2024-11-20 17:15:57,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 923 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-20 17:15:57,515 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 519 flow [2024-11-20 17:15:57,515 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-20 17:15:57,516 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2024-11-20 17:15:57,516 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 519 flow [2024-11-20 17:15:57,516 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-20 17:15:57,516 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:57,516 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-20 17:15:57,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 17:15:57,516 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-20 17:15:57,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:57,517 INFO L85 PathProgramCache]: Analyzing trace with hash -716823146, now seen corresponding path program 1 times [2024-11-20 17:15:57,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:57,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365435678] [2024-11-20 17:15:57,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:15:58,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:58,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365435678] [2024-11-20 17:15:58,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365435678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:15:58,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:15:58,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:15:58,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137155161] [2024-11-20 17:15:58,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:15:58,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:15:58,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:15:58,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:15:58,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:15:58,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:15:58,661 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-20 17:15:58,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:15:58,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:15:58,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:15:59,594 INFO L124 PetriNetUnfolderBase]: 4726/9653 cut-off events. [2024-11-20 17:15:59,594 INFO L125 PetriNetUnfolderBase]: For 8702/8702 co-relation queries the response was YES. [2024-11-20 17:15:59,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26990 conditions, 9653 events. 4726/9653 cut-off events. For 8702/8702 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 67192 event pairs, 1022 based on Foata normal form. 24/9463 useless extension candidates. Maximal degree in co-relation 21485. Up to 4678 conditions per place. [2024-11-20 17:15:59,657 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 181 selfloop transitions, 24 changer transitions 0/219 dead transitions. [2024-11-20 17:15:59,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 219 transitions, 1565 flow [2024-11-20 17:15:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 17:15:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-20 17:15:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 316 transitions. [2024-11-20 17:15:59,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5223140495867769 [2024-11-20 17:15:59,659 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 519 flow. Second operand 11 states and 316 transitions. [2024-11-20 17:15:59,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 219 transitions, 1565 flow [2024-11-20 17:15:59,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 219 transitions, 1563 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:15:59,689 INFO L231 Difference]: Finished difference. Result has 111 places, 105 transitions, 733 flow [2024-11-20 17:15:59,689 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=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=733, PETRI_PLACES=111, PETRI_TRANSITIONS=105} [2024-11-20 17:15:59,689 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 61 predicate places. [2024-11-20 17:15:59,690 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 105 transitions, 733 flow [2024-11-20 17:15:59,690 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-20 17:15:59,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:15:59,690 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-20 17:15:59,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 17:15:59,690 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-20 17:15:59,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:15:59,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1731689586, now seen corresponding path program 1 times [2024-11-20 17:15:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:15:59,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182942340] [2024-11-20 17:15:59,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:59,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:15:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:15:59,839 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-20 17:15:59,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:15:59,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182942340] [2024-11-20 17:15:59,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182942340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:15:59,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010659700] [2024-11-20 17:15:59,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:15:59,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:15:59,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:15:59,842 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-20 17:15:59,868 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-20 17:16:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:00,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 1794 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:16:00,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:00,105 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-20 17:16:00,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:16:00,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010659700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:16:00,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:16:00,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-11-20 17:16:00,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308406011] [2024-11-20 17:16:00,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:16:00,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:16:00,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:16:00,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:16:00,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:16:00,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-20 17:16:00,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 105 transitions, 733 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-20 17:16:00,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:00,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-20 17:16:00,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:00,752 INFO L124 PetriNetUnfolderBase]: 4723/9547 cut-off events. [2024-11-20 17:16:00,752 INFO L125 PetriNetUnfolderBase]: For 11746/11746 co-relation queries the response was YES. [2024-11-20 17:16:00,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28269 conditions, 9547 events. 4723/9547 cut-off events. For 11746/11746 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 67477 event pairs, 3763 based on Foata normal form. 31/9348 useless extension candidates. Maximal degree in co-relation 22580. Up to 8111 conditions per place. [2024-11-20 17:16:00,807 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 89 selfloop transitions, 1 changer transitions 2/104 dead transitions. [2024-11-20 17:16:00,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 913 flow [2024-11-20 17:16:00,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:16:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:16:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-20 17:16:00,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-11-20 17:16:00,808 INFO L175 Difference]: Start difference. First operand has 111 places, 105 transitions, 733 flow. Second operand 3 states and 80 transitions. [2024-11-20 17:16:00,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 104 transitions, 913 flow [2024-11-20 17:16:00,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 104 transitions, 895 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-20 17:16:00,838 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 710 flow [2024-11-20 17:16:00,838 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-20 17:16:00,838 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 59 predicate places. [2024-11-20 17:16:00,838 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 710 flow [2024-11-20 17:16:00,839 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-20 17:16:00,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:00,839 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-20 17:16:00,848 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-20 17:16:01,039 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-20 17:16:01,039 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-20 17:16:01,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash -243320473, now seen corresponding path program 1 times [2024-11-20 17:16:01,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:16:01,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305053491] [2024-11-20 17:16:01,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:01,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:16:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:01,532 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-20 17:16:01,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:16:01,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305053491] [2024-11-20 17:16:01,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305053491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:16:01,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759912381] [2024-11-20 17:16:01,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:01,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:16:01,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:16:01,534 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-20 17:16:01,535 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-20 17:16:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:01,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 1839 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 17:16:01,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:01,954 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-20 17:16:01,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:16:02,107 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-20 17:16:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759912381] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:16:02,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:16:02,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2024-11-20 17:16:02,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159274643] [2024-11-20 17:16:02,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:16:02,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 17:16:02,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:16:02,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 17:16:02,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-20 17:16:02,179 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-20 17:16:02,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 710 flow. Second operand has 18 states, 18 states have (on average 20.166666666666668) internal successors, (363), 18 states have internal predecessors, (363), 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-20 17:16:02,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:02,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-20 17:16:02,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:04,414 INFO L124 PetriNetUnfolderBase]: 9891/19922 cut-off events. [2024-11-20 17:16:04,414 INFO L125 PetriNetUnfolderBase]: For 24100/24100 co-relation queries the response was YES. [2024-11-20 17:16:04,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58590 conditions, 19922 events. 9891/19922 cut-off events. For 24100/24100 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 154721 event pairs, 1511 based on Foata normal form. 181/19617 useless extension candidates. Maximal degree in co-relation 58548. Up to 3188 conditions per place. [2024-11-20 17:16:04,508 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 357 selfloop transitions, 91 changer transitions 0/459 dead transitions. [2024-11-20 17:16:04,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 459 transitions, 3593 flow [2024-11-20 17:16:04,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 17:16:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-20 17:16:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 638 transitions. [2024-11-20 17:16:04,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-11-20 17:16:04,511 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 710 flow. Second operand 21 states and 638 transitions. [2024-11-20 17:16:04,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 459 transitions, 3593 flow [2024-11-20 17:16:04,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 459 transitions, 3590 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-20 17:16:04,567 INFO L231 Difference]: Finished difference. Result has 142 places, 167 transitions, 1658 flow [2024-11-20 17:16:04,567 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=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1658, PETRI_PLACES=142, PETRI_TRANSITIONS=167} [2024-11-20 17:16:04,568 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 92 predicate places. [2024-11-20 17:16:04,569 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 167 transitions, 1658 flow [2024-11-20 17:16:04,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 20.166666666666668) internal successors, (363), 18 states have internal predecessors, (363), 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-20 17:16:04,569 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:04,570 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-20 17:16:04,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 17:16:04,770 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-20 17:16:04,770 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-20 17:16:04,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:04,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1208330688, now seen corresponding path program 1 times [2024-11-20 17:16:04,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:16:04,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738987973] [2024-11-20 17:16:04,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:04,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:16:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:04,982 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-20 17:16:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:16:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738987973] [2024-11-20 17:16:04,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738987973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:16:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760146033] [2024-11-20 17:16:04,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:04,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:16:04,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:16:04,984 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-20 17:16:04,985 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-20 17:16:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:05,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 1836 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 17:16:05,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:05,261 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-20 17:16:05,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:16:05,292 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-20 17:16:05,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760146033] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:16:05,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:16:05,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-20 17:16:05,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418322506] [2024-11-20 17:16:05,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:16:05,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:16:05,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:16:05,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:16:05,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:16:05,293 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:16:05,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 167 transitions, 1658 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-20 17:16:05,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:05,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:16:05,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:06,980 INFO L124 PetriNetUnfolderBase]: 8507/17296 cut-off events. [2024-11-20 17:16:06,981 INFO L125 PetriNetUnfolderBase]: For 38133/38133 co-relation queries the response was YES. [2024-11-20 17:16:07,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55240 conditions, 17296 events. 8507/17296 cut-off events. For 38133/38133 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 127468 event pairs, 2450 based on Foata normal form. 14/16895 useless extension candidates. Maximal degree in co-relation 55181. Up to 12999 conditions per place. [2024-11-20 17:16:07,098 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 171 selfloop transitions, 13 changer transitions 0/196 dead transitions. [2024-11-20 17:16:07,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 196 transitions, 2058 flow [2024-11-20 17:16:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:16:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:16:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-11-20 17:16:07,099 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-20 17:16:07,099 INFO L175 Difference]: Start difference. First operand has 142 places, 167 transitions, 1658 flow. Second operand 5 states and 165 transitions. [2024-11-20 17:16:07,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 196 transitions, 2058 flow [2024-11-20 17:16:07,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 196 transitions, 1957 flow, removed 46 selfloop flow, removed 3 redundant places. [2024-11-20 17:16:07,215 INFO L231 Difference]: Finished difference. Result has 145 places, 152 transitions, 1446 flow [2024-11-20 17:16:07,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1446, PETRI_PLACES=145, PETRI_TRANSITIONS=152} [2024-11-20 17:16:07,216 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 95 predicate places. [2024-11-20 17:16:07,216 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 152 transitions, 1446 flow [2024-11-20 17:16:07,216 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-20 17:16:07,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:07,216 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-20 17:16:07,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 17:16:07,420 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-20 17:16:07,420 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-20 17:16:07,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:07,421 INFO L85 PathProgramCache]: Analyzing trace with hash -184443234, now seen corresponding path program 1 times [2024-11-20 17:16:07,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:16:07,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971250226] [2024-11-20 17:16:07,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:07,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:16:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:16:07,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:16:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:16:07,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 17:16:07,580 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:16:07,581 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-20 17:16:07,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-20 17:16:07,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-20 17:16:07,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-20 17:16:07,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-20 17:16:07,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-20 17:16:07,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-20 17:16:07,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-20 17:16:07,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-20 17:16:07,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-20 17:16:07,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-20 17:16:07,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-20 17:16:07,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-20 17:16:07,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-20 17:16:07,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-20 17:16:07,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 17:16:07,584 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-20 17:16:07,657 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:16:07,659 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:16:07,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:16:07 BasicIcfg [2024-11-20 17:16:07,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:16:07,663 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:16:07,663 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:16:07,663 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:16:07,664 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:15:47" (3/4) ... [2024-11-20 17:16:07,665 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:16:07,666 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:16:07,667 INFO L158 Benchmark]: Toolchain (without parser) took 31679.49ms. Allocated memory was 172.0MB in the beginning and 12.3GB in the end (delta: 12.1GB). Free memory was 138.5MB in the beginning and 11.3GB in the end (delta: -11.1GB). Peak memory consumption was 957.6MB. Max. memory is 16.1GB. [2024-11-20 17:16:07,667 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 123.7MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:16:07,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.37ms. Allocated memory is still 172.0MB. Free memory was 138.5MB in the beginning and 97.8MB in the end (delta: 40.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-20 17:16:07,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.72ms. Allocated memory is still 172.0MB. Free memory was 97.1MB in the beginning and 88.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 17:16:07,668 INFO L158 Benchmark]: Boogie Preprocessor took 116.71ms. Allocated memory is still 172.0MB. Free memory was 88.0MB in the beginning and 134.3MB in the end (delta: -46.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-11-20 17:16:07,668 INFO L158 Benchmark]: RCFGBuilder took 10772.55ms. Allocated memory was 172.0MB in the beginning and 11.4GB in the end (delta: 11.2GB). Free memory was 134.3MB in the beginning and 11.1GB in the end (delta: -11.0GB). Peak memory consumption was 802.7MB. Max. memory is 16.1GB. [2024-11-20 17:16:07,668 INFO L158 Benchmark]: TraceAbstraction took 20124.70ms. Allocated memory was 11.4GB in the beginning and 12.3GB in the end (delta: 857.7MB). Free memory was 11.1GB in the beginning and 11.3GB in the end (delta: -147.3MB). Peak memory consumption was 710.5MB. Max. memory is 16.1GB. [2024-11-20 17:16:07,668 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 12.3GB. Free memory was 11.3GB in the beginning and 11.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:16:07,669 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.12ms. Allocated memory is still 123.7MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 572.37ms. Allocated memory is still 172.0MB. Free memory was 138.5MB in the beginning and 97.8MB in the end (delta: 40.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.72ms. Allocated memory is still 172.0MB. Free memory was 97.1MB in the beginning and 88.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.71ms. Allocated memory is still 172.0MB. Free memory was 88.0MB in the beginning and 134.3MB in the end (delta: -46.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * RCFGBuilder took 10772.55ms. Allocated memory was 172.0MB in the beginning and 11.4GB in the end (delta: 11.2GB). Free memory was 134.3MB in the beginning and 11.1GB in the end (delta: -11.0GB). Peak memory consumption was 802.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20124.70ms. Allocated memory was 11.4GB in the beginning and 12.3GB in the end (delta: 857.7MB). Free memory was 11.1GB in the beginning and 11.3GB in the end (delta: -147.3MB). Peak memory consumption was 710.5MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 12.3GB. Free memory was 11.3GB in the beginning and 11.3GB 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[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [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); [L1020] 0 pthread_t id1, id2; [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-3, m={4:0}, top=0] [L989] 1 int i; [L990] 1 unsigned int tmp; [L991] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L991] COND TRUE 1 i<(800) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-3, id2=-2, m={4:0}, top=0] [L1005] 2 int i; [L1006] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L994] 1 tmp = __VERIFIER_nondet_uint() [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x [L969] CALL 1 inc_top() [L945] 1 top++ [L969] RET 1 inc_top() [L971] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=799, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=799] [L1006] COND TRUE 2 i<(800) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=1] [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) [L998] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=799, top=1] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) [L982] CALL 2 dec_top() [L949] 2 top-- [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] [L983] 2 return stack[get_top()]; [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1006] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 [L978] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) [L1012] 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_longest-1.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1018]: 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: 1022]: 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.0s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1508 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1454 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4550 IncrementalHoareTripleChecker+Invalid, 4593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 13 mSDtfsCounter, 4550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1658occurred in iteration=15, InterpolantAutomatonStates: 108, 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, 1.2s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 3884 SizeOfPredicates, 14 NumberOfNonLiveVariables, 7227 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 7/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-20 17:16:07,699 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.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 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:16:09,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:16:09,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 17:16:09,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:16:09,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:16:09,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:16:09,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:16:09,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:16:09,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:16:09,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:16:09,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:16:09,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:16:09,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:16:09,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:16:09,808 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:16:09,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:16:09,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:16:09,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:16:09,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:16:09,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:16:09,811 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:16:09,811 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:16:09,811 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:16:09,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:16:09,814 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:16:09,814 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 17:16:09,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:16:09,815 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 17:16:09,815 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:16:09,815 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:16:09,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:16:09,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:16:09,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:16:09,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:16:09,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:16:09,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:16:09,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:16:09,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:16:09,816 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 17:16:09,816 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 17:16:09,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:16:09,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:16:09,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:16:09,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:16:09,817 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 -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2024-11-20 17:16:10,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:16:10,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:16:10,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:16:10,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:16:10,085 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:16:10,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-20 17:16:11,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:16:11,511 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:16:11,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-20 17:16:11,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f275ab49/2af2ffc7597340779266d56afdd8d29a/FLAGfe45136be [2024-11-20 17:16:11,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f275ab49/2af2ffc7597340779266d56afdd8d29a [2024-11-20 17:16:11,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:16:11,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:16:11,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:16:11,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:16:11,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:16:11,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:16:11" (1/1) ... [2024-11-20 17:16:11,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c6a5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:11, skipping insertion in model container [2024-11-20 17:16:11,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:16:11" (1/1) ... [2024-11-20 17:16:11,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:16:11,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:16:12,021 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:16:12,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:16:12,187 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:16:12,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12 WrapperNode [2024-11-20 17:16:12,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:16:12,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:16:12,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:16:12,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:16:12,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12" (1/1) ... [2024-11-20 17:16:12,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12" (1/1) ... [2024-11-20 17:16:12,274 INFO L138 Inliner]: procedures = 281, calls = 832, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 952 [2024-11-20 17:16:12,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:16:12,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:16:12,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:16:12,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:16:12,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12" (1/1) ... [2024-11-20 17:16:12,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12" (1/1) ... [2024-11-20 17:16:12,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12" (1/1) ... [2024-11-20 17:16:12,311 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 5, 802]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 5, 800]. The 1 writes are split as follows [0, 0, 1]. [2024-11-20 17:16:12,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12" (1/1) ... [2024-11-20 17:16:12,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12" (1/1) ... [2024-11-20 17:16:12,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12" (1/1) ... [2024-11-20 17:16:12,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12" (1/1) ... [2024-11-20 17:16:12,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12" (1/1) ... [2024-11-20 17:16:12,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12" (1/1) ... [2024-11-20 17:16:12,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:16:12,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:16:12,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:16:12,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:16:12,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12" (1/1) ... [2024-11-20 17:16:12,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:16:12,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:16:12,378 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-20 17:16:12,381 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-20 17:16:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 17:16:12,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 17:16:12,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 17:16:12,418 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-20 17:16:12,418 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-20 17:16:12,418 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-20 17:16:12,418 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-20 17:16:12,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 17:16:12,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 17:16:12,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 17:16:12,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 17:16:12,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 17:16:12,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 17:16:12,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-20 17:16:12,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-20 17:16:12,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-20 17:16:12,420 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-20 17:16:12,420 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-20 17:16:12,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:16:12,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:16:12,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:16:12,423 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:16:12,549 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:16:12,550 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:16:13,650 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:16:13,651 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:16:31,682 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:16:31,683 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 17:16:31,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:16:31 BoogieIcfgContainer [2024-11-20 17:16:31,683 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:16:31,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:16:31,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:16:31,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:16:31,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:16:11" (1/3) ... [2024-11-20 17:16:31,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed27b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:16:31, skipping insertion in model container [2024-11-20 17:16:31,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:16:12" (2/3) ... [2024-11-20 17:16:31,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed27b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:16:31, skipping insertion in model container [2024-11-20 17:16:31,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:16:31" (3/3) ... [2024-11-20 17:16:31,691 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2024-11-20 17:16:31,704 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:16:31,704 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-20 17:16:31,704 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:16:31,787 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-20 17:16:31,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2024-11-20 17:16:31,876 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2024-11-20 17:16:31,876 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 17:16:31,880 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 130 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-20 17:16:31,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2024-11-20 17:16:31,883 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2024-11-20 17:16:31,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:16:31,898 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;@5fdd9981, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:16:31,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-20 17:16:31,931 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:16:31,931 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-11-20 17:16:31,931 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 17:16:31,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:31,933 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:16:31,933 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-20 17:16:31,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:31,937 INFO L85 PathProgramCache]: Analyzing trace with hash 120974649, now seen corresponding path program 1 times [2024-11-20 17:16:31,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:16:31,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116590915] [2024-11-20 17:16:31,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:31,951 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-20 17:16:31,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:16:31,954 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-20 17:16:31,955 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-20 17:16:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:32,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:16:32,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:16:32,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:16:32,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:16:32,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116590915] [2024-11-20 17:16:32,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116590915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:16:32,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:16:32,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:16:32,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298504500] [2024-11-20 17:16:32,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:16:32,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:16:32,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:16:32,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:16:32,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:16:32,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-20 17:16:32,349 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-20 17:16:32,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:32,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-20 17:16:32,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:32,759 INFO L124 PetriNetUnfolderBase]: 459/880 cut-off events. [2024-11-20 17:16:32,759 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-20 17:16:32,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 880 events. 459/880 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4540 event pairs, 245 based on Foata normal form. 94/846 useless extension candidates. Maximal degree in co-relation 1574. Up to 520 conditions per place. [2024-11-20 17:16:32,765 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-11-20 17:16:32,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2024-11-20 17:16:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:16:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:16:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-11-20 17:16:32,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2024-11-20 17:16:32,785 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2024-11-20 17:16:32,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2024-11-20 17:16:32,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:16:32,794 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2024-11-20 17:16:32,795 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-20 17:16:32,803 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-11-20 17:16:32,803 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2024-11-20 17:16:32,803 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-20 17:16:32,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:32,803 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:16:32,813 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-20 17:16:33,004 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-20 17:16:33,005 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-20 17:16:33,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:33,005 INFO L85 PathProgramCache]: Analyzing trace with hash 120974650, now seen corresponding path program 1 times [2024-11-20 17:16:33,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:16:33,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117677089] [2024-11-20 17:16:33,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:33,008 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-20 17:16:33,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:16:33,038 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-20 17:16:33,045 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-20 17:16:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:33,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 17:16:33,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:33,648 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-20 17:16:33,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:16:33,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:16:33,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117677089] [2024-11-20 17:16:33,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117677089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:16:33,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:16:33,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:16:33,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935127210] [2024-11-20 17:16:33,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:16:33,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:16:33,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:16:33,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:16:33,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:16:33,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-20 17:16:33,695 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-20 17:16:33,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:33,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-20 17:16:33,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:34,322 INFO L124 PetriNetUnfolderBase]: 755/1387 cut-off events. [2024-11-20 17:16:34,323 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-20 17:16:34,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1387 events. 755/1387 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7439 event pairs, 125 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 810. Up to 848 conditions per place. [2024-11-20 17:16:34,333 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2024-11-20 17:16:34,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2024-11-20 17:16:34,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:16:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:16:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-11-20 17:16:34,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-11-20 17:16:34,336 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2024-11-20 17:16:34,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2024-11-20 17:16:34,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 17:16:34,339 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2024-11-20 17:16:34,339 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-20 17:16:34,340 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-20 17:16:34,340 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2024-11-20 17:16:34,341 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-20 17:16:34,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:34,341 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:16:34,354 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-20 17:16:34,541 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-20 17:16:34,542 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-20 17:16:34,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:34,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1251699229, now seen corresponding path program 1 times [2024-11-20 17:16:34,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:16:34,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824684495] [2024-11-20 17:16:34,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:34,544 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-20 17:16:34,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:16:34,547 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-20 17:16:34,548 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-20 17:16:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:34,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:16:34,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:16:34,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:16:34,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:16:34,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824684495] [2024-11-20 17:16:34,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824684495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:16:34,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:16:34,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:16:34,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145910392] [2024-11-20 17:16:34,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:16:34,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:16:34,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:16:34,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:16:34,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:16:34,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2024-11-20 17:16:34,788 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-20 17:16:34,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:34,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2024-11-20 17:16:34,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:35,009 INFO L124 PetriNetUnfolderBase]: 793/1518 cut-off events. [2024-11-20 17:16:35,009 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-11-20 17:16:35,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 1518 events. 793/1518 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7890 event pairs, 348 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 3051. Up to 734 conditions per place. [2024-11-20 17:16:35,016 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 56 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2024-11-20 17:16:35,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 303 flow [2024-11-20 17:16:35,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:16:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:16:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-20 17:16:35,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-20 17:16:35,019 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 3 states and 102 transitions. [2024-11-20 17:16:35,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 303 flow [2024-11-20 17:16:35,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 301 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-20 17:16:35,024 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 148 flow [2024-11-20 17:16:35,024 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-20 17:16:35,025 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2024-11-20 17:16:35,025 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 148 flow [2024-11-20 17:16:35,025 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-20 17:16:35,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:35,026 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:16:35,037 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-20 17:16:35,226 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-20 17:16:35,227 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-20 17:16:35,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:35,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2003824447, now seen corresponding path program 1 times [2024-11-20 17:16:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:16:35,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480131266] [2024-11-20 17:16:35,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:35,228 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-20 17:16:35,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:16:35,231 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-20 17:16:35,232 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-20 17:16:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:35,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:16:35,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:35,427 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-20 17:16:35,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:16:35,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:16:35,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480131266] [2024-11-20 17:16:35,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480131266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:16:35,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:16:35,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:16:35,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37113174] [2024-11-20 17:16:35,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:16:35,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:16:35,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:16:35,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:16:35,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:16:35,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:16:35,429 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-20 17:16:35,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:35,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:16:35,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:35,761 INFO L124 PetriNetUnfolderBase]: 1096/2098 cut-off events. [2024-11-20 17:16:35,761 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-11-20 17:16:35,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4357 conditions, 2098 events. 1096/2098 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12125 event pairs, 518 based on Foata normal form. 0/1954 useless extension candidates. Maximal degree in co-relation 1577. Up to 1077 conditions per place. [2024-11-20 17:16:35,771 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 68 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2024-11-20 17:16:35,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 386 flow [2024-11-20 17:16:35,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:16:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:16:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-11-20 17:16:35,773 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2024-11-20 17:16:35,773 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 148 flow. Second operand 4 states and 139 transitions. [2024-11-20 17:16:35,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 386 flow [2024-11-20 17:16:35,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:16:35,778 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 175 flow [2024-11-20 17:16:35,779 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-20 17:16:35,779 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2024-11-20 17:16:35,779 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 175 flow [2024-11-20 17:16:35,779 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-20 17:16:35,779 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:35,779 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:16:35,788 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-20 17:16:35,980 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-20 17:16:35,981 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-20 17:16:35,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:35,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1145046265, now seen corresponding path program 1 times [2024-11-20 17:16:35,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:16:35,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187108898] [2024-11-20 17:16:35,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:35,983 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-20 17:16:35,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:16:35,984 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-20 17:16:35,985 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-20 17:16:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:36,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:16:36,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:36,180 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-20 17:16:36,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:16:36,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:16:36,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187108898] [2024-11-20 17:16:36,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187108898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:16:36,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:16:36,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:16:36,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920203705] [2024-11-20 17:16:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:16:36,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:16:36,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:16:36,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:16:36,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:16:36,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:16:36,185 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-20 17:16:36,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:36,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:16:36,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:36,441 INFO L124 PetriNetUnfolderBase]: 1171/2183 cut-off events. [2024-11-20 17:16:36,442 INFO L125 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2024-11-20 17:16:36,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4967 conditions, 2183 events. 1171/2183 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12583 event pairs, 599 based on Foata normal form. 12/2061 useless extension candidates. Maximal degree in co-relation 2248. Up to 1568 conditions per place. [2024-11-20 17:16:36,454 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 55 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-11-20 17:16:36,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 342 flow [2024-11-20 17:16:36,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:16:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:16:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-20 17:16:36,455 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-20 17:16:36,455 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 175 flow. Second operand 3 states and 106 transitions. [2024-11-20 17:16:36,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 342 flow [2024-11-20 17:16:36,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 337 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-20 17:16:36,461 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 182 flow [2024-11-20 17:16:36,461 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-20 17:16:36,461 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2024-11-20 17:16:36,462 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 182 flow [2024-11-20 17:16:36,462 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-20 17:16:36,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:36,462 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:16:36,474 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-20 17:16:36,666 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-20 17:16:36,667 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-20 17:16:36,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1315697714, now seen corresponding path program 1 times [2024-11-20 17:16:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:16:36,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697677283] [2024-11-20 17:16:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:36,669 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-20 17:16:36,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:16:36,671 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-20 17:16:36,672 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-20 17:16:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:37,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 17:16:37,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:37,466 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-20 17:16:37,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:16:37,843 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-20 17:16:37,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:16:37,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697677283] [2024-11-20 17:16:37,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697677283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:16:37,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:16:37,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-20 17:16:37,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133016358] [2024-11-20 17:16:37,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:16:37,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:16:37,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:16:37,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:16:37,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:16:38,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-20 17:16:38,056 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-20 17:16:38,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:38,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-20 17:16:38,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:41,854 INFO L124 PetriNetUnfolderBase]: 5619/10718 cut-off events. [2024-11-20 17:16:41,854 INFO L125 PetriNetUnfolderBase]: For 2730/2730 co-relation queries the response was YES. [2024-11-20 17:16:41,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24293 conditions, 10718 events. 5619/10718 cut-off events. For 2730/2730 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 76155 event pairs, 736 based on Foata normal form. 264/10346 useless extension candidates. Maximal degree in co-relation 10831. Up to 1905 conditions per place. [2024-11-20 17:16:41,915 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/387 dead transitions. [2024-11-20 17:16:41,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 387 transitions, 1861 flow [2024-11-20 17:16:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 17:16:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-20 17:16:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2024-11-20 17:16:41,919 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-20 17:16:41,919 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 182 flow. Second operand 20 states and 685 transitions. [2024-11-20 17:16:41,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 387 transitions, 1861 flow [2024-11-20 17:16:41,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 387 transitions, 1856 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:16:42,102 INFO L231 Difference]: Finished difference. Result has 92 places, 99 transitions, 598 flow [2024-11-20 17:16:42,105 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-20 17:16:42,106 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2024-11-20 17:16:42,106 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 99 transitions, 598 flow [2024-11-20 17:16:42,107 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-20 17:16:42,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:42,108 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-20 17:16:42,115 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-20 17:16:42,308 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-20 17:16:42,309 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-20 17:16:42,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:42,310 INFO L85 PathProgramCache]: Analyzing trace with hash 789164903, now seen corresponding path program 1 times [2024-11-20 17:16:42,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:16:42,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423760316] [2024-11-20 17:16:42,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:42,312 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-20 17:16:42,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:16:42,313 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-20 17:16:42,315 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-20 17:16:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:42,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:16:42,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:42,539 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-20 17:16:42,554 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-20 17:16:42,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:16:42,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:16:42,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423760316] [2024-11-20 17:16:42,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423760316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:16:42,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:16:42,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:16:42,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430046730] [2024-11-20 17:16:42,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:16:42,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:16:42,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:16:42,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:16:42,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:16:42,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:16:42,556 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-20 17:16:42,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:42,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:16:42,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:43,131 INFO L124 PetriNetUnfolderBase]: 2678/5616 cut-off events. [2024-11-20 17:16:43,132 INFO L125 PetriNetUnfolderBase]: For 3568/3568 co-relation queries the response was YES. [2024-11-20 17:16:43,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13890 conditions, 5616 events. 2678/5616 cut-off events. For 3568/3568 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 36064 event pairs, 589 based on Foata normal form. 364/5797 useless extension candidates. Maximal degree in co-relation 13556. Up to 3210 conditions per place. [2024-11-20 17:16:43,165 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2024-11-20 17:16:43,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 615 flow [2024-11-20 17:16:43,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:16:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:16:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-20 17:16:43,166 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2024-11-20 17:16:43,166 INFO L175 Difference]: Start difference. First operand has 92 places, 99 transitions, 598 flow. Second operand 3 states and 94 transitions. [2024-11-20 17:16:43,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 615 flow [2024-11-20 17:16:43,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 90 transitions, 567 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-11-20 17:16:43,182 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 395 flow [2024-11-20 17:16:43,183 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-20 17:16:43,183 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-11-20 17:16:43,183 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 395 flow [2024-11-20 17:16:43,184 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-20 17:16:43,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:43,184 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-20 17:16:43,192 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-20 17:16:43,384 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-20 17:16:43,385 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-20 17:16:43,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:43,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2115802199, now seen corresponding path program 1 times [2024-11-20 17:16:43,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:16:43,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917750507] [2024-11-20 17:16:43,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:43,386 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-20 17:16:43,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:16:43,388 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-20 17:16:43,389 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-20 17:16:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:43,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:16:43,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:43,691 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-20 17:16:43,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:16:43,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:16:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917750507] [2024-11-20 17:16:43,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917750507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:16:43,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:16:43,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:16:43,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329281075] [2024-11-20 17:16:43,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:16:43,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:16:43,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:16:43,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:16:43,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:16:43,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-20 17:16:43,700 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-20 17:16:43,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:43,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-20 17:16:43,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:44,224 INFO L124 PetriNetUnfolderBase]: 2633/5401 cut-off events. [2024-11-20 17:16:44,224 INFO L125 PetriNetUnfolderBase]: For 2283/2283 co-relation queries the response was YES. [2024-11-20 17:16:44,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13634 conditions, 5401 events. 2633/5401 cut-off events. For 2283/2283 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 34363 event pairs, 1881 based on Foata normal form. 0/5240 useless extension candidates. Maximal degree in co-relation 11203. Up to 4039 conditions per place. [2024-11-20 17:16:44,244 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 65 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2024-11-20 17:16:44,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 546 flow [2024-11-20 17:16:44,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:16:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:16:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-11-20 17:16:44,245 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-11-20 17:16:44,245 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 395 flow. Second operand 4 states and 100 transitions. [2024-11-20 17:16:44,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 546 flow [2024-11-20 17:16:44,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 83 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:16:44,253 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 395 flow [2024-11-20 17:16:44,253 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-20 17:16:44,255 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2024-11-20 17:16:44,255 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 395 flow [2024-11-20 17:16:44,255 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-20 17:16:44,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:44,255 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-20 17:16:44,265 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-20 17:16:44,455 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-20 17:16:44,456 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-20 17:16:44,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:44,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1467685320, now seen corresponding path program 1 times [2024-11-20 17:16:44,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:16:44,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485531595] [2024-11-20 17:16:44,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:44,458 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-20 17:16:44,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:16:44,459 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-20 17:16:44,461 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-20 17:16:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:44,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 17:16:44,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:44,876 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-20 17:16:44,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:16:44,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:16:44,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485531595] [2024-11-20 17:16:44,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485531595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:16:44,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:16:44,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:16:44,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891834829] [2024-11-20 17:16:44,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:16:44,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:16:44,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:16:44,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:16:44,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:16:44,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-20 17:16:44,896 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-20 17:16:44,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:44,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-20 17:16:44,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:45,452 INFO L124 PetriNetUnfolderBase]: 2709/5578 cut-off events. [2024-11-20 17:16:45,452 INFO L125 PetriNetUnfolderBase]: For 2652/2652 co-relation queries the response was YES. [2024-11-20 17:16:45,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13817 conditions, 5578 events. 2709/5578 cut-off events. For 2652/2652 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 35240 event pairs, 859 based on Foata normal form. 0/5396 useless extension candidates. Maximal degree in co-relation 11387. Up to 3583 conditions per place. [2024-11-20 17:16:45,477 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 107 selfloop transitions, 9 changer transitions 0/130 dead transitions. [2024-11-20 17:16:45,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 792 flow [2024-11-20 17:16:45,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:16:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:16:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-11-20 17:16:45,478 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-11-20 17:16:45,478 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 395 flow. Second operand 6 states and 185 transitions. [2024-11-20 17:16:45,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 792 flow [2024-11-20 17:16:45,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 130 transitions, 778 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 17:16:45,488 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 433 flow [2024-11-20 17:16:45,488 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-20 17:16:45,489 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2024-11-20 17:16:45,489 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 433 flow [2024-11-20 17:16:45,489 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-20 17:16:45,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:45,489 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-20 17:16:45,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-20 17:16:45,690 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-20 17:16:45,690 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-20 17:16:45,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:45,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1572535323, now seen corresponding path program 1 times [2024-11-20 17:16:45,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:16:45,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97055229] [2024-11-20 17:16:45,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:45,692 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-20 17:16:45,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:16:45,694 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-20 17:16:45,695 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-20 17:16:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:45,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:16:45,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:45,875 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-20 17:16:45,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:16:45,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:16:45,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97055229] [2024-11-20 17:16:45,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97055229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:16:45,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:16:45,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:16:45,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401091413] [2024-11-20 17:16:45,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:16:45,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:16:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:16:45,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:16:45,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:16:45,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:16:45,878 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-20 17:16:45,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:45,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:16:45,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:46,416 INFO L124 PetriNetUnfolderBase]: 3800/7947 cut-off events. [2024-11-20 17:16:46,417 INFO L125 PetriNetUnfolderBase]: For 3934/3934 co-relation queries the response was YES. [2024-11-20 17:16:46,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19805 conditions, 7947 events. 3800/7947 cut-off events. For 3934/3934 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 55916 event pairs, 1884 based on Foata normal form. 137/7834 useless extension candidates. Maximal degree in co-relation 16716. Up to 4725 conditions per place. [2024-11-20 17:16:46,451 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 121 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2024-11-20 17:16:46,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 138 transitions, 1028 flow [2024-11-20 17:16:46,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:16:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:16:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-20 17:16:46,452 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-11-20 17:16:46,452 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 433 flow. Second operand 3 states and 107 transitions. [2024-11-20 17:16:46,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 138 transitions, 1028 flow [2024-11-20 17:16:46,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 138 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:16:46,466 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 442 flow [2024-11-20 17:16:46,466 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-20 17:16:46,467 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2024-11-20 17:16:46,467 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 442 flow [2024-11-20 17:16:46,467 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-20 17:16:46,467 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:46,467 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-20 17:16:46,476 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 (11)] Forceful destruction successful, exit code 0 [2024-11-20 17:16:46,668 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-20 17:16:46,668 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-20 17:16:46,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:46,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1914961052, now seen corresponding path program 1 times [2024-11-20 17:16:46,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:16:46,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781875934] [2024-11-20 17:16:46,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:46,669 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-20 17:16:46,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:16:46,670 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-20 17:16:46,672 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-20 17:16:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:46,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:16:46,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:46,882 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-20 17:16:46,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:16:46,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:16:46,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781875934] [2024-11-20 17:16:46,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781875934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:16:46,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:16:46,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:16:46,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763176143] [2024-11-20 17:16:46,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:16:46,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:16:46,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:16:46,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:16:46,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:16:46,885 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:16:46,885 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-20 17:16:46,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:46,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:16:46,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:47,507 INFO L124 PetriNetUnfolderBase]: 3746/7776 cut-off events. [2024-11-20 17:16:47,507 INFO L125 PetriNetUnfolderBase]: For 5047/5047 co-relation queries the response was YES. [2024-11-20 17:16:47,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20940 conditions, 7776 events. 3746/7776 cut-off events. For 5047/5047 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 53209 event pairs, 1180 based on Foata normal form. 16/7563 useless extension candidates. Maximal degree in co-relation 17590. Up to 5140 conditions per place. [2024-11-20 17:16:47,542 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 102 selfloop transitions, 7 changer transitions 0/124 dead transitions. [2024-11-20 17:16:47,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 124 transitions, 808 flow [2024-11-20 17:16:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:16:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:16:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-11-20 17:16:47,543 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-20 17:16:47,543 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 442 flow. Second operand 5 states and 165 transitions. [2024-11-20 17:16:47,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 124 transitions, 808 flow [2024-11-20 17:16:47,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 124 transitions, 796 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-20 17:16:47,559 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 448 flow [2024-11-20 17:16:47,559 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-20 17:16:47,559 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 44 predicate places. [2024-11-20 17:16:47,559 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 448 flow [2024-11-20 17:16:47,559 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-20 17:16:47,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:47,560 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-20 17:16:47,568 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-20 17:16:47,760 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-20 17:16:47,760 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-20 17:16:47,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:16:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash 375528133, now seen corresponding path program 1 times [2024-11-20 17:16:47,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:16:47,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326874337] [2024-11-20 17:16:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:16:47,761 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-20 17:16:47,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:16:47,762 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-20 17:16:47,763 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-20 17:16:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:16:47,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-20 17:16:47,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:16:48,050 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-20 17:16:48,126 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-20 17:16:48,145 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-20 17:16:48,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:16:48,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:16:48,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326874337] [2024-11-20 17:16:48,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326874337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:16:48,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:16:48,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:16:48,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042601333] [2024-11-20 17:16:48,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:16:48,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:16:48,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:16:48,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:16:48,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:16:48,186 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-20 17:16:48,187 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-20 17:16:48,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:16:48,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-20 17:16:48,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:16:49,353 INFO L124 PetriNetUnfolderBase]: 5266/10863 cut-off events. [2024-11-20 17:16:49,353 INFO L125 PetriNetUnfolderBase]: For 7246/7246 co-relation queries the response was YES. [2024-11-20 17:16:49,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29206 conditions, 10863 events. 5266/10863 cut-off events. For 7246/7246 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 75888 event pairs, 1414 based on Foata normal form. 0/10582 useless extension candidates. Maximal degree in co-relation 23606. Up to 5182 conditions per place. [2024-11-20 17:16:49,425 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 190 selfloop transitions, 21 changer transitions 0/226 dead transitions. [2024-11-20 17:16:49,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 226 transitions, 1496 flow [2024-11-20 17:16:49,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 17:16:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-20 17:16:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 396 transitions. [2024-11-20 17:16:49,426 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-11-20 17:16:49,426 INFO L175 Difference]: Start difference. First operand has 94 places, 81 transitions, 448 flow. Second operand 14 states and 396 transitions. [2024-11-20 17:16:49,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 226 transitions, 1496 flow [2024-11-20 17:16:49,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 226 transitions, 1476 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:16:49,448 INFO L231 Difference]: Finished difference. Result has 106 places, 90 transitions, 556 flow [2024-11-20 17:16:49,448 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-20 17:16:49,448 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 56 predicate places. [2024-11-20 17:16:49,449 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 556 flow [2024-11-20 17:16:49,449 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-20 17:16:49,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:16:49,449 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-20 17:16:49,460 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 (13)] Forceful destruction successful, exit code 0