./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-wmm/mix046.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:18:31,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:18:31,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:18:31,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:18:31,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:18:31,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:18:31,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:18:31,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:18:31,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:18:31,789 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:18:31,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:18:31,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:18:31,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:18:31,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:18:31,791 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:18:31,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:18:31,791 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:18:31,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:18:31,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:18:31,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:18:31,793 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:18:31,793 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:18:31,793 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:18:31,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:18:31,794 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:18:31,794 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:18:31,795 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:18:31,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:18:31,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:18:31,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:18:31,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:18:31,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:18:31,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:18:31,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:18:31,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:18:31,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:18:31,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:18:31,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:18:31,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:18:31,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:18:31,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:18:31,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:18:31,800 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 [2024-10-13 12:18:32,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:18:32,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:18:32,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:18:32,099 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:18:32,100 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:18:32,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046.opt.i [2024-10-13 12:18:33,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:18:34,081 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:18:34,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046.opt.i [2024-10-13 12:18:34,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8036567ca/16d979c615d34d42b9ffabfa666858ff/FLAG2a68eac52 [2024-10-13 12:18:34,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8036567ca/16d979c615d34d42b9ffabfa666858ff [2024-10-13 12:18:34,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:18:34,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:18:34,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:18:34,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:18:34,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:18:34,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65be3379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34, skipping insertion in model container [2024-10-13 12:18:34,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:18:34,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:18:34,662 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:18:34,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:18:34,804 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:18:34,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34 WrapperNode [2024-10-13 12:18:34,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:18:34,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:18:34,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:18:34,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:18:34,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,889 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2024-10-13 12:18:34,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:18:34,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:18:34,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:18:34,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:18:34,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,940 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-13 12:18:34,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:18:34,979 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:18:34,979 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:18:34,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:18:34,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34" (1/1) ... [2024-10-13 12:18:34,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:18:35,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:18:35,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:18:35,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:18:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:18:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:18:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 12:18:35,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 12:18:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 12:18:35,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 12:18:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 12:18:35,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 12:18:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-13 12:18:35,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-13 12:18:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:18:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:18:35,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:18:35,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:18:35,087 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:18:35,223 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:18:35,225 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:18:35,633 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:18:35,634 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:18:35,890 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:18:35,891 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:18:35,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:18:35 BoogieIcfgContainer [2024-10-13 12:18:35,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:18:35,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:18:35,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:18:35,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:18:35,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:18:34" (1/3) ... [2024-10-13 12:18:35,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1068d675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:18:35, skipping insertion in model container [2024-10-13 12:18:35,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:34" (2/3) ... [2024-10-13 12:18:35,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1068d675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:18:35, skipping insertion in model container [2024-10-13 12:18:35,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:18:35" (3/3) ... [2024-10-13 12:18:35,903 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2024-10-13 12:18:35,930 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:18:35,931 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-13 12:18:35,931 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:18:36,004 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:18:36,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-10-13 12:18:36,100 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-10-13 12:18:36,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:18:36,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-10-13 12:18:36,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-10-13 12:18:36,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-10-13 12:18:36,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:18:36,135 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;@1f30030e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:18:36,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 12:18:36,149 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:18:36,149 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-10-13 12:18:36,150 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:18:36,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:18:36,152 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:18:36,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:18:36,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:18:36,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1073874385, now seen corresponding path program 1 times [2024-10-13 12:18:36,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:18:36,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391466590] [2024-10-13 12:18:36,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:18:36,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:18:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:18:36,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:18:36,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:18:36,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391466590] [2024-10-13 12:18:36,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391466590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:18:36,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:18:36,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:18:36,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621047446] [2024-10-13 12:18:36,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:18:36,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:18:36,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:18:36,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:18:36,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:18:36,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-10-13 12:18:36,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-13 12:18:36,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:18:36,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-10-13 12:18:36,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:18:37,467 INFO L124 PetriNetUnfolderBase]: 1047/2051 cut-off events. [2024-10-13 12:18:37,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:18:37,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 2051 events. 1047/2051 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 15656 event pairs, 219 based on Foata normal form. 96/2121 useless extension candidates. Maximal degree in co-relation 3599. Up to 1153 conditions per place. [2024-10-13 12:18:37,501 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 31 selfloop transitions, 2 changer transitions 2/59 dead transitions. [2024-10-13 12:18:37,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 200 flow [2024-10-13 12:18:37,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:18:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:18:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-10-13 12:18:37,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7515151515151515 [2024-10-13 12:18:37,518 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 124 transitions. [2024-10-13 12:18:37,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 200 flow [2024-10-13 12:18:37,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:18:37,527 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-10-13 12:18:37,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-10-13 12:18:37,535 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-10-13 12:18:37,535 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-10-13 12:18:37,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-13 12:18:37,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:18:37,536 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:18:37,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:18:37,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:18:37,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:18:37,537 INFO L85 PathProgramCache]: Analyzing trace with hash 838955505, now seen corresponding path program 1 times [2024-10-13 12:18:37,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:18:37,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635559102] [2024-10-13 12:18:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:18:37,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:18:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:18:37,663 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-13 12:18:37,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:18:37,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635559102] [2024-10-13 12:18:37,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635559102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:18:37,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:18:37,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:18:37,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988013553] [2024-10-13 12:18:37,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:18:37,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:18:37,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:18:37,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:18:37,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:18:37,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-10-13 12:18:37,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-13 12:18:37,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:18:37,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-10-13 12:18:37,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:18:37,961 INFO L124 PetriNetUnfolderBase]: 931/1635 cut-off events. [2024-10-13 12:18:37,962 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-10-13 12:18:37,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 1635 events. 931/1635 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 11815 event pairs, 931 based on Foata normal form. 48/1621 useless extension candidates. Maximal degree in co-relation 3115. Up to 1352 conditions per place. [2024-10-13 12:18:37,983 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 20 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-10-13 12:18:37,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 146 flow [2024-10-13 12:18:37,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:18:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:18:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-10-13 12:18:37,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-10-13 12:18:37,986 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 104 transitions. [2024-10-13 12:18:37,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 146 flow [2024-10-13 12:18:37,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:18:37,993 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-10-13 12:18:37,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-10-13 12:18:37,994 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-10-13 12:18:37,994 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-10-13 12:18:37,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-13 12:18:37,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:18:37,995 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:18:37,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:18:37,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:18:37,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:18:37,997 INFO L85 PathProgramCache]: Analyzing trace with hash 838956791, now seen corresponding path program 1 times [2024-10-13 12:18:37,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:18:37,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278138239] [2024-10-13 12:18:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:18:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:18:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:18:38,387 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-13 12:18:38,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:18:38,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278138239] [2024-10-13 12:18:38,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278138239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:18:38,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:18:38,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:18:38,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922665076] [2024-10-13 12:18:38,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:18:38,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:18:38,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:18:38,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:18:38,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:18:38,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-13 12:18:38,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-13 12:18:38,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:18:38,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-13 12:18:38,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:18:39,301 INFO L124 PetriNetUnfolderBase]: 4352/6574 cut-off events. [2024-10-13 12:18:39,301 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:18:39,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12709 conditions, 6574 events. 4352/6574 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 43914 event pairs, 536 based on Foata normal form. 180/6737 useless extension candidates. Maximal degree in co-relation 12703. Up to 4015 conditions per place. [2024-10-13 12:18:39,360 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 45 selfloop transitions, 6 changer transitions 1/70 dead transitions. [2024-10-13 12:18:39,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 260 flow [2024-10-13 12:18:39,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:18:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:18:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-10-13 12:18:39,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2024-10-13 12:18:39,365 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 4 states and 146 transitions. [2024-10-13 12:18:39,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 260 flow [2024-10-13 12:18:39,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:18:39,368 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 139 flow [2024-10-13 12:18:39,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-10-13 12:18:39,370 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2024-10-13 12:18:39,370 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 139 flow [2024-10-13 12:18:39,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-13 12:18:39,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:18:39,371 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:18:39,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:18:39,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:18:39,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:18:39,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1279553414, now seen corresponding path program 1 times [2024-10-13 12:18:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:18:39,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393905158] [2024-10-13 12:18:39,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:18:39,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:18:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:18:39,684 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-13 12:18:39,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:18:39,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393905158] [2024-10-13 12:18:39,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393905158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:18:39,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:18:39,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:18:39,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400724334] [2024-10-13 12:18:39,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:18:39,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:18:39,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:18:39,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:18:39,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:18:39,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-13 12:18:39,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:18:39,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:18:39,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-13 12:18:39,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:18:40,479 INFO L124 PetriNetUnfolderBase]: 3648/5558 cut-off events. [2024-10-13 12:18:40,479 INFO L125 PetriNetUnfolderBase]: For 1509/1509 co-relation queries the response was YES. [2024-10-13 12:18:40,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12822 conditions, 5558 events. 3648/5558 cut-off events. For 1509/1509 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 35961 event pairs, 192 based on Foata normal form. 174/5717 useless extension candidates. Maximal degree in co-relation 12813. Up to 3097 conditions per place. [2024-10-13 12:18:40,601 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 57 selfloop transitions, 10 changer transitions 1/86 dead transitions. [2024-10-13 12:18:40,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 380 flow [2024-10-13 12:18:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:18:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:18:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2024-10-13 12:18:40,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2024-10-13 12:18:40,604 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 139 flow. Second operand 5 states and 185 transitions. [2024-10-13 12:18:40,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 380 flow [2024-10-13 12:18:40,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 369 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 12:18:40,610 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 191 flow [2024-10-13 12:18:40,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-10-13 12:18:40,611 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2024-10-13 12:18:40,611 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 191 flow [2024-10-13 12:18:40,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:18:40,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:18:40,612 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:18:40,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:18:40,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:18:40,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:18:40,613 INFO L85 PathProgramCache]: Analyzing trace with hash -418582307, now seen corresponding path program 1 times [2024-10-13 12:18:40,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:18:40,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944990002] [2024-10-13 12:18:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:18:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:18:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:18:40,860 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-13 12:18:40,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:18:40,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944990002] [2024-10-13 12:18:40,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944990002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:18:40,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:18:40,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:18:40,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985832736] [2024-10-13 12:18:40,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:18:40,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:18:40,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:18:40,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:18:40,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:18:40,876 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-13 12:18:40,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:18:40,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:18:40,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-13 12:18:40,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:18:41,495 INFO L124 PetriNetUnfolderBase]: 2373/3637 cut-off events. [2024-10-13 12:18:41,496 INFO L125 PetriNetUnfolderBase]: For 2865/2865 co-relation queries the response was YES. [2024-10-13 12:18:41,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9448 conditions, 3637 events. 2373/3637 cut-off events. For 2865/2865 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20831 event pairs, 69 based on Foata normal form. 140/3763 useless extension candidates. Maximal degree in co-relation 9437. Up to 1465 conditions per place. [2024-10-13 12:18:41,531 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 67 selfloop transitions, 14 changer transitions 1/100 dead transitions. [2024-10-13 12:18:41,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 100 transitions, 499 flow [2024-10-13 12:18:41,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:18:41,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:18:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2024-10-13 12:18:41,533 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2024-10-13 12:18:41,533 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 191 flow. Second operand 6 states and 222 transitions. [2024-10-13 12:18:41,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 100 transitions, 499 flow [2024-10-13 12:18:41,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 469 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-13 12:18:41,545 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 241 flow [2024-10-13 12:18:41,546 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2024-10-13 12:18:41,547 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-10-13 12:18:41,548 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 241 flow [2024-10-13 12:18:41,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:18:41,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:18:41,549 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:18:41,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:18:41,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:18:41,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:18:41,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2083080144, now seen corresponding path program 1 times [2024-10-13 12:18:41,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:18:41,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028356790] [2024-10-13 12:18:41,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:18:41,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:18:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:18:41,891 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-13 12:18:41,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:18:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028356790] [2024-10-13 12:18:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028356790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:18:41,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:18:41,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:18:41,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334017549] [2024-10-13 12:18:41,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:18:41,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:18:41,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:18:41,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:18:41,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:18:41,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-13 12:18:41,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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-13 12:18:41,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:18:41,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-13 12:18:41,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:18:42,354 INFO L124 PetriNetUnfolderBase]: 1385/2077 cut-off events. [2024-10-13 12:18:42,354 INFO L125 PetriNetUnfolderBase]: For 3115/3115 co-relation queries the response was YES. [2024-10-13 12:18:42,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6137 conditions, 2077 events. 1385/2077 cut-off events. For 3115/3115 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9960 event pairs, 39 based on Foata normal form. 72/2135 useless extension candidates. Maximal degree in co-relation 6125. Up to 668 conditions per place. [2024-10-13 12:18:42,369 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 61 selfloop transitions, 18 changer transitions 1/98 dead transitions. [2024-10-13 12:18:42,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 98 transitions, 501 flow [2024-10-13 12:18:42,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:18:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:18:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 243 transitions. [2024-10-13 12:18:42,372 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6311688311688312 [2024-10-13 12:18:42,372 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 241 flow. Second operand 7 states and 243 transitions. [2024-10-13 12:18:42,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 98 transitions, 501 flow [2024-10-13 12:18:42,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 455 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-13 12:18:42,388 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 251 flow [2024-10-13 12:18:42,388 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-10-13 12:18:42,389 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2024-10-13 12:18:42,389 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 251 flow [2024-10-13 12:18:42,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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-13 12:18:42,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:18:42,390 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:18:42,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:18:42,391 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:18:42,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:18:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash 963328544, now seen corresponding path program 1 times [2024-10-13 12:18:42,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:18:42,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164757638] [2024-10-13 12:18:42,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:18:42,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:18:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:18:43,082 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-13 12:18:43,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:18:43,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164757638] [2024-10-13 12:18:43,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164757638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:18:43,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:18:43,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:18:43,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509723870] [2024-10-13 12:18:43,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:18:43,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:18:43,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:18:43,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:18:43,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:18:43,120 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-13 12:18:43,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-13 12:18:43,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:18:43,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-13 12:18:43,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:18:43,827 INFO L124 PetriNetUnfolderBase]: 3063/5210 cut-off events. [2024-10-13 12:18:43,828 INFO L125 PetriNetUnfolderBase]: For 2672/2858 co-relation queries the response was YES. [2024-10-13 12:18:43,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12155 conditions, 5210 events. 3063/5210 cut-off events. For 2672/2858 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 34939 event pairs, 782 based on Foata normal form. 16/4991 useless extension candidates. Maximal degree in co-relation 12142. Up to 2079 conditions per place. [2024-10-13 12:18:43,862 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 44 selfloop transitions, 7 changer transitions 14/95 dead transitions. [2024-10-13 12:18:43,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 95 transitions, 479 flow [2024-10-13 12:18:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:18:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:18:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2024-10-13 12:18:43,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-10-13 12:18:43,864 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 251 flow. Second operand 6 states and 204 transitions. [2024-10-13 12:18:43,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 95 transitions, 479 flow [2024-10-13 12:18:43,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 373 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-10-13 12:18:43,907 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 199 flow [2024-10-13 12:18:43,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2024-10-13 12:18:43,908 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2024-10-13 12:18:43,909 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 199 flow [2024-10-13 12:18:43,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-13 12:18:43,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:18:43,909 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:18:43,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:18:43,909 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:18:43,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:18:43,911 INFO L85 PathProgramCache]: Analyzing trace with hash 439045266, now seen corresponding path program 2 times [2024-10-13 12:18:43,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:18:43,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776354114] [2024-10-13 12:18:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:18:43,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:18:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:18:44,528 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-13 12:18:44,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:18:44,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776354114] [2024-10-13 12:18:44,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776354114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:18:44,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:18:44,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:18:44,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574318481] [2024-10-13 12:18:44,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:18:44,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:18:44,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:18:44,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:18:44,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:18:44,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-10-13 12:18:44,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 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-13 12:18:44,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:18:44,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-10-13 12:18:44,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:18:46,198 INFO L124 PetriNetUnfolderBase]: 6882/11387 cut-off events. [2024-10-13 12:18:46,199 INFO L125 PetriNetUnfolderBase]: For 2015/2015 co-relation queries the response was YES. [2024-10-13 12:18:46,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24407 conditions, 11387 events. 6882/11387 cut-off events. For 2015/2015 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 83805 event pairs, 1202 based on Foata normal form. 16/10827 useless extension candidates. Maximal degree in co-relation 24395. Up to 4415 conditions per place. [2024-10-13 12:18:46,285 INFO L140 encePairwiseOnDemand]: 41/55 looper letters, 42 selfloop transitions, 14 changer transitions 53/138 dead transitions. [2024-10-13 12:18:46,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 138 transitions, 631 flow [2024-10-13 12:18:46,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:18:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:18:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 278 transitions. [2024-10-13 12:18:46,287 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2024-10-13 12:18:46,287 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 199 flow. Second operand 8 states and 278 transitions. [2024-10-13 12:18:46,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 138 transitions, 631 flow [2024-10-13 12:18:46,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 138 transitions, 625 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-13 12:18:46,292 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 301 flow [2024-10-13 12:18:46,292 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=301, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2024-10-13 12:18:46,293 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2024-10-13 12:18:46,293 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 301 flow [2024-10-13 12:18:46,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 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-13 12:18:46,294 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:18:46,294 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:18:46,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:18:46,294 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:18:46,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:18:46,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1356788926, now seen corresponding path program 3 times [2024-10-13 12:18:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:18:46,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507488482] [2024-10-13 12:18:46,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:18:46,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:18:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:18:48,812 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-13 12:18:48,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:18:48,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507488482] [2024-10-13 12:18:48,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507488482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:18:48,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:18:48,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 12:18:48,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279278422] [2024-10-13 12:18:48,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:18:48,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:18:48,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:18:48,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:18:48,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:18:48,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-10-13 12:18:48,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 301 flow. Second operand has 10 states, 10 states have (on average 24.3) internal successors, (243), 10 states have internal predecessors, (243), 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-13 12:18:48,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:18:48,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-10-13 12:18:48,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:18:50,368 INFO L124 PetriNetUnfolderBase]: 6351/10855 cut-off events. [2024-10-13 12:18:50,368 INFO L125 PetriNetUnfolderBase]: For 8173/8419 co-relation queries the response was YES. [2024-10-13 12:18:50,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27604 conditions, 10855 events. 6351/10855 cut-off events. For 8173/8419 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 84609 event pairs, 568 based on Foata normal form. 206/10602 useless extension candidates. Maximal degree in co-relation 27586. Up to 2327 conditions per place. [2024-10-13 12:18:50,450 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 64 selfloop transitions, 25 changer transitions 36/155 dead transitions. [2024-10-13 12:18:50,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 155 transitions, 929 flow [2024-10-13 12:18:50,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 12:18:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 12:18:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 368 transitions. [2024-10-13 12:18:50,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5575757575757576 [2024-10-13 12:18:50,454 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 301 flow. Second operand 12 states and 368 transitions. [2024-10-13 12:18:50,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 155 transitions, 929 flow [2024-10-13 12:18:50,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 155 transitions, 919 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-10-13 12:18:50,465 INFO L231 Difference]: Finished difference. Result has 86 places, 82 transitions, 471 flow [2024-10-13 12:18:50,466 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=471, PETRI_PLACES=86, PETRI_TRANSITIONS=82} [2024-10-13 12:18:50,468 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 24 predicate places. [2024-10-13 12:18:50,468 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 82 transitions, 471 flow [2024-10-13 12:18:50,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.3) internal successors, (243), 10 states have internal predecessors, (243), 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-13 12:18:50,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:18:50,469 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:18:50,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:18:50,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:18:50,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:18:50,474 INFO L85 PathProgramCache]: Analyzing trace with hash -63513746, now seen corresponding path program 4 times [2024-10-13 12:18:50,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:18:50,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109470919] [2024-10-13 12:18:50,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:18:50,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:18:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:18:50,971 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-13 12:18:50,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:18:50,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109470919] [2024-10-13 12:18:50,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109470919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:18:50,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:18:50,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:18:50,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829357405] [2024-10-13 12:18:50,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:18:50,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:18:50,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:18:50,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:18:50,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:18:51,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-10-13 12:18:51,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 471 flow. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 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-13 12:18:51,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:18:51,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-10-13 12:18:51,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:18:52,464 INFO L124 PetriNetUnfolderBase]: 6875/11999 cut-off events. [2024-10-13 12:18:52,464 INFO L125 PetriNetUnfolderBase]: For 12217/12479 co-relation queries the response was YES. [2024-10-13 12:18:52,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31132 conditions, 11999 events. 6875/11999 cut-off events. For 12217/12479 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 97415 event pairs, 1558 based on Foata normal form. 98/11230 useless extension candidates. Maximal degree in co-relation 31111. Up to 4177 conditions per place. [2024-10-13 12:18:52,553 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 30 selfloop transitions, 6 changer transitions 74/139 dead transitions. [2024-10-13 12:18:52,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 139 transitions, 951 flow [2024-10-13 12:18:52,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:18:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:18:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 261 transitions. [2024-10-13 12:18:52,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5931818181818181 [2024-10-13 12:18:52,557 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 471 flow. Second operand 8 states and 261 transitions. [2024-10-13 12:18:52,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 139 transitions, 951 flow [2024-10-13 12:18:52,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 139 transitions, 940 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-10-13 12:18:52,581 INFO L231 Difference]: Finished difference. Result has 92 places, 59 transitions, 283 flow [2024-10-13 12:18:52,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=92, PETRI_TRANSITIONS=59} [2024-10-13 12:18:52,584 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 30 predicate places. [2024-10-13 12:18:52,584 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 59 transitions, 283 flow [2024-10-13 12:18:52,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 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-13 12:18:52,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:18:52,585 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:18:52,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:18:52,586 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:18:52,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:18:52,587 INFO L85 PathProgramCache]: Analyzing trace with hash -521391730, now seen corresponding path program 5 times [2024-10-13 12:18:52,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:18:52,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874184963] [2024-10-13 12:18:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:18:52,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:18:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:18:52,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:18:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:18:52,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:18:52,814 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:18:52,815 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-13 12:18:52,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-13 12:18:52,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-10-13 12:18:52,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-13 12:18:52,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-13 12:18:52,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-13 12:18:52,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-13 12:18:52,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-13 12:18:52,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 12:18:52,820 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-10-13 12:18:52,963 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:18:52,963 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:18:52,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:18:52 BasicIcfg [2024-10-13 12:18:52,969 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:18:52,970 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:18:52,970 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:18:52,970 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:18:52,970 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:18:35" (3/4) ... [2024-10-13 12:18:52,972 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:18:52,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:18:52,974 INFO L158 Benchmark]: Toolchain (without parser) took 18852.32ms. Allocated memory was 176.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 117.4MB in the beginning and 715.6MB in the end (delta: -598.2MB). Peak memory consumption was 548.9MB. Max. memory is 16.1GB. [2024-10-13 12:18:52,975 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:18:52,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.93ms. Allocated memory is still 176.2MB. Free memory was 117.4MB in the beginning and 90.7MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 12:18:52,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.33ms. Allocated memory is still 176.2MB. Free memory was 90.7MB in the beginning and 88.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:18:52,976 INFO L158 Benchmark]: Boogie Preprocessor took 87.53ms. Allocated memory is still 176.2MB. Free memory was 88.1MB in the beginning and 84.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:18:52,978 INFO L158 Benchmark]: RCFGBuilder took 912.31ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 84.4MB in the beginning and 173.8MB in the end (delta: -89.4MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2024-10-13 12:18:52,978 INFO L158 Benchmark]: TraceAbstraction took 17075.21ms. Allocated memory was 243.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 172.7MB in the beginning and 715.6MB in the end (delta: -542.9MB). Peak memory consumption was 535.0MB. Max. memory is 16.1GB. [2024-10-13 12:18:52,979 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 1.3GB. Free memory is still 715.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:18:52,981 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.93ms. Allocated memory is still 176.2MB. Free memory was 117.4MB in the beginning and 90.7MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.33ms. Allocated memory is still 176.2MB. Free memory was 90.7MB in the beginning and 88.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.53ms. Allocated memory is still 176.2MB. Free memory was 88.1MB in the beginning and 84.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 912.31ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 84.4MB in the beginning and 173.8MB in the end (delta: -89.4MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17075.21ms. Allocated memory was 243.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 172.7MB in the beginning and 715.6MB in the end (delta: -542.9MB). Peak memory consumption was 535.0MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 1.3GB. Free memory is still 715.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=-1, t1222=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=-1, t1222=0, t1223=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=-1, t1222=0, t1223=1, t1224=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221=-1, t1222=0, t1223=1, t1224=2, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221=-1, t1222=0, t1223=1, t1224=2, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221=-1, t1222=0, t1223=1, t1224=2, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "mix046.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 853]: 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: 851]: 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: 849]: 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 9 procedures, 89 locations, 8 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: 16.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 720 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 675 mSDsluCounter, 424 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 347 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1390 IncrementalHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 77 mSDtfsCounter, 1390 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=9, InterpolantAutomatonStates: 62, 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.8s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 1717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 12:18:53,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:18:55,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:18:55,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:18:55,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:18:55,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:18:55,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:18:55,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:18:55,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:18:55,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:18:55,766 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:18:55,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:18:55,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:18:55,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:18:55,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:18:55,772 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:18:55,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:18:55,773 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:18:55,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:18:55,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:18:55,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:18:55,774 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:18:55,775 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:18:55,775 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:18:55,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:18:55,776 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:18:55,776 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:18:55,777 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:18:55,777 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:18:55,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:18:55,777 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:18:55,778 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:18:55,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:18:55,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:18:55,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:18:55,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:18:55,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:18:55,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:18:55,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:18:55,780 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:18:55,780 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:18:55,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:18:55,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:18:55,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:18:55,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:18:55,782 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:18:55,782 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 [2024-10-13 12:18:56,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:18:56,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:18:56,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:18:56,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:18:56,151 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:18:56,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046.opt.i [2024-10-13 12:18:57,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:18:58,196 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:18:58,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046.opt.i [2024-10-13 12:18:58,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a5272f6/f22d45b4bd6d433d9da90104c0e582f8/FLAG31bfcd181 [2024-10-13 12:18:58,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a5272f6/f22d45b4bd6d433d9da90104c0e582f8 [2024-10-13 12:18:58,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:18:58,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:18:58,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:18:58,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:18:58,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:18:58,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:18:58" (1/1) ... [2024-10-13 12:18:58,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c3a9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:58, skipping insertion in model container [2024-10-13 12:18:58,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:18:58" (1/1) ... [2024-10-13 12:18:58,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:18:59,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:18:59,051 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:18:59,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:18:59,184 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:18:59,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59 WrapperNode [2024-10-13 12:18:59,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:18:59,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:18:59,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:18:59,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:18:59,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59" (1/1) ... [2024-10-13 12:18:59,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59" (1/1) ... [2024-10-13 12:18:59,266 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158 [2024-10-13 12:18:59,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:18:59,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:18:59,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:18:59,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:18:59,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59" (1/1) ... [2024-10-13 12:18:59,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59" (1/1) ... [2024-10-13 12:18:59,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59" (1/1) ... [2024-10-13 12:18:59,317 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-13 12:18:59,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59" (1/1) ... [2024-10-13 12:18:59,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59" (1/1) ... [2024-10-13 12:18:59,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59" (1/1) ... [2024-10-13 12:18:59,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59" (1/1) ... [2024-10-13 12:18:59,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59" (1/1) ... [2024-10-13 12:18:59,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59" (1/1) ... [2024-10-13 12:18:59,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:18:59,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:18:59,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:18:59,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:18:59,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59" (1/1) ... [2024-10-13 12:18:59,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:18:59,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:18:59,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:18:59,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:18:59,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:18:59,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:18:59,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:18:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 12:18:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 12:18:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 12:18:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 12:18:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 12:18:59,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 12:18:59,456 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-13 12:18:59,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-13 12:18:59,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:18:59,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:18:59,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:18:59,458 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:18:59,660 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:18:59,662 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:19:00,080 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:19:00,081 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:19:00,370 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:19:00,370 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:19:00,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:19:00 BoogieIcfgContainer [2024-10-13 12:19:00,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:19:00,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:19:00,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:19:00,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:19:00,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:18:58" (1/3) ... [2024-10-13 12:19:00,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fcca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:19:00, skipping insertion in model container [2024-10-13 12:19:00,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:18:59" (2/3) ... [2024-10-13 12:19:00,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fcca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:19:00, skipping insertion in model container [2024-10-13 12:19:00,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:19:00" (3/3) ... [2024-10-13 12:19:00,382 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2024-10-13 12:19:00,400 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:19:00,401 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-13 12:19:00,401 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:19:00,498 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:19:00,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-10-13 12:19:00,590 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-10-13 12:19:00,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:19:00,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-10-13 12:19:00,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-10-13 12:19:00,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-10-13 12:19:00,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:19:00,623 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;@2bdcbcdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:19:00,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 12:19:00,639 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:19:00,640 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-10-13 12:19:00,640 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:19:00,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:19:00,642 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:19:00,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:19:00,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:19:00,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1909233903, now seen corresponding path program 1 times [2024-10-13 12:19:00,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:19:00,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803573159] [2024-10-13 12:19:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:19:00,666 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-13 12:19:00,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:19:00,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:19:00,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 12:19:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:19:00,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:19:00,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:19:00,880 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-13 12:19:00,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:19:00,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:19:00,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803573159] [2024-10-13 12:19:00,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803573159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:19:00,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:19:00,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:19:00,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946930218] [2024-10-13 12:19:00,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:19:00,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:19:00,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:19:00,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:19:00,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:19:00,934 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-10-13 12:19:00,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-13 12:19:00,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:19:00,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-10-13 12:19:00,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:19:01,536 INFO L124 PetriNetUnfolderBase]: 1047/2051 cut-off events. [2024-10-13 12:19:01,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:19:01,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 2051 events. 1047/2051 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 15580 event pairs, 219 based on Foata normal form. 96/2121 useless extension candidates. Maximal degree in co-relation 3599. Up to 1153 conditions per place. [2024-10-13 12:19:01,565 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 31 selfloop transitions, 2 changer transitions 2/59 dead transitions. [2024-10-13 12:19:01,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 200 flow [2024-10-13 12:19:01,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:19:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:19:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-10-13 12:19:01,581 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7515151515151515 [2024-10-13 12:19:01,582 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 124 transitions. [2024-10-13 12:19:01,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 200 flow [2024-10-13 12:19:01,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:19:01,594 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-10-13 12:19:01,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-10-13 12:19:01,605 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-10-13 12:19:01,605 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-10-13 12:19:01,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-13 12:19:01,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:19:01,606 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:19:01,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 12:19:01,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:19:01,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:19:01,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:19:01,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1917808627, now seen corresponding path program 1 times [2024-10-13 12:19:01,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:19:01,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085186840] [2024-10-13 12:19:01,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:19:01,810 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-13 12:19:01,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:19:01,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:19:01,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 12:19:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:19:01,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:19:01,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:19:02,058 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-13 12:19:02,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:19:02,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:19:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085186840] [2024-10-13 12:19:02,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085186840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:19:02,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:19:02,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:19:02,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114719333] [2024-10-13 12:19:02,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:19:02,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:19:02,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:19:02,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:19:02,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:19:02,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-13 12:19:02,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-13 12:19:02,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:19:02,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-13 12:19:02,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:19:03,376 INFO L124 PetriNetUnfolderBase]: 4847/7417 cut-off events. [2024-10-13 12:19:03,376 INFO L125 PetriNetUnfolderBase]: For 346/346 co-relation queries the response was YES. [2024-10-13 12:19:03,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14567 conditions, 7417 events. 4847/7417 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 50745 event pairs, 536 based on Foata normal form. 180/7580 useless extension candidates. Maximal degree in co-relation 14557. Up to 4684 conditions per place. [2024-10-13 12:19:03,443 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 46 selfloop transitions, 6 changer transitions 1/72 dead transitions. [2024-10-13 12:19:03,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 272 flow [2024-10-13 12:19:03,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:19:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:19:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2024-10-13 12:19:03,448 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6681818181818182 [2024-10-13 12:19:03,449 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 4 states and 147 transitions. [2024-10-13 12:19:03,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 272 flow [2024-10-13 12:19:03,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:19:03,455 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 142 flow [2024-10-13 12:19:03,456 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-10-13 12:19:03,457 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2024-10-13 12:19:03,459 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 142 flow [2024-10-13 12:19:03,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-13 12:19:03,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:19:03,459 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:19:03,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 12:19:03,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:19:03,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:19:03,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:19:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1500775104, now seen corresponding path program 1 times [2024-10-13 12:19:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:19:03,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522809684] [2024-10-13 12:19:03,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:19:03,663 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-13 12:19:03,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:19:03,666 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:19:03,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 12:19:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:19:03,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:19:03,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:19:03,836 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-13 12:19:03,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:19:03,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:19:03,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522809684] [2024-10-13 12:19:03,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522809684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:19:03,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:19:03,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:19:03,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511113715] [2024-10-13 12:19:03,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:19:03,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:19:03,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:19:03,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:19:03,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:19:03,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-13 12:19:03,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:19:03,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:19:03,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-13 12:19:03,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:19:04,766 INFO L124 PetriNetUnfolderBase]: 4024/6214 cut-off events. [2024-10-13 12:19:04,766 INFO L125 PetriNetUnfolderBase]: For 1625/1625 co-relation queries the response was YES. [2024-10-13 12:19:04,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14109 conditions, 6214 events. 4024/6214 cut-off events. For 1625/1625 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 41265 event pairs, 192 based on Foata normal form. 174/6373 useless extension candidates. Maximal degree in co-relation 14097. Up to 3613 conditions per place. [2024-10-13 12:19:04,830 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 58 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2024-10-13 12:19:04,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 385 flow [2024-10-13 12:19:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:19:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:19:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2024-10-13 12:19:04,836 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6763636363636364 [2024-10-13 12:19:04,837 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 142 flow. Second operand 5 states and 186 transitions. [2024-10-13 12:19:04,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 385 flow [2024-10-13 12:19:04,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 374 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 12:19:04,844 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 194 flow [2024-10-13 12:19:04,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-10-13 12:19:04,847 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2024-10-13 12:19:04,848 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 194 flow [2024-10-13 12:19:04,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:19:04,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:19:04,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:19:04,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 12:19:05,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:19:05,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:19:05,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:19:05,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1803492071, now seen corresponding path program 1 times [2024-10-13 12:19:05,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:19:05,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957927180] [2024-10-13 12:19:05,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:19:05,051 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-13 12:19:05,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:19:05,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:19:05,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 12:19:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:19:05,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:19:05,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:19:05,263 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-13 12:19:05,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:19:05,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:19:05,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957927180] [2024-10-13 12:19:05,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957927180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:19:05,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:19:05,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:19:05,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990443974] [2024-10-13 12:19:05,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:19:05,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:19:05,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:19:05,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:19:05,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:19:05,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-13 12:19:05,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:19:05,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:19:05,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-13 12:19:05,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:19:05,928 INFO L124 PetriNetUnfolderBase]: 2545/3953 cut-off events. [2024-10-13 12:19:05,929 INFO L125 PetriNetUnfolderBase]: For 2961/2961 co-relation queries the response was YES. [2024-10-13 12:19:05,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10071 conditions, 3953 events. 2545/3953 cut-off events. For 2961/2961 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 23327 event pairs, 69 based on Foata normal form. 140/4079 useless extension candidates. Maximal degree in co-relation 10057. Up to 1709 conditions per place. [2024-10-13 12:19:05,960 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 68 selfloop transitions, 14 changer transitions 1/102 dead transitions. [2024-10-13 12:19:05,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 102 transitions, 504 flow [2024-10-13 12:19:05,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:19:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:19:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2024-10-13 12:19:05,963 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6757575757575758 [2024-10-13 12:19:05,963 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 194 flow. Second operand 6 states and 223 transitions. [2024-10-13 12:19:05,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 102 transitions, 504 flow [2024-10-13 12:19:05,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 102 transitions, 474 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-13 12:19:05,976 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 244 flow [2024-10-13 12:19:05,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2024-10-13 12:19:05,978 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-10-13 12:19:05,978 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 244 flow [2024-10-13 12:19:05,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:19:05,979 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:19:05,979 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:19:05,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 12:19:06,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:19:06,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:19:06,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:19:06,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1493645098, now seen corresponding path program 1 times [2024-10-13 12:19:06,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:19:06,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181254725] [2024-10-13 12:19:06,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:19:06,182 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-13 12:19:06,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:19:06,186 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:19:06,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 12:19:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:19:06,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:19:06,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:19:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:19:06,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:19:06,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:19:06,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181254725] [2024-10-13 12:19:06,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181254725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:19:06,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:19:06,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:19:06,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214338670] [2024-10-13 12:19:06,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:19:06,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:19:06,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:19:06,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:19:06,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:19:06,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-13 12:19:06,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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-13 12:19:06,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:19:06,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-13 12:19:06,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:19:06,934 INFO L124 PetriNetUnfolderBase]: 1417/2141 cut-off events. [2024-10-13 12:19:06,935 INFO L125 PetriNetUnfolderBase]: For 3115/3115 co-relation queries the response was YES. [2024-10-13 12:19:06,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6248 conditions, 2141 events. 1417/2141 cut-off events. For 3115/3115 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10294 event pairs, 39 based on Foata normal form. 72/2199 useless extension candidates. Maximal degree in co-relation 6233. Up to 668 conditions per place. [2024-10-13 12:19:06,951 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 62 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2024-10-13 12:19:06,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 506 flow [2024-10-13 12:19:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:19:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:19:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 244 transitions. [2024-10-13 12:19:06,954 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6337662337662338 [2024-10-13 12:19:06,954 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 244 flow. Second operand 7 states and 244 transitions. [2024-10-13 12:19:06,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 506 flow [2024-10-13 12:19:06,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 100 transitions, 460 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-13 12:19:06,968 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 254 flow [2024-10-13 12:19:06,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2024-10-13 12:19:06,969 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-10-13 12:19:06,970 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 254 flow [2024-10-13 12:19:06,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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-13 12:19:06,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:19:06,971 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:19:06,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 12:19:07,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:19:07,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:19:07,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:19:07,176 INFO L85 PathProgramCache]: Analyzing trace with hash -471412840, now seen corresponding path program 1 times [2024-10-13 12:19:07,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:19:07,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371911872] [2024-10-13 12:19:07,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:19:07,177 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-13 12:19:07,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:19:07,182 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:19:07,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 12:19:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:19:07,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:19:07,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:19:07,361 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-13 12:19:07,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:19:07,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:19:07,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371911872] [2024-10-13 12:19:07,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371911872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:19:07,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:19:07,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:19:07,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369374825] [2024-10-13 12:19:07,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:19:07,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:19:07,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:19:07,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:19:07,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:19:07,365 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-10-13 12:19:07,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-13 12:19:07,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:19:07,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-10-13 12:19:07,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:19:07,566 INFO L124 PetriNetUnfolderBase]: 621/1163 cut-off events. [2024-10-13 12:19:07,566 INFO L125 PetriNetUnfolderBase]: For 470/495 co-relation queries the response was YES. [2024-10-13 12:19:07,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 1163 events. 621/1163 cut-off events. For 470/495 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6474 event pairs, 584 based on Foata normal form. 16/1038 useless extension candidates. Maximal degree in co-relation 2523. Up to 919 conditions per place. [2024-10-13 12:19:07,582 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 20 selfloop transitions, 1 changer transitions 1/57 dead transitions. [2024-10-13 12:19:07,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 296 flow [2024-10-13 12:19:07,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:19:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:19:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-10-13 12:19:07,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-10-13 12:19:07,586 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 254 flow. Second operand 3 states and 104 transitions. [2024-10-13 12:19:07,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 296 flow [2024-10-13 12:19:07,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 200 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-10-13 12:19:07,591 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 156 flow [2024-10-13 12:19:07,592 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2024-10-13 12:19:07,592 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2024-10-13 12:19:07,593 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 156 flow [2024-10-13 12:19:07,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-13 12:19:07,594 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:19:07,594 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:19:07,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 12:19:07,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:19:07,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:19:07,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:19:07,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1323261660, now seen corresponding path program 1 times [2024-10-13 12:19:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:19:07,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889664851] [2024-10-13 12:19:07,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:19:07,798 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-13 12:19:07,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:19:07,802 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:19:07,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 12:19:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:19:07,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:19:07,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:19:08,038 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-13 12:19:08,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:19:08,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:19:08,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889664851] [2024-10-13 12:19:08,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889664851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:19:08,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:19:08,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:19:08,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616195794] [2024-10-13 12:19:08,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:19:08,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:19:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:19:08,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:19:08,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:19:08,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-10-13 12:19:08,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-13 12:19:08,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:19:08,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-10-13 12:19:08,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:19:08,514 INFO L124 PetriNetUnfolderBase]: 1615/2886 cut-off events. [2024-10-13 12:19:08,515 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:19:08,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5623 conditions, 2886 events. 1615/2886 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 18318 event pairs, 691 based on Foata normal form. 16/2682 useless extension candidates. Maximal degree in co-relation 5616. Up to 1165 conditions per place. [2024-10-13 12:19:08,540 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 32 selfloop transitions, 2 changer transitions 14/81 dead transitions. [2024-10-13 12:19:08,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 306 flow [2024-10-13 12:19:08,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:19:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:19:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-10-13 12:19:08,543 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6509090909090909 [2024-10-13 12:19:08,543 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 156 flow. Second operand 5 states and 179 transitions. [2024-10-13 12:19:08,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 306 flow [2024-10-13 12:19:08,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:19:08,546 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 171 flow [2024-10-13 12:19:08,549 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-10-13 12:19:08,550 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-10-13 12:19:08,550 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 171 flow [2024-10-13 12:19:08,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-13 12:19:08,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:19:08,551 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:19:08,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-13 12:19:08,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:19:08,752 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:19:08,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:19:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash -132428042, now seen corresponding path program 2 times [2024-10-13 12:19:08,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:19:08,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981422377] [2024-10-13 12:19:08,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:19:08,754 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-13 12:19:08,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:19:08,756 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:19:08,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 12:19:08,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:19:08,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:19:08,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:19:08,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:19:08,972 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-13 12:19:08,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:19:08,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:19:08,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981422377] [2024-10-13 12:19:08,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981422377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:19:08,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:19:08,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:19:08,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824257883] [2024-10-13 12:19:08,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:19:08,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:19:08,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:19:08,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:19:08,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:19:08,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-10-13 12:19:08,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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-13 12:19:08,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:19:08,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-10-13 12:19:08,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:19:09,695 INFO L124 PetriNetUnfolderBase]: 3243/5732 cut-off events. [2024-10-13 12:19:09,695 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2024-10-13 12:19:09,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11348 conditions, 5732 events. 3243/5732 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 41610 event pairs, 899 based on Foata normal form. 16/5226 useless extension candidates. Maximal degree in co-relation 11338. Up to 2029 conditions per place. [2024-10-13 12:19:09,743 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 45 selfloop transitions, 2 changer transitions 12/93 dead transitions. [2024-10-13 12:19:09,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 93 transitions, 373 flow [2024-10-13 12:19:09,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:19:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:19:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2024-10-13 12:19:09,744 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2024-10-13 12:19:09,745 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 171 flow. Second operand 6 states and 216 transitions. [2024-10-13 12:19:09,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 93 transitions, 373 flow [2024-10-13 12:19:09,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 93 transitions, 365 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-13 12:19:09,751 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 182 flow [2024-10-13 12:19:09,751 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2024-10-13 12:19:09,752 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-10-13 12:19:09,753 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 182 flow [2024-10-13 12:19:09,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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-13 12:19:09,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:19:09,754 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:19:09,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 12:19:09,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:19:09,955 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:19:09,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:19:09,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1505244724, now seen corresponding path program 3 times [2024-10-13 12:19:09,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:19:09,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093515039] [2024-10-13 12:19:09,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:19:09,958 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-13 12:19:09,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:19:09,961 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:19:09,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 12:19:10,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-13 12:19:10,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:19:10,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:19:10,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:19:10,209 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-13 12:19:10,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:19:10,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:19:10,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093515039] [2024-10-13 12:19:10,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093515039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:19:10,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:19:10,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:19:10,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956149242] [2024-10-13 12:19:10,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:19:10,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:19:10,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:19:10,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:19:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:19:10,220 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-10-13 12:19:10,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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-13 12:19:10,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:19:10,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-10-13 12:19:10,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:19:11,010 INFO L124 PetriNetUnfolderBase]: 4762/8331 cut-off events. [2024-10-13 12:19:11,010 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2024-10-13 12:19:11,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16727 conditions, 8331 events. 4762/8331 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 64880 event pairs, 1260 based on Foata normal form. 16/7502 useless extension candidates. Maximal degree in co-relation 16715. Up to 3498 conditions per place. [2024-10-13 12:19:11,074 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 26 selfloop transitions, 1 changer transitions 29/91 dead transitions. [2024-10-13 12:19:11,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 91 transitions, 372 flow [2024-10-13 12:19:11,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:19:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:19:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-10-13 12:19:11,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2024-10-13 12:19:11,077 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 182 flow. Second operand 6 states and 213 transitions. [2024-10-13 12:19:11,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 91 transitions, 372 flow [2024-10-13 12:19:11,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 365 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-13 12:19:11,093 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 188 flow [2024-10-13 12:19:11,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2024-10-13 12:19:11,094 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2024-10-13 12:19:11,094 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 188 flow [2024-10-13 12:19:11,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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-13 12:19:11,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:19:11,094 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:19:11,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 12:19:11,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:19:11,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:19:11,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:19:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1222817804, now seen corresponding path program 4 times [2024-10-13 12:19:11,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:19:11,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610769565] [2024-10-13 12:19:11,301 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:19:11,301 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-13 12:19:11,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:19:11,302 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:19:11,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 12:19:11,397 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:19:11,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:19:11,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 12:19:11,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:19:11,595 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-13 12:19:11,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:19:11,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:19:11,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610769565] [2024-10-13 12:19:11,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610769565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:19:11,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:19:11,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:19:11,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021305562] [2024-10-13 12:19:11,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:19:11,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:19:11,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:19:11,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:19:11,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:19:11,607 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-10-13 12:19:11,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 188 flow. Second operand has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 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-13 12:19:11,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:19:11,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-10-13 12:19:11,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:19:12,578 INFO L124 PetriNetUnfolderBase]: 5474/9621 cut-off events. [2024-10-13 12:19:12,579 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2024-10-13 12:19:12,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19084 conditions, 9621 events. 5474/9621 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 76427 event pairs, 1729 based on Foata normal form. 16/8493 useless extension candidates. Maximal degree in co-relation 19070. Up to 2300 conditions per place. [2024-10-13 12:19:12,700 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 42 selfloop transitions, 6 changer transitions 12/96 dead transitions. [2024-10-13 12:19:12,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 96 transitions, 404 flow [2024-10-13 12:19:12,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:19:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:19:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2024-10-13 12:19:12,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6493506493506493 [2024-10-13 12:19:12,702 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 188 flow. Second operand 7 states and 250 transitions. [2024-10-13 12:19:12,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 96 transitions, 404 flow [2024-10-13 12:19:12,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 96 transitions, 387 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-10-13 12:19:12,709 INFO L231 Difference]: Finished difference. Result has 78 places, 62 transitions, 223 flow [2024-10-13 12:19:12,709 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=78, PETRI_TRANSITIONS=62} [2024-10-13 12:19:12,711 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 16 predicate places. [2024-10-13 12:19:12,711 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 62 transitions, 223 flow [2024-10-13 12:19:12,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 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-13 12:19:12,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:19:12,712 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:19:12,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-13 12:19:12,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:19:12,916 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:19:12,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:19:12,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1456274960, now seen corresponding path program 5 times [2024-10-13 12:19:12,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:19:12,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778086458] [2024-10-13 12:19:12,918 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 12:19:12,918 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-13 12:19:12,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:19:12,921 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:19:12,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 12:19:13,017 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:19:13,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 12:19:13,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:19:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:19:13,186 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 12:19:13,186 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:19:13,188 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-13 12:19:13,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-13 12:19:13,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-10-13 12:19:13,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-13 12:19:13,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-13 12:19:13,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-13 12:19:13,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-13 12:19:13,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-13 12:19:13,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 12:19:13,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:19:13,392 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-10-13 12:19:13,502 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:19:13,502 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:19:13,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:19:13 BasicIcfg [2024-10-13 12:19:13,507 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:19:13,508 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:19:13,508 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:19:13,508 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:19:13,509 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:19:00" (3/4) ... [2024-10-13 12:19:13,513 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:19:13,518 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:19:13,519 INFO L158 Benchmark]: Toolchain (without parser) took 15037.98ms. Allocated memory was 83.9MB in the beginning and 721.4MB in the end (delta: 637.5MB). Free memory was 50.9MB in the beginning and 301.1MB in the end (delta: -250.1MB). Peak memory consumption was 389.2MB. Max. memory is 16.1GB. [2024-10-13 12:19:13,519 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:19:13,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 703.79ms. Allocated memory is still 83.9MB. Free memory was 50.7MB in the beginning and 46.4MB in the end (delta: 4.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 12:19:13,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.35ms. Allocated memory is still 83.9MB. Free memory was 46.4MB in the beginning and 43.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:19:13,519 INFO L158 Benchmark]: Boogie Preprocessor took 83.72ms. Allocated memory is still 83.9MB. Free memory was 43.2MB in the beginning and 39.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:19:13,520 INFO L158 Benchmark]: RCFGBuilder took 1016.40ms. Allocated memory is still 83.9MB. Free memory was 39.8MB in the beginning and 31.1MB in the end (delta: 8.8MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-10-13 12:19:13,520 INFO L158 Benchmark]: TraceAbstraction took 13133.95ms. Allocated memory was 83.9MB in the beginning and 721.4MB in the end (delta: 637.5MB). Free memory was 30.5MB in the beginning and 301.1MB in the end (delta: -270.6MB). Peak memory consumption was 366.6MB. Max. memory is 16.1GB. [2024-10-13 12:19:13,520 INFO L158 Benchmark]: Witness Printer took 9.83ms. Allocated memory is still 721.4MB. Free memory is still 301.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:19:13,521 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.20ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 703.79ms. Allocated memory is still 83.9MB. Free memory was 50.7MB in the beginning and 46.4MB in the end (delta: 4.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.35ms. Allocated memory is still 83.9MB. Free memory was 46.4MB in the beginning and 43.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.72ms. Allocated memory is still 83.9MB. Free memory was 43.2MB in the beginning and 39.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1016.40ms. Allocated memory is still 83.9MB. Free memory was 39.8MB in the beginning and 31.1MB in the end (delta: 8.8MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13133.95ms. Allocated memory was 83.9MB in the beginning and 721.4MB in the end (delta: 637.5MB). Free memory was 30.5MB in the beginning and 301.1MB in the end (delta: -270.6MB). Peak memory consumption was 366.6MB. Max. memory is 16.1GB. * Witness Printer took 9.83ms. Allocated memory is still 721.4MB. Free memory is still 301.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=0, t1222=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=0, t1222=1, t1223=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=0, t1222=1, t1223=2, t1224=3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221=0, t1222=1, t1223=2, t1224=3, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221=0, t1222=1, t1223=2, t1224=3, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221=0, t1222=1, t1223=2, t1224=3, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "mix046.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 853]: 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: 851]: 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 9 procedures, 89 locations, 8 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: 12.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1571 IncrementalHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 12 mSDtfsCounter, 1571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=5, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 342 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 846 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1257 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 12:19:13,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample