./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/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:26:07,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:26:07,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:26:07,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:26:07,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:26:07,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:26:07,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:26:07,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:26:07,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:26:07,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:26:07,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:26:07,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:26:07,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:26:07,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:26:07,680 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:26:07,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:26:07,681 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:26:07,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:26:07,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:26:07,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:26:07,681 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:26:07,682 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:26:07,682 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:26:07,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:26:07,683 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:26:07,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:26:07,683 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:26:07,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:26:07,684 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:26:07,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:26:07,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:26:07,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:26:07,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:26:07,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:26:07,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:26:07,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:26:07,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:26:07,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:26:07,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:26:07,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:26:07,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:26:07,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:26:07,691 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-clean/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-clean/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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2024-10-11 19:26:07,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:26:07,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:26:07,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:26:07,922 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:26:07,922 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:26:07,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-10-11 19:26:09,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:26:09,441 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:26:09,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-10-11 19:26:09,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc4759371/0dfec31b3d814744a54a879e5e133bad/FLAG028aed5cf [2024-10-11 19:26:09,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc4759371/0dfec31b3d814744a54a879e5e133bad [2024-10-11 19:26:09,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:26:09,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:26:09,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:26:09,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:26:09,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:26:09,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:26:09" (1/1) ... [2024-10-11 19:26:09,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9a7b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:09, skipping insertion in model container [2024-10-11 19:26:09,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:26:09" (1/1) ... [2024-10-11 19:26:09,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:26:10,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:26:10,157 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:26:10,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:26:10,270 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:26:10,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10 WrapperNode [2024-10-11 19:26:10,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:26:10,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:26:10,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:26:10,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:26:10,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10" (1/1) ... [2024-10-11 19:26:10,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10" (1/1) ... [2024-10-11 19:26:10,337 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-10-11 19:26:10,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:26:10,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:26:10,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:26:10,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:26:10,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10" (1/1) ... [2024-10-11 19:26:10,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10" (1/1) ... [2024-10-11 19:26:10,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10" (1/1) ... [2024-10-11 19:26:10,356 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 19:26:10,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10" (1/1) ... [2024-10-11 19:26:10,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10" (1/1) ... [2024-10-11 19:26:10,360 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10" (1/1) ... [2024-10-11 19:26:10,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10" (1/1) ... [2024-10-11 19:26:10,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10" (1/1) ... [2024-10-11 19:26:10,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10" (1/1) ... [2024-10-11 19:26:10,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:26:10,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:26:10,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:26:10,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:26:10,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10" (1/1) ... [2024-10-11 19:26:10,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:26:10,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:26:10,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:26:10,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:26:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-11 19:26:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-11 19:26:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-11 19:26:10,459 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-11 19:26:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:26:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:26:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 19:26:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:26:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:26:10,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:26:10,460 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:26:10,574 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:26:10,576 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:26:10,694 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:26:10,694 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:26:10,759 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:26:10,759 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 19:26:10,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:26:10 BoogieIcfgContainer [2024-10-11 19:26:10,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:26:10,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:26:10,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:26:10,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:26:10,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:26:09" (1/3) ... [2024-10-11 19:26:10,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366f89f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:26:10, skipping insertion in model container [2024-10-11 19:26:10,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:10" (2/3) ... [2024-10-11 19:26:10,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366f89f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:26:10, skipping insertion in model container [2024-10-11 19:26:10,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:26:10" (3/3) ... [2024-10-11 19:26:10,766 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-10-11 19:26:10,779 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:26:10,780 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 19:26:10,780 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:26:10,818 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:26:10,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2024-10-11 19:26:10,866 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-10-11 19:26:10,866 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:26:10,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-10-11 19:26:10,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2024-10-11 19:26:10,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2024-10-11 19:26:10,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:26:10,883 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;@3210c375, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:26:10,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 19:26:10,891 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:26:10,892 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2024-10-11 19:26:10,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:26:10,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:10,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:10,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:10,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:10,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1038261642, now seen corresponding path program 1 times [2024-10-11 19:26:10,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:10,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502229098] [2024-10-11 19:26:10,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:11,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:26:11,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502229098] [2024-10-11 19:26:11,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502229098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:11,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:11,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:26:11,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725769160] [2024-10-11 19:26:11,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:11,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:26:11,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:26:11,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:26:11,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:26:11,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2024-10-11 19:26:11,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-11 19:26:11,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:11,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2024-10-11 19:26:11,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:11,143 INFO L124 PetriNetUnfolderBase]: 70/157 cut-off events. [2024-10-11 19:26:11,147 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 19:26:11,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 157 events. 70/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 554 event pairs, 44 based on Foata normal form. 15/161 useless extension candidates. Maximal degree in co-relation 272. Up to 113 conditions per place. [2024-10-11 19:26:11,149 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 11 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2024-10-11 19:26:11,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 78 flow [2024-10-11 19:26:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:26:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:26:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-10-11 19:26:11,161 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-10-11 19:26:11,162 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 52 transitions. [2024-10-11 19:26:11,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 78 flow [2024-10-11 19:26:11,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:26:11,167 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2024-10-11 19:26:11,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2024-10-11 19:26:11,172 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2024-10-11 19:26:11,172 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2024-10-11 19:26:11,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-11 19:26:11,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:11,173 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:11,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 19:26:11,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:11,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:11,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1038262774, now seen corresponding path program 1 times [2024-10-11 19:26:11,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:11,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900201323] [2024-10-11 19:26:11,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:11,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:11,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:26:11,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900201323] [2024-10-11 19:26:11,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900201323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:11,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:11,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:26:11,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056714671] [2024-10-11 19:26:11,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:11,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:26:11,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:26:11,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:26:11,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:26:11,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:11,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-11 19:26:11,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:11,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:11,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:11,560 INFO L124 PetriNetUnfolderBase]: 273/487 cut-off events. [2024-10-11 19:26:11,560 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:26:11,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 487 events. 273/487 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1990 event pairs, 45 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 921. Up to 181 conditions per place. [2024-10-11 19:26:11,564 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 25 selfloop transitions, 4 changer transitions 21/54 dead transitions. [2024-10-11 19:26:11,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 54 transitions, 212 flow [2024-10-11 19:26:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:26:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:26:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-10-11 19:26:11,565 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2024-10-11 19:26:11,566 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 6 states and 99 transitions. [2024-10-11 19:26:11,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 54 transitions, 212 flow [2024-10-11 19:26:11,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 54 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:26:11,567 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 74 flow [2024-10-11 19:26:11,568 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2024-10-11 19:26:11,568 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2024-10-11 19:26:11,569 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 74 flow [2024-10-11 19:26:11,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-11 19:26:11,569 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:11,569 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:11,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 19:26:11,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:11,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:11,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1117686194, now seen corresponding path program 1 times [2024-10-11 19:26:11,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:11,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777256835] [2024-10-11 19:26:11,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:11,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:26:11,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777256835] [2024-10-11 19:26:11,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777256835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:11,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:11,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:26:11,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640423625] [2024-10-11 19:26:11,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:11,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:26:11,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:26:11,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:26:11,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:26:11,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:11,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-11 19:26:11,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:11,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:11,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:11,874 INFO L124 PetriNetUnfolderBase]: 382/704 cut-off events. [2024-10-11 19:26:11,874 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2024-10-11 19:26:11,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 704 events. 382/704 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3073 event pairs, 65 based on Foata normal form. 27/727 useless extension candidates. Maximal degree in co-relation 1591. Up to 246 conditions per place. [2024-10-11 19:26:11,882 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 9 changer transitions 20/79 dead transitions. [2024-10-11 19:26:11,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 79 transitions, 382 flow [2024-10-11 19:26:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:26:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:26:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-10-11 19:26:11,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-10-11 19:26:11,885 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 74 flow. Second operand 9 states and 144 transitions. [2024-10-11 19:26:11,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 79 transitions, 382 flow [2024-10-11 19:26:11,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 79 transitions, 366 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-10-11 19:26:11,892 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 159 flow [2024-10-11 19:26:11,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=159, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2024-10-11 19:26:11,892 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2024-10-11 19:26:11,892 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 159 flow [2024-10-11 19:26:11,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-11 19:26:11,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:11,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:11,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 19:26:11,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:11,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1000674482, now seen corresponding path program 2 times [2024-10-11 19:26:11,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:11,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350449658] [2024-10-11 19:26:11,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:11,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:11,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:26:11,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350449658] [2024-10-11 19:26:11,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350449658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:11,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:11,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:26:11,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189144970] [2024-10-11 19:26:11,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:11,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:26:11,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:26:11,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:26:11,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:26:12,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:12,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-11 19:26:12,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:12,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:12,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:12,171 INFO L124 PetriNetUnfolderBase]: 328/611 cut-off events. [2024-10-11 19:26:12,173 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2024-10-11 19:26:12,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 611 events. 328/611 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2595 event pairs, 65 based on Foata normal form. 45/652 useless extension candidates. Maximal degree in co-relation 1723. Up to 234 conditions per place. [2024-10-11 19:26:12,177 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 9 changer transitions 28/79 dead transitions. [2024-10-11 19:26:12,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 499 flow [2024-10-11 19:26:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:26:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:26:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-10-11 19:26:12,181 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5474137931034483 [2024-10-11 19:26:12,181 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 159 flow. Second operand 8 states and 127 transitions. [2024-10-11 19:26:12,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 499 flow [2024-10-11 19:26:12,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 491 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-11 19:26:12,188 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 213 flow [2024-10-11 19:26:12,188 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2024-10-11 19:26:12,189 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2024-10-11 19:26:12,189 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 213 flow [2024-10-11 19:26:12,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-11 19:26:12,190 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:12,190 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:12,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 19:26:12,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:12,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:12,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1356857717, now seen corresponding path program 1 times [2024-10-11 19:26:12,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:12,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147003814] [2024-10-11 19:26:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:12,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:12,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:26:12,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147003814] [2024-10-11 19:26:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147003814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:12,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:12,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:26:12,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773163770] [2024-10-11 19:26:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:12,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:26:12,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:26:12,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:26:12,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:26:12,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:12,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 213 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-11 19:26:12,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:12,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:12,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:12,521 INFO L124 PetriNetUnfolderBase]: 337/620 cut-off events. [2024-10-11 19:26:12,522 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2024-10-11 19:26:12,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 620 events. 337/620 cut-off events. For 1649/1649 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2632 event pairs, 74 based on Foata normal form. 18/634 useless extension candidates. Maximal degree in co-relation 1923. Up to 237 conditions per place. [2024-10-11 19:26:12,525 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 16 changer transitions 24/90 dead transitions. [2024-10-11 19:26:12,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 610 flow [2024-10-11 19:26:12,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:26:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:26:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-10-11 19:26:12,526 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5266457680250783 [2024-10-11 19:26:12,526 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 213 flow. Second operand 11 states and 168 transitions. [2024-10-11 19:26:12,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 610 flow [2024-10-11 19:26:12,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 543 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-10-11 19:26:12,532 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 282 flow [2024-10-11 19:26:12,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=282, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-10-11 19:26:12,533 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-10-11 19:26:12,533 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 282 flow [2024-10-11 19:26:12,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-11 19:26:12,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:12,534 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:12,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 19:26:12,534 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:12,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:12,535 INFO L85 PathProgramCache]: Analyzing trace with hash 392343623, now seen corresponding path program 2 times [2024-10-11 19:26:12,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:12,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718330850] [2024-10-11 19:26:12,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:12,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:12,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:26:12,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718330850] [2024-10-11 19:26:12,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718330850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:12,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:12,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:26:12,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073281054] [2024-10-11 19:26:12,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:12,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:26:12,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:26:12,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:26:12,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:26:12,614 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:12,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-11 19:26:12,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:12,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:12,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:12,787 INFO L124 PetriNetUnfolderBase]: 445/807 cut-off events. [2024-10-11 19:26:12,787 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2024-10-11 19:26:12,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2634 conditions, 807 events. 445/807 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3481 event pairs, 59 based on Foata normal form. 27/828 useless extension candidates. Maximal degree in co-relation 2610. Up to 151 conditions per place. [2024-10-11 19:26:12,791 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 44 selfloop transitions, 23 changer transitions 30/101 dead transitions. [2024-10-11 19:26:12,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 101 transitions, 742 flow [2024-10-11 19:26:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:26:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:26:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2024-10-11 19:26:12,792 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5360501567398119 [2024-10-11 19:26:12,792 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 282 flow. Second operand 11 states and 171 transitions. [2024-10-11 19:26:12,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 101 transitions, 742 flow [2024-10-11 19:26:12,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 688 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-10-11 19:26:12,798 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 393 flow [2024-10-11 19:26:12,798 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=393, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2024-10-11 19:26:12,799 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-10-11 19:26:12,799 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 393 flow [2024-10-11 19:26:12,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-11 19:26:12,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:12,799 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:12,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 19:26:12,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:12,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1383133169, now seen corresponding path program 1 times [2024-10-11 19:26:12,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:12,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062998064] [2024-10-11 19:26:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:12,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:12,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:26:12,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062998064] [2024-10-11 19:26:12,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062998064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:26:12,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200959398] [2024-10-11 19:26:12,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:12,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:26:12,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:26:12,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:26:12,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 19:26:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:12,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:26:12,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:13,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:13,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200959398] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:13,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:26:13,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-11 19:26:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91941567] [2024-10-11 19:26:13,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:13,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 19:26:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:26:13,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 19:26:13,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-11 19:26:13,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:13,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 393 flow. Second operand has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 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-10-11 19:26:13,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:13,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:13,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:13,563 INFO L124 PetriNetUnfolderBase]: 571/1058 cut-off events. [2024-10-11 19:26:13,564 INFO L125 PetriNetUnfolderBase]: For 6872/6872 co-relation queries the response was YES. [2024-10-11 19:26:13,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4148 conditions, 1058 events. 571/1058 cut-off events. For 6872/6872 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4466 event pairs, 137 based on Foata normal form. 63/1117 useless extension candidates. Maximal degree in co-relation 4119. Up to 486 conditions per place. [2024-10-11 19:26:13,569 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 64 selfloop transitions, 17 changer transitions 67/152 dead transitions. [2024-10-11 19:26:13,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 152 transitions, 1349 flow [2024-10-11 19:26:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:26:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-11 19:26:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2024-10-11 19:26:13,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5226860254083484 [2024-10-11 19:26:13,571 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 393 flow. Second operand 19 states and 288 transitions. [2024-10-11 19:26:13,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 152 transitions, 1349 flow [2024-10-11 19:26:13,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 152 transitions, 1270 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-10-11 19:26:13,581 INFO L231 Difference]: Finished difference. Result has 90 places, 52 transitions, 524 flow [2024-10-11 19:26:13,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=524, PETRI_PLACES=90, PETRI_TRANSITIONS=52} [2024-10-11 19:26:13,581 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2024-10-11 19:26:13,582 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 52 transitions, 524 flow [2024-10-11 19:26:13,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 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-10-11 19:26:13,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:13,582 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:13,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 19:26:13,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:26:13,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:13,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:13,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1985942713, now seen corresponding path program 2 times [2024-10-11 19:26:13,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:13,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314539874] [2024-10-11 19:26:13,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:13,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:13,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:26:13,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314539874] [2024-10-11 19:26:13,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314539874] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:26:13,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953218839] [2024-10-11 19:26:13,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:26:13,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:26:13,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:26:13,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:26:13,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 19:26:13,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:26:13,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:26:13,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:26:13,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:13,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:14,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953218839] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:14,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:26:14,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-11 19:26:14,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462610242] [2024-10-11 19:26:14,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:14,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 19:26:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:26:14,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 19:26:14,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-11 19:26:14,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:14,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 52 transitions, 524 flow. Second operand has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 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-10-11 19:26:14,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:14,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:14,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:14,562 INFO L124 PetriNetUnfolderBase]: 877/1628 cut-off events. [2024-10-11 19:26:14,563 INFO L125 PetriNetUnfolderBase]: For 29480/29480 co-relation queries the response was YES. [2024-10-11 19:26:14,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8520 conditions, 1628 events. 877/1628 cut-off events. For 29480/29480 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7913 event pairs, 70 based on Foata normal form. 72/1696 useless extension candidates. Maximal degree in co-relation 8480. Up to 249 conditions per place. [2024-10-11 19:26:14,573 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 88 selfloop transitions, 46 changer transitions 80/218 dead transitions. [2024-10-11 19:26:14,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 218 transitions, 2565 flow [2024-10-11 19:26:14,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 19:26:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-10-11 19:26:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 415 transitions. [2024-10-11 19:26:14,612 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5300127713920817 [2024-10-11 19:26:14,612 INFO L175 Difference]: Start difference. First operand has 90 places, 52 transitions, 524 flow. Second operand 27 states and 415 transitions. [2024-10-11 19:26:14,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 218 transitions, 2565 flow [2024-10-11 19:26:14,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 218 transitions, 2089 flow, removed 227 selfloop flow, removed 12 redundant places. [2024-10-11 19:26:14,628 INFO L231 Difference]: Finished difference. Result has 116 places, 70 transitions, 908 flow [2024-10-11 19:26:14,628 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=908, PETRI_PLACES=116, PETRI_TRANSITIONS=70} [2024-10-11 19:26:14,629 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2024-10-11 19:26:14,629 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 70 transitions, 908 flow [2024-10-11 19:26:14,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 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-10-11 19:26:14,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:14,629 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:14,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 19:26:14,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:26:14,834 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:14,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1216840336, now seen corresponding path program 1 times [2024-10-11 19:26:14,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:14,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301106276] [2024-10-11 19:26:14,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:14,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:26:14,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301106276] [2024-10-11 19:26:14,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301106276] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:26:14,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600695214] [2024-10-11 19:26:14,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:14,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:26:14,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:26:14,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:26:14,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 19:26:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:15,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 19:26:15,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:15,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:15,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600695214] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:15,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:26:15,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-11 19:26:15,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352668745] [2024-10-11 19:26:15,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:15,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 19:26:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:26:15,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 19:26:15,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-10-11 19:26:15,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:15,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 70 transitions, 908 flow. Second operand has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 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-10-11 19:26:15,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:15,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:15,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:15,856 INFO L124 PetriNetUnfolderBase]: 1093/2114 cut-off events. [2024-10-11 19:26:15,857 INFO L125 PetriNetUnfolderBase]: For 73277/73277 co-relation queries the response was YES. [2024-10-11 19:26:15,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13414 conditions, 2114 events. 1093/2114 cut-off events. For 73277/73277 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11488 event pairs, 94 based on Foata normal form. 72/2182 useless extension candidates. Maximal degree in co-relation 13362. Up to 409 conditions per place. [2024-10-11 19:26:15,871 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 86 selfloop transitions, 64 changer transitions 88/242 dead transitions. [2024-10-11 19:26:15,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 242 transitions, 3738 flow [2024-10-11 19:26:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 19:26:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-10-11 19:26:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 425 transitions. [2024-10-11 19:26:15,873 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5233990147783252 [2024-10-11 19:26:15,873 INFO L175 Difference]: Start difference. First operand has 116 places, 70 transitions, 908 flow. Second operand 28 states and 425 transitions. [2024-10-11 19:26:15,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 242 transitions, 3738 flow [2024-10-11 19:26:15,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 242 transitions, 3143 flow, removed 281 selfloop flow, removed 15 redundant places. [2024-10-11 19:26:15,922 INFO L231 Difference]: Finished difference. Result has 138 places, 92 transitions, 1417 flow [2024-10-11 19:26:15,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1417, PETRI_PLACES=138, PETRI_TRANSITIONS=92} [2024-10-11 19:26:15,923 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2024-10-11 19:26:15,923 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 92 transitions, 1417 flow [2024-10-11 19:26:15,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 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-10-11 19:26:15,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:15,923 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:15,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 19:26:16,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:26:16,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:16,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:16,128 INFO L85 PathProgramCache]: Analyzing trace with hash -974308042, now seen corresponding path program 2 times [2024-10-11 19:26:16,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:16,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079698197] [2024-10-11 19:26:16,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:16,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:16,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:26:16,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079698197] [2024-10-11 19:26:16,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079698197] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:26:16,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95975121] [2024-10-11 19:26:16,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:26:16,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:26:16,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:26:16,224 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:26:16,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 19:26:16,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:26:16,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:26:16,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:26:16,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:16,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:16,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95975121] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:16,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:26:16,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-10-11 19:26:16,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913250472] [2024-10-11 19:26:16,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:16,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 19:26:16,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:26:16,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 19:26:16,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-10-11 19:26:16,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:16,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 92 transitions, 1417 flow. Second operand has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 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-10-11 19:26:16,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:16,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:16,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:17,537 INFO L124 PetriNetUnfolderBase]: 1399/2654 cut-off events. [2024-10-11 19:26:17,537 INFO L125 PetriNetUnfolderBase]: For 156808/156808 co-relation queries the response was YES. [2024-10-11 19:26:17,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19910 conditions, 2654 events. 1399/2654 cut-off events. For 156808/156808 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 14350 event pairs, 50 based on Foata normal form. 99/2749 useless extension candidates. Maximal degree in co-relation 19848. Up to 528 conditions per place. [2024-10-11 19:26:17,561 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 112 selfloop transitions, 95 changer transitions 113/324 dead transitions. [2024-10-11 19:26:17,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 324 transitions, 6002 flow [2024-10-11 19:26:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-11 19:26:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-10-11 19:26:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 551 transitions. [2024-10-11 19:26:17,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-10-11 19:26:17,566 INFO L175 Difference]: Start difference. First operand has 138 places, 92 transitions, 1417 flow. Second operand 36 states and 551 transitions. [2024-10-11 19:26:17,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 324 transitions, 6002 flow [2024-10-11 19:26:17,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 324 transitions, 5013 flow, removed 469 selfloop flow, removed 16 redundant places. [2024-10-11 19:26:17,662 INFO L231 Difference]: Finished difference. Result has 172 places, 120 transitions, 2180 flow [2024-10-11 19:26:17,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2180, PETRI_PLACES=172, PETRI_TRANSITIONS=120} [2024-10-11 19:26:17,663 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-10-11 19:26:17,663 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 120 transitions, 2180 flow [2024-10-11 19:26:17,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 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-10-11 19:26:17,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:17,664 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:17,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 19:26:17,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 19:26:17,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:17,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1191975869, now seen corresponding path program 3 times [2024-10-11 19:26:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:17,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794303052] [2024-10-11 19:26:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:17,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:18,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:26:18,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794303052] [2024-10-11 19:26:18,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794303052] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:26:18,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652150887] [2024-10-11 19:26:18,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:26:18,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:26:18,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:26:18,049 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:26:18,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 19:26:18,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:26:18,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:26:18,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 19:26:18,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:18,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:18,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652150887] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:18,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:26:18,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2024-10-11 19:26:18,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208699174] [2024-10-11 19:26:18,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:18,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 19:26:18,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:26:18,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 19:26:18,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-10-11 19:26:18,359 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:18,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 120 transitions, 2180 flow. Second operand has 16 states, 16 states have (on average 9.8125) internal successors, (157), 16 states have internal predecessors, (157), 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-10-11 19:26:18,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:18,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:18,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:19,239 INFO L124 PetriNetUnfolderBase]: 1444/2765 cut-off events. [2024-10-11 19:26:19,240 INFO L125 PetriNetUnfolderBase]: For 202456/202456 co-relation queries the response was YES. [2024-10-11 19:26:19,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21212 conditions, 2765 events. 1444/2765 cut-off events. For 202456/202456 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 14718 event pairs, 74 based on Foata normal form. 18/2779 useless extension candidates. Maximal degree in co-relation 21135. Up to 486 conditions per place. [2024-10-11 19:26:19,307 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 104 selfloop transitions, 98 changer transitions 51/257 dead transitions. [2024-10-11 19:26:19,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 257 transitions, 4926 flow [2024-10-11 19:26:19,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 19:26:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-11 19:26:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 365 transitions. [2024-10-11 19:26:19,309 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5244252873563219 [2024-10-11 19:26:19,309 INFO L175 Difference]: Start difference. First operand has 172 places, 120 transitions, 2180 flow. Second operand 24 states and 365 transitions. [2024-10-11 19:26:19,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 257 transitions, 4926 flow [2024-10-11 19:26:19,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 257 transitions, 3755 flow, removed 551 selfloop flow, removed 24 redundant places. [2024-10-11 19:26:19,527 INFO L231 Difference]: Finished difference. Result has 172 places, 133 transitions, 2094 flow [2024-10-11 19:26:19,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2094, PETRI_PLACES=172, PETRI_TRANSITIONS=133} [2024-10-11 19:26:19,528 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-10-11 19:26:19,529 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 133 transitions, 2094 flow [2024-10-11 19:26:19,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.8125) internal successors, (157), 16 states have internal predecessors, (157), 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-10-11 19:26:19,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:19,529 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:19,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 19:26:19,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 19:26:19,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:19,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1362475303, now seen corresponding path program 4 times [2024-10-11 19:26:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:19,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259309001] [2024-10-11 19:26:19,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:26:19,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:26:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:26:19,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:26:19,767 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:26:19,768 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-10-11 19:26:19,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-10-11 19:26:19,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-10-11 19:26:19,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-10-11 19:26:19,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 19:26:19,772 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1] [2024-10-11 19:26:19,828 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:26:19,828 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:26:19,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:26:19 BasicIcfg [2024-10-11 19:26:19,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:26:19,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:26:19,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:26:19,836 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:26:19,837 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:26:10" (3/4) ... [2024-10-11 19:26:19,838 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:26:19,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:26:19,840 INFO L158 Benchmark]: Toolchain (without parser) took 10016.50ms. Allocated memory was 188.7MB in the beginning and 432.0MB in the end (delta: 243.3MB). Free memory was 122.6MB in the beginning and 264.2MB in the end (delta: -141.6MB). Peak memory consumption was 102.9MB. Max. memory is 16.1GB. [2024-10-11 19:26:19,840 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:26:19,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.33ms. Allocated memory is still 188.7MB. Free memory was 122.3MB in the beginning and 158.2MB in the end (delta: -35.9MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-10-11 19:26:19,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.69ms. Allocated memory is still 188.7MB. Free memory was 158.2MB in the beginning and 156.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:26:19,841 INFO L158 Benchmark]: Boogie Preprocessor took 34.00ms. Allocated memory is still 188.7MB. Free memory was 156.4MB in the beginning and 154.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:26:19,841 INFO L158 Benchmark]: RCFGBuilder took 387.13ms. Allocated memory is still 188.7MB. Free memory was 154.3MB in the beginning and 135.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 19:26:19,841 INFO L158 Benchmark]: TraceAbstraction took 9073.84ms. Allocated memory was 188.7MB in the beginning and 432.0MB in the end (delta: 243.3MB). Free memory was 134.8MB in the beginning and 265.3MB in the end (delta: -130.4MB). Peak memory consumption was 117.0MB. Max. memory is 16.1GB. [2024-10-11 19:26:19,841 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 432.0MB. Free memory is still 264.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:26:19,843 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.17ms. Allocated memory is still 109.1MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.33ms. Allocated memory is still 188.7MB. Free memory was 122.3MB in the beginning and 158.2MB in the end (delta: -35.9MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.69ms. Allocated memory is still 188.7MB. Free memory was 158.2MB in the beginning and 156.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.00ms. Allocated memory is still 188.7MB. Free memory was 156.4MB in the beginning and 154.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 387.13ms. Allocated memory is still 188.7MB. Free memory was 154.3MB in the beginning and 135.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9073.84ms. Allocated memory was 188.7MB in the beginning and 432.0MB in the end (delta: 243.3MB). Free memory was 134.8MB in the beginning and 265.3MB in the end (delta: -130.4MB). Peak memory consumption was 117.0MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 432.0MB. Free memory is still 264.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 693]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 693. Possible FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, argc=49, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, argc=49, i=3, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, i=13, id1=-1, id2=0, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ [L722] CALL 0 reach_error() [L693] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L693] 0 __assert_fail ("0", "triangular-2.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] - UnprovableResult [Line: 711]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 713]: 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: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.9s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1658 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1631 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2966 IncrementalHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 10 mSDtfsCounter, 2966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 209 SyntacticMatches, 8 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2180occurred in iteration=10, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 423 ConstructedInterpolants, 0 QuantifiedInterpolants, 1586 SizeOfPredicates, 29 NumberOfNonLiveVariables, 500 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 0/174 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-10-11 19:26:19,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:26:21,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:26:21,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:26:21,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:26:22,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:26:22,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:26:22,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:26:22,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:26:22,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:26:22,032 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:26:22,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:26:22,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:26:22,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:26:22,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:26:22,034 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:26:22,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:26:22,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:26:22,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:26:22,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:26:22,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:26:22,038 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:26:22,041 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:26:22,041 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:26:22,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:26:22,042 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:26:22,042 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:26:22,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:26:22,042 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:26:22,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:26:22,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:26:22,043 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:26:22,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:26:22,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:26:22,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:26:22,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:26:22,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:26:22,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:26:22,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:26:22,055 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:26:22,055 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:26:22,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:26:22,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:26:22,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:26:22,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:26:22,057 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:26:22,057 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-clean/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-clean/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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2024-10-11 19:26:22,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:26:22,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:26:22,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:26:22,318 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:26:22,319 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:26:22,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-10-11 19:26:23,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:26:24,079 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:26:24,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-10-11 19:26:24,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/299789d42/54661d70b4d341599e96c57bbc2acd0a/FLAG5352aacae [2024-10-11 19:26:24,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/299789d42/54661d70b4d341599e96c57bbc2acd0a [2024-10-11 19:26:24,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:26:24,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:26:24,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:26:24,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:26:24,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:26:24,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1121232d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24, skipping insertion in model container [2024-10-11 19:26:24,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:26:24,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:26:24,468 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:26:24,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:26:24,561 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:26:24,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24 WrapperNode [2024-10-11 19:26:24,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:26:24,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:26:24,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:26:24,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:26:24,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,593 INFO L138 Inliner]: procedures = 169, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2024-10-11 19:26:24,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:26:24,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:26:24,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:26:24,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:26:24,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,617 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 19:26:24,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:26:24,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:26:24,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:26:24,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:26:24,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24" (1/1) ... [2024-10-11 19:26:24,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:26:24,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:26:24,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:26:24,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:26:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-11 19:26:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-11 19:26:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-11 19:26:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-11 19:26:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:26:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:26:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:26:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:26:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:26:24,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:26:24,716 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:26:24,845 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:26:24,847 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:26:24,990 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:26:24,990 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:26:25,101 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:26:25,102 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 19:26:25,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:26:25 BoogieIcfgContainer [2024-10-11 19:26:25,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:26:25,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:26:25,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:26:25,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:26:25,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:26:24" (1/3) ... [2024-10-11 19:26:25,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62dd980d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:26:25, skipping insertion in model container [2024-10-11 19:26:25,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:24" (2/3) ... [2024-10-11 19:26:25,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62dd980d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:26:25, skipping insertion in model container [2024-10-11 19:26:25,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:26:25" (3/3) ... [2024-10-11 19:26:25,131 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-10-11 19:26:25,143 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:26:25,143 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 19:26:25,143 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:26:25,175 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:26:25,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2024-10-11 19:26:25,222 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-10-11 19:26:25,222 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:26:25,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-10-11 19:26:25,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2024-10-11 19:26:25,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2024-10-11 19:26:25,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:26:25,245 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;@3ae6912b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:26:25,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 19:26:25,255 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:26:25,255 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2024-10-11 19:26:25,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:26:25,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:25,256 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:25,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:25,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1944846646, now seen corresponding path program 1 times [2024-10-11 19:26:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995521603] [2024-10-11 19:26:25,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:25,271 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-10-11 19:26:25,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:25,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 19:26:25,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:25,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:26:25,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:25,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:25,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:25,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995521603] [2024-10-11 19:26:25,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995521603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:25,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:25,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:26:25,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732520936] [2024-10-11 19:26:25,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:25,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:26:25,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:25,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:26:25,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:26:25,445 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2024-10-11 19:26:25,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-11 19:26:25,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:25,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2024-10-11 19:26:25,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:25,513 INFO L124 PetriNetUnfolderBase]: 70/157 cut-off events. [2024-10-11 19:26:25,513 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 19:26:25,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 157 events. 70/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 552 event pairs, 44 based on Foata normal form. 15/161 useless extension candidates. Maximal degree in co-relation 272. Up to 113 conditions per place. [2024-10-11 19:26:25,519 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 11 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2024-10-11 19:26:25,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 78 flow [2024-10-11 19:26:25,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:26:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:26:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-10-11 19:26:25,528 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-10-11 19:26:25,531 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 52 transitions. [2024-10-11 19:26:25,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 78 flow [2024-10-11 19:26:25,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:26:25,534 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2024-10-11 19:26:25,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2024-10-11 19:26:25,538 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2024-10-11 19:26:25,538 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2024-10-11 19:26:25,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-11 19:26:25,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:25,538 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:25,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:25,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 19:26:25,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:25,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:25,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1944845514, now seen corresponding path program 1 times [2024-10-11 19:26:25,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:25,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186637514] [2024-10-11 19:26:25,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:25,747 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-10-11 19:26:25,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:25,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 19:26:25,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:25,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:26:25,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:25,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:25,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186637514] [2024-10-11 19:26:25,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186637514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:25,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:25,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:26:25,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142177811] [2024-10-11 19:26:25,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:25,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:26:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:25,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:26:25,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:26:25,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:25,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-11 19:26:25,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:25,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:25,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:26,135 INFO L124 PetriNetUnfolderBase]: 328/593 cut-off events. [2024-10-11 19:26:26,136 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:26:26,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 593 events. 328/593 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2597 event pairs, 45 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 1120. Up to 243 conditions per place. [2024-10-11 19:26:26,139 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 29 selfloop transitions, 7 changer transitions 29/69 dead transitions. [2024-10-11 19:26:26,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 69 transitions, 274 flow [2024-10-11 19:26:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:26:26,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:26:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-10-11 19:26:26,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5646551724137931 [2024-10-11 19:26:26,142 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 8 states and 131 transitions. [2024-10-11 19:26:26,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 69 transitions, 274 flow [2024-10-11 19:26:26,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 69 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:26:26,144 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 100 flow [2024-10-11 19:26:26,144 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2024-10-11 19:26:26,145 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-10-11 19:26:26,145 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 100 flow [2024-10-11 19:26:26,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-11 19:26:26,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:26,146 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:26,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:26,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 19:26:26,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:26,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash 407958523, now seen corresponding path program 1 times [2024-10-11 19:26:26,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:26,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949413050] [2024-10-11 19:26:26,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:26,351 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-10-11 19:26:26,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:26,352 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 19:26:26,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:26,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:26:26,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:26,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:26,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:26,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949413050] [2024-10-11 19:26:26,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949413050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:26,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:26,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:26:26,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721382065] [2024-10-11 19:26:26,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:26,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:26:26,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:26,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:26:26,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:26:26,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:26,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-11 19:26:26,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:26,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:26,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:26,649 INFO L124 PetriNetUnfolderBase]: 247/454 cut-off events. [2024-10-11 19:26:26,649 INFO L125 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2024-10-11 19:26:26,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 454 events. 247/454 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1806 event pairs, 50 based on Foata normal form. 18/468 useless extension candidates. Maximal degree in co-relation 1170. Up to 190 conditions per place. [2024-10-11 19:26:26,652 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 30 selfloop transitions, 9 changer transitions 16/59 dead transitions. [2024-10-11 19:26:26,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 316 flow [2024-10-11 19:26:26,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:26:26,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:26:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-10-11 19:26:26,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.541871921182266 [2024-10-11 19:26:26,654 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 100 flow. Second operand 7 states and 110 transitions. [2024-10-11 19:26:26,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 316 flow [2024-10-11 19:26:26,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-11 19:26:26,657 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 143 flow [2024-10-11 19:26:26,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2024-10-11 19:26:26,658 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-10-11 19:26:26,658 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 143 flow [2024-10-11 19:26:26,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-11 19:26:26,658 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:26,658 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:26,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 19:26:26,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 19:26:26,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:26,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:26,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1492998092, now seen corresponding path program 1 times [2024-10-11 19:26:26,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:26,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248395815] [2024-10-11 19:26:26,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:26,860 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-10-11 19:26:26,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:26,863 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 19:26:26,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:26,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:26:26,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:27,006 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:27,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:27,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248395815] [2024-10-11 19:26:27,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248395815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:27,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:27,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:26:27,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536139403] [2024-10-11 19:26:27,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:27,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:26:27,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:27,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:26:27,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:26:27,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:27,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-11 19:26:27,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:27,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:27,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:27,192 INFO L124 PetriNetUnfolderBase]: 391/725 cut-off events. [2024-10-11 19:26:27,192 INFO L125 PetriNetUnfolderBase]: For 1146/1146 co-relation queries the response was YES. [2024-10-11 19:26:27,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 725 events. 391/725 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3195 event pairs, 95 based on Foata normal form. 27/748 useless extension candidates. Maximal degree in co-relation 2098. Up to 264 conditions per place. [2024-10-11 19:26:27,195 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 47 selfloop transitions, 11 changer transitions 20/82 dead transitions. [2024-10-11 19:26:27,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 82 transitions, 517 flow [2024-10-11 19:26:27,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:26:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:26:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-10-11 19:26:27,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-10-11 19:26:27,197 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 143 flow. Second operand 9 states and 144 transitions. [2024-10-11 19:26:27,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 82 transitions, 517 flow [2024-10-11 19:26:27,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 478 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-10-11 19:26:27,201 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 236 flow [2024-10-11 19:26:27,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2024-10-11 19:26:27,202 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2024-10-11 19:26:27,202 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 236 flow [2024-10-11 19:26:27,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-11 19:26:27,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:27,203 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:27,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:27,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-11 19:26:27,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:27,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1610009804, now seen corresponding path program 2 times [2024-10-11 19:26:27,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:27,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487260151] [2024-10-11 19:26:27,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:26:27,404 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-10-11 19:26:27,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:27,407 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 19:26:27,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:27,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 19:26:27,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:26:27,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:26:27,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:27,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:27,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:27,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487260151] [2024-10-11 19:26:27,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487260151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:27,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:27,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:26:27,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554743269] [2024-10-11 19:26:27,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:27,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:26:27,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:27,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:26:27,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:26:27,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:27,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-11 19:26:27,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:27,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:27,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:27,666 INFO L124 PetriNetUnfolderBase]: 346/655 cut-off events. [2024-10-11 19:26:27,666 INFO L125 PetriNetUnfolderBase]: For 2058/2058 co-relation queries the response was YES. [2024-10-11 19:26:27,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 655 events. 346/655 cut-off events. For 2058/2058 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2872 event pairs, 88 based on Foata normal form. 45/696 useless extension candidates. Maximal degree in co-relation 2166. Up to 273 conditions per place. [2024-10-11 19:26:27,669 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 40 selfloop transitions, 12 changer transitions 30/86 dead transitions. [2024-10-11 19:26:27,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 655 flow [2024-10-11 19:26:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:26:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:26:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-10-11 19:26:27,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2024-10-11 19:26:27,670 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 236 flow. Second operand 9 states and 140 transitions. [2024-10-11 19:26:27,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 655 flow [2024-10-11 19:26:27,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 595 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-10-11 19:26:27,675 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 278 flow [2024-10-11 19:26:27,676 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=278, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2024-10-11 19:26:27,676 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-10-11 19:26:27,676 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 278 flow [2024-10-11 19:26:27,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-11 19:26:27,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:27,677 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:27,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:27,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-11 19:26:27,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:27,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1235422649, now seen corresponding path program 1 times [2024-10-11 19:26:27,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:27,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135224994] [2024-10-11 19:26:27,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:27,881 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-10-11 19:26:27,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:27,883 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-11 19:26:27,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:27,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:26:27,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:27,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:27,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:27,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135224994] [2024-10-11 19:26:27,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135224994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:27,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:27,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:26:27,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320044874] [2024-10-11 19:26:27,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:27,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:26:27,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:27,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:26:27,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:26:27,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:27,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-11 19:26:27,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:27,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:27,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:28,231 INFO L124 PetriNetUnfolderBase]: 427/806 cut-off events. [2024-10-11 19:26:28,232 INFO L125 PetriNetUnfolderBase]: For 3492/3492 co-relation queries the response was YES. [2024-10-11 19:26:28,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 806 events. 427/806 cut-off events. For 3492/3492 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3713 event pairs, 122 based on Foata normal form. 27/829 useless extension candidates. Maximal degree in co-relation 2874. Up to 316 conditions per place. [2024-10-11 19:26:28,236 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 51 selfloop transitions, 12 changer transitions 26/93 dead transitions. [2024-10-11 19:26:28,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 752 flow [2024-10-11 19:26:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:26:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 19:26:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-10-11 19:26:28,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2024-10-11 19:26:28,237 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 278 flow. Second operand 10 states and 158 transitions. [2024-10-11 19:26:28,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 752 flow [2024-10-11 19:26:28,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 93 transitions, 718 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-10-11 19:26:28,244 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 345 flow [2024-10-11 19:26:28,244 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=345, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2024-10-11 19:26:28,244 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-10-11 19:26:28,245 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 345 flow [2024-10-11 19:26:28,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-11 19:26:28,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:28,245 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:28,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 19:26:28,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-10-11 19:26:28,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:28,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:28,449 INFO L85 PathProgramCache]: Analyzing trace with hash -14089357, now seen corresponding path program 2 times [2024-10-11 19:26:28,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:28,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327393498] [2024-10-11 19:26:28,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:26:28,450 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-10-11 19:26:28,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:28,456 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-10-11 19:26:28,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:28,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 19:26:28,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:26:28,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:26:28,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:28,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:28,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:28,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327393498] [2024-10-11 19:26:28,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327393498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:28,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:28,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:26:28,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590771064] [2024-10-11 19:26:28,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:28,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:26:28,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:28,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:26:28,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:26:28,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:28,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 345 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-11 19:26:28,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:28,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:28,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:28,812 INFO L124 PetriNetUnfolderBase]: 463/891 cut-off events. [2024-10-11 19:26:28,812 INFO L125 PetriNetUnfolderBase]: For 6473/6473 co-relation queries the response was YES. [2024-10-11 19:26:28,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3609 conditions, 891 events. 463/891 cut-off events. For 6473/6473 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4355 event pairs, 120 based on Foata normal form. 27/914 useless extension candidates. Maximal degree in co-relation 3577. Up to 340 conditions per place. [2024-10-11 19:26:28,816 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 56 selfloop transitions, 17 changer transitions 30/107 dead transitions. [2024-10-11 19:26:28,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 978 flow [2024-10-11 19:26:28,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 19:26:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 19:26:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2024-10-11 19:26:28,817 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-10-11 19:26:28,818 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 345 flow. Second operand 12 states and 186 transitions. [2024-10-11 19:26:28,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 978 flow [2024-10-11 19:26:28,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 842 flow, removed 59 selfloop flow, removed 7 redundant places. [2024-10-11 19:26:28,824 INFO L231 Difference]: Finished difference. Result has 75 places, 48 transitions, 395 flow [2024-10-11 19:26:28,824 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=395, PETRI_PLACES=75, PETRI_TRANSITIONS=48} [2024-10-11 19:26:28,825 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2024-10-11 19:26:28,825 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 48 transitions, 395 flow [2024-10-11 19:26:28,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-11 19:26:28,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:28,825 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:28,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:29,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-10-11 19:26:29,028 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:29,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash 476818575, now seen corresponding path program 3 times [2024-10-11 19:26:29,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:29,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940335545] [2024-10-11 19:26:29,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:26:29,029 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-10-11 19:26:29,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:29,031 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-11 19:26:29,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:29,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-11 19:26:29,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:26:29,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:26:29,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:29,149 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:29,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:29,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940335545] [2024-10-11 19:26:29,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940335545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:29,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:29,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:26:29,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697006767] [2024-10-11 19:26:29,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:29,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:26:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:29,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:26:29,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:26:29,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:29,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 48 transitions, 395 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-11 19:26:29,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:29,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:29,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:29,391 INFO L124 PetriNetUnfolderBase]: 436/839 cut-off events. [2024-10-11 19:26:29,391 INFO L125 PetriNetUnfolderBase]: For 6137/6137 co-relation queries the response was YES. [2024-10-11 19:26:29,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3329 conditions, 839 events. 436/839 cut-off events. For 6137/6137 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4049 event pairs, 152 based on Foata normal form. 27/862 useless extension candidates. Maximal degree in co-relation 3295. Up to 555 conditions per place. [2024-10-11 19:26:29,395 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 9 changer transitions 29/96 dead transitions. [2024-10-11 19:26:29,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 96 transitions, 875 flow [2024-10-11 19:26:29,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:26:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 19:26:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2024-10-11 19:26:29,396 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5275862068965518 [2024-10-11 19:26:29,396 INFO L175 Difference]: Start difference. First operand has 75 places, 48 transitions, 395 flow. Second operand 10 states and 153 transitions. [2024-10-11 19:26:29,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 96 transitions, 875 flow [2024-10-11 19:26:29,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 804 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-10-11 19:26:29,404 INFO L231 Difference]: Finished difference. Result has 79 places, 50 transitions, 405 flow [2024-10-11 19:26:29,404 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=405, PETRI_PLACES=79, PETRI_TRANSITIONS=50} [2024-10-11 19:26:29,404 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-10-11 19:26:29,404 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 50 transitions, 405 flow [2024-10-11 19:26:29,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-11 19:26:29,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:29,405 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:29,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:29,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-10-11 19:26:29,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:29,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:29,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1841714377, now seen corresponding path program 4 times [2024-10-11 19:26:29,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:29,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172048899] [2024-10-11 19:26:29,610 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:26:29,610 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-10-11 19:26:29,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:29,613 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-10-11 19:26:29,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:29,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:26:29,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:26:29,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:26:29,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:29,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:29,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172048899] [2024-10-11 19:26:29,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172048899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:29,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:29,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:26:29,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823177820] [2024-10-11 19:26:29,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:29,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:26:29,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:29,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:26:29,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:26:29,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:29,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 50 transitions, 405 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-11 19:26:29,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:29,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:29,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:29,924 INFO L124 PetriNetUnfolderBase]: 463/887 cut-off events. [2024-10-11 19:26:29,924 INFO L125 PetriNetUnfolderBase]: For 6613/6613 co-relation queries the response was YES. [2024-10-11 19:26:29,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3508 conditions, 887 events. 463/887 cut-off events. For 6613/6613 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4332 event pairs, 152 based on Foata normal form. 18/901 useless extension candidates. Maximal degree in co-relation 3472. Up to 456 conditions per place. [2024-10-11 19:26:29,930 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 16 changer transitions 21/95 dead transitions. [2024-10-11 19:26:29,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 95 transitions, 883 flow [2024-10-11 19:26:29,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:26:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:26:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-10-11 19:26:29,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2024-10-11 19:26:29,931 INFO L175 Difference]: Start difference. First operand has 79 places, 50 transitions, 405 flow. Second operand 9 states and 140 transitions. [2024-10-11 19:26:29,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 95 transitions, 883 flow [2024-10-11 19:26:29,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 827 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-10-11 19:26:29,942 INFO L231 Difference]: Finished difference. Result has 81 places, 53 transitions, 468 flow [2024-10-11 19:26:29,943 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=468, PETRI_PLACES=81, PETRI_TRANSITIONS=53} [2024-10-11 19:26:29,943 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2024-10-11 19:26:29,943 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 53 transitions, 468 flow [2024-10-11 19:26:29,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-11 19:26:29,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:29,943 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:29,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-11 19:26:30,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-10-11 19:26:30,144 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:30,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:30,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1638196562, now seen corresponding path program 1 times [2024-10-11 19:26:30,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:30,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058009408] [2024-10-11 19:26:30,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:30,145 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-10-11 19:26:30,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:30,146 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-10-11 19:26:30,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:30,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:26:30,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:30,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:30,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:30,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058009408] [2024-10-11 19:26:30,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058009408] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:30,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:26:30,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-11 19:26:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188234225] [2024-10-11 19:26:30,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:30,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 19:26:30,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:30,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 19:26:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-11 19:26:30,438 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:30,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 53 transitions, 468 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:30,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:30,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:30,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:31,140 INFO L124 PetriNetUnfolderBase]: 697/1284 cut-off events. [2024-10-11 19:26:31,141 INFO L125 PetriNetUnfolderBase]: For 14498/14498 co-relation queries the response was YES. [2024-10-11 19:26:31,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5775 conditions, 1284 events. 697/1284 cut-off events. For 14498/14498 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6066 event pairs, 36 based on Foata normal form. 45/1325 useless extension candidates. Maximal degree in co-relation 5738. Up to 191 conditions per place. [2024-10-11 19:26:31,148 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 69 selfloop transitions, 43 changer transitions 60/176 dead transitions. [2024-10-11 19:26:31,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 176 transitions, 1752 flow [2024-10-11 19:26:31,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 19:26:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-11 19:26:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 323 transitions. [2024-10-11 19:26:31,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5303776683087028 [2024-10-11 19:26:31,150 INFO L175 Difference]: Start difference. First operand has 81 places, 53 transitions, 468 flow. Second operand 21 states and 323 transitions. [2024-10-11 19:26:31,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 176 transitions, 1752 flow [2024-10-11 19:26:31,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 176 transitions, 1659 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-10-11 19:26:31,165 INFO L231 Difference]: Finished difference. Result has 103 places, 69 transitions, 885 flow [2024-10-11 19:26:31,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=885, PETRI_PLACES=103, PETRI_TRANSITIONS=69} [2024-10-11 19:26:31,165 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2024-10-11 19:26:31,166 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 69 transitions, 885 flow [2024-10-11 19:26:31,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:31,166 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:31,166 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:31,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:31,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-10-11 19:26:31,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:31,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:31,370 INFO L85 PathProgramCache]: Analyzing trace with hash -389170009, now seen corresponding path program 1 times [2024-10-11 19:26:31,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:31,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326254752] [2024-10-11 19:26:31,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:31,370 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-10-11 19:26:31,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:31,371 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-10-11 19:26:31,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:31,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:26:31,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:31,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:31,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:31,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326254752] [2024-10-11 19:26:31,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326254752] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:31,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:26:31,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-11 19:26:31,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754729596] [2024-10-11 19:26:31,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:31,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 19:26:31,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:31,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 19:26:31,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 19:26:31,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:31,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 69 transitions, 885 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:31,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:31,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:31,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:32,271 INFO L124 PetriNetUnfolderBase]: 787/1487 cut-off events. [2024-10-11 19:26:32,272 INFO L125 PetriNetUnfolderBase]: For 27581/27581 co-relation queries the response was YES. [2024-10-11 19:26:32,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7600 conditions, 1487 events. 787/1487 cut-off events. For 27581/27581 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7270 event pairs, 239 based on Foata normal form. 63/1546 useless extension candidates. Maximal degree in co-relation 7555. Up to 828 conditions per place. [2024-10-11 19:26:32,281 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 85 selfloop transitions, 19 changer transitions 67/175 dead transitions. [2024-10-11 19:26:32,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 175 transitions, 2251 flow [2024-10-11 19:26:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:26:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-11 19:26:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2024-10-11 19:26:32,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5226860254083484 [2024-10-11 19:26:32,283 INFO L175 Difference]: Start difference. First operand has 103 places, 69 transitions, 885 flow. Second operand 19 states and 288 transitions. [2024-10-11 19:26:32,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 175 transitions, 2251 flow [2024-10-11 19:26:32,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 175 transitions, 1697 flow, removed 258 selfloop flow, removed 14 redundant places. [2024-10-11 19:26:32,314 INFO L231 Difference]: Finished difference. Result has 115 places, 75 transitions, 766 flow [2024-10-11 19:26:32,315 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=766, PETRI_PLACES=115, PETRI_TRANSITIONS=75} [2024-10-11 19:26:32,315 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2024-10-11 19:26:32,316 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 75 transitions, 766 flow [2024-10-11 19:26:32,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:32,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:32,316 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:32,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:32,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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-10-11 19:26:32,517 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:32,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash -295210743, now seen corresponding path program 2 times [2024-10-11 19:26:32,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:32,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904840077] [2024-10-11 19:26:32,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:26:32,518 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-10-11 19:26:32,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:32,519 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/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-10-11 19:26:32,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:26:32,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:26:32,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:26:32,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:26:32,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:32,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:32,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:32,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904840077] [2024-10-11 19:26:32,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904840077] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:32,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:26:32,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-11 19:26:32,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669284796] [2024-10-11 19:26:32,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:32,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 19:26:32,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:32,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 19:26:32,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-11 19:26:32,754 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:32,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 75 transitions, 766 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:32,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:32,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:32,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:33,837 INFO L124 PetriNetUnfolderBase]: 1246/2341 cut-off events. [2024-10-11 19:26:33,837 INFO L125 PetriNetUnfolderBase]: For 56993/56993 co-relation queries the response was YES. [2024-10-11 19:26:33,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13174 conditions, 2341 events. 1246/2341 cut-off events. For 56993/56993 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12828 event pairs, 88 based on Foata normal form. 63/2400 useless extension candidates. Maximal degree in co-relation 13124. Up to 478 conditions per place. [2024-10-11 19:26:33,856 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 129 selfloop transitions, 54 changer transitions 59/246 dead transitions. [2024-10-11 19:26:33,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 246 transitions, 3242 flow [2024-10-11 19:26:33,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 19:26:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-10-11 19:26:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 421 transitions. [2024-10-11 19:26:33,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5376756066411239 [2024-10-11 19:26:33,858 INFO L175 Difference]: Start difference. First operand has 115 places, 75 transitions, 766 flow. Second operand 27 states and 421 transitions. [2024-10-11 19:26:33,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 246 transitions, 3242 flow [2024-10-11 19:26:33,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 246 transitions, 2735 flow, removed 241 selfloop flow, removed 12 redundant places. [2024-10-11 19:26:33,892 INFO L231 Difference]: Finished difference. Result has 139 places, 97 transitions, 1308 flow [2024-10-11 19:26:33,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1308, PETRI_PLACES=139, PETRI_TRANSITIONS=97} [2024-10-11 19:26:33,893 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2024-10-11 19:26:33,893 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 97 transitions, 1308 flow [2024-10-11 19:26:33,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:33,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:33,895 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:33,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 19:26:34,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/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-10-11 19:26:34,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:34,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:34,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1659104887, now seen corresponding path program 3 times [2024-10-11 19:26:34,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:34,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460023310] [2024-10-11 19:26:34,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:26:34,097 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-10-11 19:26:34,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:34,099 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-10-11 19:26:34,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 19:26:34,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 19:26:34,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:26:34,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:26:34,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:34,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:34,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:34,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460023310] [2024-10-11 19:26:34,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460023310] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:34,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:26:34,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-11 19:26:34,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340068971] [2024-10-11 19:26:34,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:34,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 19:26:34,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:34,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 19:26:34,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 19:26:34,328 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:34,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 97 transitions, 1308 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:34,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:34,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:34,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:35,261 INFO L124 PetriNetUnfolderBase]: 1318/2463 cut-off events. [2024-10-11 19:26:35,261 INFO L125 PetriNetUnfolderBase]: For 90317/90317 co-relation queries the response was YES. [2024-10-11 19:26:35,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15105 conditions, 2463 events. 1318/2463 cut-off events. For 90317/90317 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 13451 event pairs, 122 based on Foata normal form. 162/2621 useless extension candidates. Maximal degree in co-relation 15045. Up to 454 conditions per place. [2024-10-11 19:26:35,278 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 99 selfloop transitions, 68 changer transitions 95/266 dead transitions. [2024-10-11 19:26:35,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 266 transitions, 4146 flow [2024-10-11 19:26:35,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 19:26:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-10-11 19:26:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 383 transitions. [2024-10-11 19:26:35,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5282758620689655 [2024-10-11 19:26:35,280 INFO L175 Difference]: Start difference. First operand has 139 places, 97 transitions, 1308 flow. Second operand 25 states and 383 transitions. [2024-10-11 19:26:35,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 266 transitions, 4146 flow [2024-10-11 19:26:35,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 266 transitions, 3311 flow, removed 402 selfloop flow, removed 14 redundant places. [2024-10-11 19:26:35,403 INFO L231 Difference]: Finished difference. Result has 158 places, 115 transitions, 1613 flow [2024-10-11 19:26:35,404 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1613, PETRI_PLACES=158, PETRI_TRANSITIONS=115} [2024-10-11 19:26:35,404 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 128 predicate places. [2024-10-11 19:26:35,404 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 115 transitions, 1613 flow [2024-10-11 19:26:35,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:35,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:35,405 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:35,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-11 19:26:35,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-10-11 19:26:35,608 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:35,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:35,609 INFO L85 PathProgramCache]: Analyzing trace with hash -627287686, now seen corresponding path program 1 times [2024-10-11 19:26:35,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:35,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657060250] [2024-10-11 19:26:35,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:35,610 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-10-11 19:26:35,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:35,612 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-10-11 19:26:35,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 19:26:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:35,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 19:26:35,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:35,736 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 19:26:35,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 19:26:35,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657060250] [2024-10-11 19:26:35,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657060250] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:35,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:26:35,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-10-11 19:26:35,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576336114] [2024-10-11 19:26:35,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:35,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 19:26:35,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:35,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 19:26:35,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-11 19:26:36,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-11 19:26:36,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 115 transitions, 1613 flow. Second operand has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 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-10-11 19:26:36,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:36,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-11 19:26:36,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:38,104 INFO L124 PetriNetUnfolderBase]: 1687/3115 cut-off events. [2024-10-11 19:26:38,104 INFO L125 PetriNetUnfolderBase]: For 123387/123387 co-relation queries the response was YES. [2024-10-11 19:26:38,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19174 conditions, 3115 events. 1687/3115 cut-off events. For 123387/123387 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 16798 event pairs, 48 based on Foata normal form. 72/3183 useless extension candidates. Maximal degree in co-relation 19107. Up to 477 conditions per place. [2024-10-11 19:26:38,135 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 125 selfloop transitions, 111 changer transitions 105/345 dead transitions. [2024-10-11 19:26:38,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 345 transitions, 5341 flow [2024-10-11 19:26:38,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-11 19:26:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-10-11 19:26:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 551 transitions. [2024-10-11 19:26:38,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-10-11 19:26:38,141 INFO L175 Difference]: Start difference. First operand has 158 places, 115 transitions, 1613 flow. Second operand 36 states and 551 transitions. [2024-10-11 19:26:38,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 345 transitions, 5341 flow [2024-10-11 19:26:38,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 345 transitions, 4700 flow, removed 296 selfloop flow, removed 19 redundant places. [2024-10-11 19:26:38,298 INFO L231 Difference]: Finished difference. Result has 186 places, 154 transitions, 2535 flow [2024-10-11 19:26:38,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2535, PETRI_PLACES=186, PETRI_TRANSITIONS=154} [2024-10-11 19:26:38,298 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2024-10-11 19:26:38,298 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 154 transitions, 2535 flow [2024-10-11 19:26:38,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 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-10-11 19:26:38,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:38,299 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:38,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-11 19:26:38,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/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-10-11 19:26:38,500 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:26:38,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash 291804209, now seen corresponding path program 2 times [2024-10-11 19:26:38,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:38,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924152178] [2024-10-11 19:26:38,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:26:38,501 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-10-11 19:26:38,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:38,502 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/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-10-11 19:26:38,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 19:26:38,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:26:38,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-11 19:26:38,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:26:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:26:38,598 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 19:26:38,598 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:26:38,599 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-10-11 19:26:38,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-10-11 19:26:38,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-10-11 19:26:38,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-10-11 19:26:38,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-11 19:26:38,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/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-10-11 19:26:38,802 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1] [2024-10-11 19:26:38,847 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:26:38,847 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:26:38,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:26:38 BasicIcfg [2024-10-11 19:26:38,851 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:26:38,851 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:26:38,851 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:26:38,851 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:26:38,851 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:26:25" (3/4) ... [2024-10-11 19:26:38,853 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:26:38,854 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:26:38,854 INFO L158 Benchmark]: Toolchain (without parser) took 14744.05ms. Allocated memory was 83.9MB in the beginning and 404.8MB in the end (delta: 320.9MB). Free memory was 54.5MB in the beginning and 165.7MB in the end (delta: -111.1MB). Peak memory consumption was 212.3MB. Max. memory is 16.1GB. [2024-10-11 19:26:38,854 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 83.9MB. Free memory is still 58.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:26:38,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.01ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 60.0MB in the end (delta: -5.7MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-10-11 19:26:38,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.94ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 57.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:26:38,855 INFO L158 Benchmark]: Boogie Preprocessor took 45.75ms. Allocated memory is still 83.9MB. Free memory was 57.7MB in the beginning and 55.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:26:38,855 INFO L158 Benchmark]: RCFGBuilder took 464.70ms. Allocated memory is still 83.9MB. Free memory was 55.6MB in the beginning and 31.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 19:26:38,855 INFO L158 Benchmark]: TraceAbstraction took 13726.24ms. Allocated memory was 125.8MB in the beginning and 404.8MB in the end (delta: 278.9MB). Free memory was 102.9MB in the beginning and 166.7MB in the end (delta: -63.8MB). Peak memory consumption was 213.6MB. Max. memory is 16.1GB. [2024-10-11 19:26:38,855 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 404.8MB. Free memory was 166.7MB in the beginning and 165.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:26:38,856 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.10ms. Allocated memory is still 83.9MB. Free memory is still 58.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.01ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 60.0MB in the end (delta: -5.7MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.94ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 57.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.75ms. Allocated memory is still 83.9MB. Free memory was 57.7MB in the beginning and 55.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.70ms. Allocated memory is still 83.9MB. Free memory was 55.6MB in the beginning and 31.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13726.24ms. Allocated memory was 125.8MB in the beginning and 404.8MB in the end (delta: 278.9MB). Free memory was 102.9MB in the beginning and 166.7MB in the end (delta: -63.8MB). Peak memory consumption was 213.6MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 404.8MB. Free memory was 166.7MB in the beginning and 165.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 693]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 693. Possible FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=17, \old(argv)={19:18}, argc=17, i=3, id1=0, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=17, \old(argv)={19:18}, arg={0:0}, argc=17, i=3, id1=0, id2=1, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=17, \old(argv)={19:18}, arg={0:0}, arg={0:0}, argc=17, condI=0, i=7, id1=0, id2=1, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=17, \old(argv)={19:18}, arg={0:0}, arg={0:0}, argc=17, condI=0, condJ=1, i=15, id1=0, id2=1, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ [L722] CALL 0 reach_error() [L693] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L693] 0 __assert_fail ("0", "triangular-2.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] - UnprovableResult [Line: 711]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 714]: 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: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.6s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1701 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1681 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4443 IncrementalHoareTripleChecker+Invalid, 4526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 11 mSDtfsCounter, 4443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2535occurred in iteration=14, InterpolantAutomatonStates: 205, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 1930 SizeOfPredicates, 44 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 4/60 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-10-11 19:26:38,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample