./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/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 ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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.graphml --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 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:56:36,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:56:36,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:56:36,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:56:36,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:56:36,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:56:36,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:56:36,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:56:36,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:56:36,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:56:36,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:56:36,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:56:36,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:56:36,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:56:36,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:56:36,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:56:36,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:56:36,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:56:36,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:56:36,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:56:36,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:56:36,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:56:36,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:56:36,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:56:36,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:56:36,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:56:36,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:56:36,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:56:36,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:56:36,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:56:36,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:56:36,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:56:36,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:56:36,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:56:36,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:56:36,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:56:36,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:56:36,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:56:36,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:56:36,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:56:36,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:56:36,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:56:36,894 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:56:36,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:56:36,896 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:56:36,896 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:56:36,897 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:56:36,897 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:56:36,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:56:36,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:56:36,898 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:56:36,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:56:36,899 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:56:36,899 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:56:36,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:56:36,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:56:36,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:56:36,900 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:56:36,900 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:56:36,900 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:56:36,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:56:36,901 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:56:36,901 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:56:36,901 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:56:36,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:56:36,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:56:36,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:56:36,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:56:36,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:56:36,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:56:36,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:56:36,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:56:36,903 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:56:36,903 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:56:36,903 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:56:36,904 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:56:36,904 INFO L138 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.graphml 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 -> 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:56:37,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:56:37,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:56:37,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:56:37,256 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:56:37,256 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:56:37,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-30 02:56:38,411 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:56:38,659 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:56:38,660 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-30 02:56:38,678 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86453847d/794d35728b8c4282b6203b7a29e35f95/FLAG5b53201bc [2023-08-30 02:56:38,690 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86453847d/794d35728b8c4282b6203b7a29e35f95 [2023-08-30 02:56:38,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:56:38,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:56:38,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:56:38,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:56:38,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:56:38,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:56:38" (1/1) ... [2023-08-30 02:56:38,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91a0cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:38, skipping insertion in model container [2023-08-30 02:56:38,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:56:38" (1/1) ... [2023-08-30 02:56:38,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:56:38,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:56:38,884 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-08-30 02:56:39,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:56:39,073 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:56:39,088 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-08-30 02:56:39,164 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:56:39,200 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:56:39,200 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:56:39,206 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:56:39,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39 WrapperNode [2023-08-30 02:56:39,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:56:39,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:56:39,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:56:39,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:56:39,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,287 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2023-08-30 02:56:39,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:56:39,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:56:39,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:56:39,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:56:39,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,337 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:56:39,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:56:39,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:56:39,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:56:39,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:56:39,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:56:39,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:56:39,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:56:39,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:56:39,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:56:39,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:56:39,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:56:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:56:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:56:39,428 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:56:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:56:39,428 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:56:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:56:39,429 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:56:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:56:39,429 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:56:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:56:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:56:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:56:39,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:56:39,431 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:56:39,630 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:56:39,632 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:56:39,935 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:56:40,050 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:56:40,050 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:56:40,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:56:40 BoogieIcfgContainer [2023-08-30 02:56:40,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:56:40,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:56:40,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:56:40,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:56:40,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:56:38" (1/3) ... [2023-08-30 02:56:40,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd836f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:56:40, skipping insertion in model container [2023-08-30 02:56:40,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (2/3) ... [2023-08-30 02:56:40,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd836f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:56:40, skipping insertion in model container [2023-08-30 02:56:40,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:56:40" (3/3) ... [2023-08-30 02:56:40,060 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-30 02:56:40,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:56:40,075 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:56:40,076 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:56:40,158 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:56:40,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2023-08-30 02:56:40,261 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-30 02:56:40,261 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:56:40,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-30 02:56:40,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2023-08-30 02:56:40,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2023-08-30 02:56:40,280 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:56:40,298 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-30 02:56:40,302 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-30 02:56:40,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 286 flow [2023-08-30 02:56:40,348 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-30 02:56:40,348 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:56:40,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-30 02:56:40,353 INFO L119 LiptonReduction]: Number of co-enabled transitions 3258 [2023-08-30 02:56:44,941 INFO L134 LiptonReduction]: Checked pairs total: 8450 [2023-08-30 02:56:44,942 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-30 02:56:44,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:56:44,968 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@64093825, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:56:44,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:56:44,971 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:56:44,972 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:56:44,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:44,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:56:44,973 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:44,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:44,979 INFO L85 PathProgramCache]: Analyzing trace with hash 586, now seen corresponding path program 1 times [2023-08-30 02:56:44,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:44,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700318484] [2023-08-30 02:56:44,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:44,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:45,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:45,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:45,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700318484] [2023-08-30 02:56:45,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700318484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:45,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:45,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:56:45,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801934222] [2023-08-30 02:56:45,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:45,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:56:45,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:45,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:56:45,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:56:45,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 277 [2023-08-30 02:56:45,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 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) [2023-08-30 02:56:45,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:45,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 277 [2023-08-30 02:56:45,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:45,909 INFO L130 PetriNetUnfolder]: 4373/6107 cut-off events. [2023-08-30 02:56:45,909 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-30 02:56:45,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12193 conditions, 6107 events. 4373/6107 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 31611 event pairs, 4373 based on Foata normal form. 0/5374 useless extension candidates. Maximal degree in co-relation 12181. Up to 5983 conditions per place. [2023-08-30 02:56:45,963 INFO L137 encePairwiseOnDemand]: 268/277 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-30 02:56:45,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-30 02:56:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:56:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:56:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2023-08-30 02:56:45,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252707581227437 [2023-08-30 02:56:45,981 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 291 transitions. [2023-08-30 02:56:45,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions. [2023-08-30 02:56:45,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:45,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions. [2023-08-30 02:56:45,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 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) [2023-08-30 02:56:45,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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) [2023-08-30 02:56:45,991 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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) [2023-08-30 02:56:45,993 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 291 transitions. [2023-08-30 02:56:45,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-30 02:56:45,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:56:45,999 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-30 02:56:46,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-30 02:56:46,004 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-30 02:56:46,004 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-30 02:56:46,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 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) [2023-08-30 02:56:46,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:46,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:46,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:56:46,005 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:46,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1707296597, now seen corresponding path program 1 times [2023-08-30 02:56:46,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:46,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540589324] [2023-08-30 02:56:46,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:46,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:46,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:46,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540589324] [2023-08-30 02:56:46,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540589324] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:46,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:46,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:56:46,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834659337] [2023-08-30 02:56:46,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:46,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:56:46,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:46,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:56:46,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:56:46,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 277 [2023-08-30 02:56:46,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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) [2023-08-30 02:56:46,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:46,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 277 [2023-08-30 02:56:46,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:46,988 INFO L130 PetriNetUnfolder]: 3632/5258 cut-off events. [2023-08-30 02:56:46,988 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:56:46,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10348 conditions, 5258 events. 3632/5258 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 28813 event pairs, 668 based on Foata normal form. 0/4885 useless extension candidates. Maximal degree in co-relation 10345. Up to 3973 conditions per place. [2023-08-30 02:56:47,016 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 34 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-08-30 02:56:47,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2023-08-30 02:56:47,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:56:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:56:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-30 02:56:47,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054151624548736 [2023-08-30 02:56:47,021 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-30 02:56:47,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-30 02:56:47,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:47,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-30 02:56:47,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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) [2023-08-30 02:56:47,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 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) [2023-08-30 02:56:47,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 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) [2023-08-30 02:56:47,030 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 420 transitions. [2023-08-30 02:56:47,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2023-08-30 02:56:47,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:56:47,031 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-30 02:56:47,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-30 02:56:47,032 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-30 02:56:47,032 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-30 02:56:47,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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) [2023-08-30 02:56:47,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:47,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:47,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:56:47,034 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:47,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:47,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1067965726, now seen corresponding path program 1 times [2023-08-30 02:56:47,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:47,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923788508] [2023-08-30 02:56:47,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:47,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:47,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:47,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923788508] [2023-08-30 02:56:47,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923788508] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:47,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:47,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:56:47,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752069972] [2023-08-30 02:56:47,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:47,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:56:47,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:47,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:56:47,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:56:48,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 277 [2023-08-30 02:56:48,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 111.71428571428571) internal successors, (782), 7 states have internal predecessors, (782), 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) [2023-08-30 02:56:48,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:48,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 277 [2023-08-30 02:56:48,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:48,683 INFO L130 PetriNetUnfolder]: 2594/3784 cut-off events. [2023-08-30 02:56:48,683 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-08-30 02:56:48,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7658 conditions, 3784 events. 2594/3784 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19668 event pairs, 144 based on Foata normal form. 0/3784 useless extension candidates. Maximal degree in co-relation 7654. Up to 2097 conditions per place. [2023-08-30 02:56:48,706 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 42 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-08-30 02:56:48,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 208 flow [2023-08-30 02:56:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:56:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:56:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 819 transitions. [2023-08-30 02:56:48,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4223826714801444 [2023-08-30 02:56:48,710 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 819 transitions. [2023-08-30 02:56:48,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 819 transitions. [2023-08-30 02:56:48,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:48,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 819 transitions. [2023-08-30 02:56:48,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 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) [2023-08-30 02:56:48,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:56:48,717 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:56:48,717 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 7 states and 819 transitions. [2023-08-30 02:56:48,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 208 flow [2023-08-30 02:56:48,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:56:48,721 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 72 flow [2023-08-30 02:56:48,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-08-30 02:56:48,722 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2023-08-30 02:56:48,722 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 72 flow [2023-08-30 02:56:48,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.71428571428571) internal successors, (782), 7 states have internal predecessors, (782), 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) [2023-08-30 02:56:48,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:48,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:48,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:56:48,724 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:48,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:48,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1067965793, now seen corresponding path program 1 times [2023-08-30 02:56:48,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:48,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946499981] [2023-08-30 02:56:48,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:48,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:48,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:48,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946499981] [2023-08-30 02:56:48,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946499981] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:48,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:48,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:56:48,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616522915] [2023-08-30 02:56:48,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:48,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:56:48,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:48,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:56:48,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:56:49,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-30 02:56:49,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 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) [2023-08-30 02:56:49,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:49,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-30 02:56:49,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:49,603 INFO L130 PetriNetUnfolder]: 3861/5549 cut-off events. [2023-08-30 02:56:49,603 INFO L131 PetriNetUnfolder]: For 317/317 co-relation queries the response was YES. [2023-08-30 02:56:49,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11389 conditions, 5549 events. 3861/5549 cut-off events. For 317/317 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 29082 event pairs, 1179 based on Foata normal form. 240/5779 useless extension candidates. Maximal degree in co-relation 11385. Up to 4326 conditions per place. [2023-08-30 02:56:49,631 INFO L137 encePairwiseOnDemand]: 272/277 looper letters, 36 selfloop transitions, 3 changer transitions 22/64 dead transitions. [2023-08-30 02:56:49,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 282 flow [2023-08-30 02:56:49,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:56:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:56:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2023-08-30 02:56:49,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49314079422382673 [2023-08-30 02:56:49,635 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 683 transitions. [2023-08-30 02:56:49,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 683 transitions. [2023-08-30 02:56:49,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:49,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 683 transitions. [2023-08-30 02:56:49,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 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) [2023-08-30 02:56:49,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 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) [2023-08-30 02:56:49,641 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 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) [2023-08-30 02:56:49,641 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 72 flow. Second operand 5 states and 683 transitions. [2023-08-30 02:56:49,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 282 flow [2023-08-30 02:56:49,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 64 transitions, 266 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-30 02:56:49,643 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 90 flow [2023-08-30 02:56:49,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-08-30 02:56:49,644 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-08-30 02:56:49,644 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 90 flow [2023-08-30 02:56:49,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 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) [2023-08-30 02:56:49,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:49,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:49,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:56:49,646 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:49,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:49,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1252777071, now seen corresponding path program 1 times [2023-08-30 02:56:49,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:49,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126981062] [2023-08-30 02:56:49,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:49,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:49,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:49,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126981062] [2023-08-30 02:56:49,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126981062] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:49,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:49,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:56:49,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516606544] [2023-08-30 02:56:49,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:49,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:56:49,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:49,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:56:49,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:56:49,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-08-30 02:56:49,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 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) [2023-08-30 02:56:49,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:49,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-08-30 02:56:49,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:50,407 INFO L130 PetriNetUnfolder]: 3028/4482 cut-off events. [2023-08-30 02:56:50,407 INFO L131 PetriNetUnfolder]: For 1290/1293 co-relation queries the response was YES. [2023-08-30 02:56:50,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10152 conditions, 4482 events. 3028/4482 cut-off events. For 1290/1293 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 24000 event pairs, 962 based on Foata normal form. 210/4682 useless extension candidates. Maximal degree in co-relation 10145. Up to 2380 conditions per place. [2023-08-30 02:56:50,434 INFO L137 encePairwiseOnDemand]: 273/277 looper letters, 32 selfloop transitions, 2 changer transitions 19/58 dead transitions. [2023-08-30 02:56:50,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 272 flow [2023-08-30 02:56:50,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:56:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:56:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-30 02:56:50,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48953068592057764 [2023-08-30 02:56:50,437 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-30 02:56:50,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-30 02:56:50,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:50,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-30 02:56:50,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 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) [2023-08-30 02:56:50,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 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) [2023-08-30 02:56:50,442 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 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) [2023-08-30 02:56:50,443 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 90 flow. Second operand 5 states and 678 transitions. [2023-08-30 02:56:50,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 272 flow [2023-08-30 02:56:50,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 266 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:56:50,449 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 97 flow [2023-08-30 02:56:50,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2023-08-30 02:56:50,451 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2023-08-30 02:56:50,451 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 97 flow [2023-08-30 02:56:50,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 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) [2023-08-30 02:56:50,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:50,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:50,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:56:50,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:50,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1622402819, now seen corresponding path program 1 times [2023-08-30 02:56:50,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:50,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184890180] [2023-08-30 02:56:50,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:50,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:51,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:51,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184890180] [2023-08-30 02:56:51,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184890180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:51,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:51,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:56:51,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308533293] [2023-08-30 02:56:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:51,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:56:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:51,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:56:51,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:56:51,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 277 [2023-08-30 02:56:51,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 97 flow. Second operand has 7 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 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) [2023-08-30 02:56:51,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:51,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 277 [2023-08-30 02:56:51,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:52,239 INFO L130 PetriNetUnfolder]: 4745/6667 cut-off events. [2023-08-30 02:56:52,240 INFO L131 PetriNetUnfolder]: For 3090/3093 co-relation queries the response was YES. [2023-08-30 02:56:52,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15710 conditions, 6667 events. 4745/6667 cut-off events. For 3090/3093 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 32963 event pairs, 750 based on Foata normal form. 237/6900 useless extension candidates. Maximal degree in co-relation 15701. Up to 4418 conditions per place. [2023-08-30 02:56:52,287 INFO L137 encePairwiseOnDemand]: 267/277 looper letters, 52 selfloop transitions, 11 changer transitions 28/94 dead transitions. [2023-08-30 02:56:52,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 94 transitions, 449 flow [2023-08-30 02:56:52,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:56:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:56:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1035 transitions. [2023-08-30 02:56:52,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46705776173285196 [2023-08-30 02:56:52,291 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1035 transitions. [2023-08-30 02:56:52,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1035 transitions. [2023-08-30 02:56:52,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:52,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1035 transitions. [2023-08-30 02:56:52,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.375) internal successors, (1035), 8 states have internal predecessors, (1035), 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) [2023-08-30 02:56:52,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 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) [2023-08-30 02:56:52,298 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 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) [2023-08-30 02:56:52,299 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 97 flow. Second operand 8 states and 1035 transitions. [2023-08-30 02:56:52,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 94 transitions, 449 flow [2023-08-30 02:56:52,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 437 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 02:56:52,320 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 174 flow [2023-08-30 02:56:52,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=174, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-30 02:56:52,325 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-30 02:56:52,326 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 174 flow [2023-08-30 02:56:52,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 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) [2023-08-30 02:56:52,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:52,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:52,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:56:52,327 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:52,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:52,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1037129305, now seen corresponding path program 1 times [2023-08-30 02:56:52,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:52,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595828635] [2023-08-30 02:56:52,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:52,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:52,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:52,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595828635] [2023-08-30 02:56:52,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595828635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:52,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:52,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:56:52,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358774425] [2023-08-30 02:56:52,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:52,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:56:52,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:52,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:56:52,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:56:52,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 277 [2023-08-30 02:56:52,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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) [2023-08-30 02:56:52,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:52,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 277 [2023-08-30 02:56:52,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:54,358 INFO L130 PetriNetUnfolder]: 10222/14289 cut-off events. [2023-08-30 02:56:54,358 INFO L131 PetriNetUnfolder]: For 16465/16596 co-relation queries the response was YES. [2023-08-30 02:56:54,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43180 conditions, 14289 events. 10222/14289 cut-off events. For 16465/16596 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 77145 event pairs, 910 based on Foata normal form. 509/14770 useless extension candidates. Maximal degree in co-relation 43168. Up to 8166 conditions per place. [2023-08-30 02:56:54,466 INFO L137 encePairwiseOnDemand]: 264/277 looper letters, 85 selfloop transitions, 34 changer transitions 8/130 dead transitions. [2023-08-30 02:56:54,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 130 transitions, 804 flow [2023-08-30 02:56:54,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:56:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:56:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 893 transitions. [2023-08-30 02:56:54,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46054667354306345 [2023-08-30 02:56:54,469 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 893 transitions. [2023-08-30 02:56:54,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 893 transitions. [2023-08-30 02:56:54,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:54,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 893 transitions. [2023-08-30 02:56:54,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 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) [2023-08-30 02:56:54,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:56:54,475 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:56:54,475 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 174 flow. Second operand 7 states and 893 transitions. [2023-08-30 02:56:54,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 130 transitions, 804 flow [2023-08-30 02:56:54,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 130 transitions, 796 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 02:56:54,582 INFO L231 Difference]: Finished difference. Result has 60 places, 73 transitions, 530 flow [2023-08-30 02:56:54,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=530, PETRI_PLACES=60, PETRI_TRANSITIONS=73} [2023-08-30 02:56:54,583 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-30 02:56:54,583 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 73 transitions, 530 flow [2023-08-30 02:56:54,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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) [2023-08-30 02:56:54,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:54,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:54,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:56:54,584 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:54,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:54,584 INFO L85 PathProgramCache]: Analyzing trace with hash 172176125, now seen corresponding path program 1 times [2023-08-30 02:56:54,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:54,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009800471] [2023-08-30 02:56:54,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:54,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:55,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:55,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009800471] [2023-08-30 02:56:55,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009800471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:55,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:55,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:56:55,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126797790] [2023-08-30 02:56:55,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:55,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:56:55,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:55,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:56:55,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:56:55,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 277 [2023-08-30 02:56:55,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 73 transitions, 530 flow. Second operand has 7 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 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) [2023-08-30 02:56:55,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:55,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 277 [2023-08-30 02:56:55,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:56,918 INFO L130 PetriNetUnfolder]: 10743/15511 cut-off events. [2023-08-30 02:56:56,918 INFO L131 PetriNetUnfolder]: For 44758/45042 co-relation queries the response was YES. [2023-08-30 02:56:56,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60265 conditions, 15511 events. 10743/15511 cut-off events. For 44758/45042 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 89761 event pairs, 1729 based on Foata normal form. 351/15733 useless extension candidates. Maximal degree in co-relation 60250. Up to 9949 conditions per place. [2023-08-30 02:56:57,042 INFO L137 encePairwiseOnDemand]: 269/277 looper letters, 84 selfloop transitions, 22 changer transitions 38/155 dead transitions. [2023-08-30 02:56:57,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 155 transitions, 1359 flow [2023-08-30 02:56:57,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:56:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:56:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 931 transitions. [2023-08-30 02:56:57,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48014440433212996 [2023-08-30 02:56:57,046 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 931 transitions. [2023-08-30 02:56:57,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 931 transitions. [2023-08-30 02:56:57,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:57,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 931 transitions. [2023-08-30 02:56:57,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 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) [2023-08-30 02:56:57,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:56:57,052 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:56:57,053 INFO L175 Difference]: Start difference. First operand has 60 places, 73 transitions, 530 flow. Second operand 7 states and 931 transitions. [2023-08-30 02:56:57,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 155 transitions, 1359 flow [2023-08-30 02:56:57,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 155 transitions, 1339 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-30 02:56:57,116 INFO L231 Difference]: Finished difference. Result has 70 places, 76 transitions, 638 flow [2023-08-30 02:56:57,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=638, PETRI_PLACES=70, PETRI_TRANSITIONS=76} [2023-08-30 02:56:57,118 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2023-08-30 02:56:57,118 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 76 transitions, 638 flow [2023-08-30 02:56:57,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 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) [2023-08-30 02:56:57,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:57,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:57,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:56:57,119 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:57,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1176367811, now seen corresponding path program 2 times [2023-08-30 02:56:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:57,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580834156] [2023-08-30 02:56:57,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:57,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:57,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:57,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580834156] [2023-08-30 02:56:57,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580834156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:57,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:57,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:56:57,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660302975] [2023-08-30 02:56:57,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:57,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:56:57,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:57,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:56:57,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:56:57,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-30 02:56:57,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 76 transitions, 638 flow. Second operand has 7 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 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) [2023-08-30 02:56:57,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:57,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-30 02:56:57,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:59,222 INFO L130 PetriNetUnfolder]: 9743/13939 cut-off events. [2023-08-30 02:56:59,222 INFO L131 PetriNetUnfolder]: For 65349/65640 co-relation queries the response was YES. [2023-08-30 02:56:59,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61686 conditions, 13939 events. 9743/13939 cut-off events. For 65349/65640 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 78048 event pairs, 1321 based on Foata normal form. 374/14203 useless extension candidates. Maximal degree in co-relation 61666. Up to 9043 conditions per place. [2023-08-30 02:56:59,339 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 79 selfloop transitions, 30 changer transitions 19/139 dead transitions. [2023-08-30 02:56:59,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 139 transitions, 1366 flow [2023-08-30 02:56:59,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:56:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:56:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions. [2023-08-30 02:56:59,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47601856627127387 [2023-08-30 02:56:59,342 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions. [2023-08-30 02:56:59,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions. [2023-08-30 02:56:59,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:59,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions. [2023-08-30 02:56:59,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 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) [2023-08-30 02:56:59,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:56:59,351 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:56:59,351 INFO L175 Difference]: Start difference. First operand has 70 places, 76 transitions, 638 flow. Second operand 7 states and 923 transitions. [2023-08-30 02:56:59,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 139 transitions, 1366 flow [2023-08-30 02:56:59,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 139 transitions, 1335 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-30 02:56:59,555 INFO L231 Difference]: Finished difference. Result has 71 places, 86 transitions, 848 flow [2023-08-30 02:56:59,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=848, PETRI_PLACES=71, PETRI_TRANSITIONS=86} [2023-08-30 02:56:59,556 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-30 02:56:59,556 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 86 transitions, 848 flow [2023-08-30 02:56:59,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 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) [2023-08-30 02:56:59,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:59,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:59,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:56:59,557 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:59,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:59,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2046422569, now seen corresponding path program 3 times [2023-08-30 02:56:59,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:59,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454732] [2023-08-30 02:56:59,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:00,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:00,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454732] [2023-08-30 02:57:00,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454732] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:00,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:00,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:57:00,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825268544] [2023-08-30 02:57:00,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:00,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:57:00,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:00,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:57:00,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:57:00,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 277 [2023-08-30 02:57:00,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 86 transitions, 848 flow. Second operand has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 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) [2023-08-30 02:57:00,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:00,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 277 [2023-08-30 02:57:00,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:02,377 INFO L130 PetriNetUnfolder]: 14864/20597 cut-off events. [2023-08-30 02:57:02,378 INFO L131 PetriNetUnfolder]: For 108492/108492 co-relation queries the response was YES. [2023-08-30 02:57:02,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95544 conditions, 20597 events. 14864/20597 cut-off events. For 108492/108492 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 110743 event pairs, 1001 based on Foata normal form. 536/21133 useless extension candidates. Maximal degree in co-relation 95523. Up to 8182 conditions per place. [2023-08-30 02:57:02,771 INFO L137 encePairwiseOnDemand]: 263/277 looper letters, 116 selfloop transitions, 95 changer transitions 42/253 dead transitions. [2023-08-30 02:57:02,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 253 transitions, 2619 flow [2023-08-30 02:57:02,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 02:57:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 02:57:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1336 transitions. [2023-08-30 02:57:02,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4384640630127995 [2023-08-30 02:57:02,776 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1336 transitions. [2023-08-30 02:57:02,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1336 transitions. [2023-08-30 02:57:02,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:02,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1336 transitions. [2023-08-30 02:57:02,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.45454545454545) internal successors, (1336), 11 states have internal predecessors, (1336), 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) [2023-08-30 02:57:02,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 277.0) internal successors, (3324), 12 states have internal predecessors, (3324), 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) [2023-08-30 02:57:02,785 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 277.0) internal successors, (3324), 12 states have internal predecessors, (3324), 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) [2023-08-30 02:57:02,785 INFO L175 Difference]: Start difference. First operand has 71 places, 86 transitions, 848 flow. Second operand 11 states and 1336 transitions. [2023-08-30 02:57:02,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 253 transitions, 2619 flow [2023-08-30 02:57:03,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 253 transitions, 2555 flow, removed 32 selfloop flow, removed 2 redundant places. [2023-08-30 02:57:03,041 INFO L231 Difference]: Finished difference. Result has 85 places, 146 transitions, 1860 flow [2023-08-30 02:57:03,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1860, PETRI_PLACES=85, PETRI_TRANSITIONS=146} [2023-08-30 02:57:03,042 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2023-08-30 02:57:03,042 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 146 transitions, 1860 flow [2023-08-30 02:57:03,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 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) [2023-08-30 02:57:03,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:03,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:03,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:57:03,043 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:03,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:03,044 INFO L85 PathProgramCache]: Analyzing trace with hash -177303361, now seen corresponding path program 4 times [2023-08-30 02:57:03,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:03,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958860389] [2023-08-30 02:57:03,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:03,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:03,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958860389] [2023-08-30 02:57:03,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958860389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:03,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:03,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:57:03,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53704831] [2023-08-30 02:57:03,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:03,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:57:03,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:03,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:57:03,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:57:03,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 277 [2023-08-30 02:57:03,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 146 transitions, 1860 flow. Second operand has 7 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 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) [2023-08-30 02:57:03,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:03,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 277 [2023-08-30 02:57:03,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:05,813 INFO L130 PetriNetUnfolder]: 11920/17188 cut-off events. [2023-08-30 02:57:05,813 INFO L131 PetriNetUnfolder]: For 162682/163118 co-relation queries the response was YES. [2023-08-30 02:57:05,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98107 conditions, 17188 events. 11920/17188 cut-off events. For 162682/163118 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 100282 event pairs, 1635 based on Foata normal form. 474/17569 useless extension candidates. Maximal degree in co-relation 98079. Up to 10001 conditions per place. [2023-08-30 02:57:05,952 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 122 selfloop transitions, 38 changer transitions 20/203 dead transitions. [2023-08-30 02:57:05,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 203 transitions, 2829 flow [2023-08-30 02:57:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:57:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:57:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 910 transitions. [2023-08-30 02:57:05,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4693140794223827 [2023-08-30 02:57:05,955 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 910 transitions. [2023-08-30 02:57:05,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 910 transitions. [2023-08-30 02:57:05,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:05,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 910 transitions. [2023-08-30 02:57:05,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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) [2023-08-30 02:57:05,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:57:05,961 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:57:05,961 INFO L175 Difference]: Start difference. First operand has 85 places, 146 transitions, 1860 flow. Second operand 7 states and 910 transitions. [2023-08-30 02:57:05,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 203 transitions, 2829 flow [2023-08-30 02:57:06,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 203 transitions, 2723 flow, removed 27 selfloop flow, removed 6 redundant places. [2023-08-30 02:57:06,295 INFO L231 Difference]: Finished difference. Result has 85 places, 152 transitions, 2010 flow [2023-08-30 02:57:06,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2010, PETRI_PLACES=85, PETRI_TRANSITIONS=152} [2023-08-30 02:57:06,296 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2023-08-30 02:57:06,296 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 152 transitions, 2010 flow [2023-08-30 02:57:06,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 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) [2023-08-30 02:57:06,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:06,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:06,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:57:06,297 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:06,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:06,298 INFO L85 PathProgramCache]: Analyzing trace with hash -14657414, now seen corresponding path program 1 times [2023-08-30 02:57:06,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:06,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488214616] [2023-08-30 02:57:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:06,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:06,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488214616] [2023-08-30 02:57:06,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488214616] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:06,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:06,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:57:06,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134240365] [2023-08-30 02:57:06,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:06,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:57:06,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:06,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:57:06,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:57:06,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 277 [2023-08-30 02:57:06,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 152 transitions, 2010 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 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) [2023-08-30 02:57:06,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:06,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 277 [2023-08-30 02:57:06,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:09,430 INFO L130 PetriNetUnfolder]: 16634/23583 cut-off events. [2023-08-30 02:57:09,430 INFO L131 PetriNetUnfolder]: For 207234/207395 co-relation queries the response was YES. [2023-08-30 02:57:09,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133115 conditions, 23583 events. 16634/23583 cut-off events. For 207234/207395 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 138868 event pairs, 2105 based on Foata normal form. 417/23900 useless extension candidates. Maximal degree in co-relation 133087. Up to 10170 conditions per place. [2023-08-30 02:57:09,595 INFO L137 encePairwiseOnDemand]: 264/277 looper letters, 121 selfloop transitions, 69 changer transitions 97/293 dead transitions. [2023-08-30 02:57:09,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 293 transitions, 4350 flow [2023-08-30 02:57:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:57:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:57:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2023-08-30 02:57:09,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4553893759669933 [2023-08-30 02:57:09,598 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2023-08-30 02:57:09,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2023-08-30 02:57:09,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:09,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2023-08-30 02:57:09,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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) [2023-08-30 02:57:09,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:57:09,603 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:57:09,603 INFO L175 Difference]: Start difference. First operand has 85 places, 152 transitions, 2010 flow. Second operand 7 states and 883 transitions. [2023-08-30 02:57:09,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 293 transitions, 4350 flow [2023-08-30 02:57:10,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 293 transitions, 4143 flow, removed 89 selfloop flow, removed 4 redundant places. [2023-08-30 02:57:10,057 INFO L231 Difference]: Finished difference. Result has 91 places, 166 transitions, 2427 flow [2023-08-30 02:57:10,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1915, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2427, PETRI_PLACES=91, PETRI_TRANSITIONS=166} [2023-08-30 02:57:10,058 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 40 predicate places. [2023-08-30 02:57:10,058 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 166 transitions, 2427 flow [2023-08-30 02:57:10,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 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) [2023-08-30 02:57:10,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:10,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:10,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:57:10,059 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:10,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:10,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1094612568, now seen corresponding path program 1 times [2023-08-30 02:57:10,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:10,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963041229] [2023-08-30 02:57:10,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:10,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:11,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:11,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963041229] [2023-08-30 02:57:11,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963041229] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:11,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:11,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 02:57:11,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401219437] [2023-08-30 02:57:11,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:11,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 02:57:11,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:11,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 02:57:11,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-30 02:57:11,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 277 [2023-08-30 02:57:11,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 166 transitions, 2427 flow. Second operand has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 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) [2023-08-30 02:57:11,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:11,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 277 [2023-08-30 02:57:11,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:14,008 INFO L130 PetriNetUnfolder]: 17681/25136 cut-off events. [2023-08-30 02:57:14,008 INFO L131 PetriNetUnfolder]: For 222255/222255 co-relation queries the response was YES. [2023-08-30 02:57:14,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143962 conditions, 25136 events. 17681/25136 cut-off events. For 222255/222255 co-relation queries the response was YES. Maximal size of possible extension queue 1008. Compared 148948 event pairs, 1000 based on Foata normal form. 272/25408 useless extension candidates. Maximal degree in co-relation 143931. Up to 13012 conditions per place. [2023-08-30 02:57:14,256 INFO L137 encePairwiseOnDemand]: 263/277 looper letters, 154 selfloop transitions, 103 changer transitions 51/308 dead transitions. [2023-08-30 02:57:14,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 308 transitions, 4493 flow [2023-08-30 02:57:14,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 02:57:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 02:57:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1223 transitions. [2023-08-30 02:57:14,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4415162454873646 [2023-08-30 02:57:14,259 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1223 transitions. [2023-08-30 02:57:14,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1223 transitions. [2023-08-30 02:57:14,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:14,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1223 transitions. [2023-08-30 02:57:14,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.3) internal successors, (1223), 10 states have internal predecessors, (1223), 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) [2023-08-30 02:57:14,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 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) [2023-08-30 02:57:14,264 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 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) [2023-08-30 02:57:14,264 INFO L175 Difference]: Start difference. First operand has 91 places, 166 transitions, 2427 flow. Second operand 10 states and 1223 transitions. [2023-08-30 02:57:14,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 308 transitions, 4493 flow [2023-08-30 02:57:15,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 308 transitions, 4443 flow, removed 25 selfloop flow, removed 2 redundant places. [2023-08-30 02:57:15,254 INFO L231 Difference]: Finished difference. Result has 103 places, 201 transitions, 3364 flow [2023-08-30 02:57:15,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=2403, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3364, PETRI_PLACES=103, PETRI_TRANSITIONS=201} [2023-08-30 02:57:15,255 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 52 predicate places. [2023-08-30 02:57:15,255 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 201 transitions, 3364 flow [2023-08-30 02:57:15,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 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) [2023-08-30 02:57:15,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:15,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:15,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:57:15,256 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:15,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:15,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1028476548, now seen corresponding path program 2 times [2023-08-30 02:57:15,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:15,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992524126] [2023-08-30 02:57:15,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:15,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:15,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:15,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992524126] [2023-08-30 02:57:15,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992524126] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:15,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:15,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:57:15,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896588547] [2023-08-30 02:57:15,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:15,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:57:15,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:15,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:57:15,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:57:15,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 277 [2023-08-30 02:57:15,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 201 transitions, 3364 flow. Second operand has 8 states, 8 states have (on average 125.25) internal successors, (1002), 8 states have internal predecessors, (1002), 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) [2023-08-30 02:57:15,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:15,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 277 [2023-08-30 02:57:15,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:18,754 INFO L130 PetriNetUnfolder]: 14729/21983 cut-off events. [2023-08-30 02:57:18,755 INFO L131 PetriNetUnfolder]: For 299581/301399 co-relation queries the response was YES. [2023-08-30 02:57:18,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142558 conditions, 21983 events. 14729/21983 cut-off events. For 299581/301399 co-relation queries the response was YES. Maximal size of possible extension queue 1108. Compared 144784 event pairs, 2286 based on Foata normal form. 1112/22842 useless extension candidates. Maximal degree in co-relation 142521. Up to 14532 conditions per place. [2023-08-30 02:57:18,971 INFO L137 encePairwiseOnDemand]: 269/277 looper letters, 171 selfloop transitions, 43 changer transitions 16/265 dead transitions. [2023-08-30 02:57:18,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 265 transitions, 4553 flow [2023-08-30 02:57:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:57:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:57:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 931 transitions. [2023-08-30 02:57:18,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48014440433212996 [2023-08-30 02:57:18,974 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 931 transitions. [2023-08-30 02:57:18,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 931 transitions. [2023-08-30 02:57:18,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:18,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 931 transitions. [2023-08-30 02:57:18,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 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) [2023-08-30 02:57:18,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:57:18,979 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:57:18,979 INFO L175 Difference]: Start difference. First operand has 103 places, 201 transitions, 3364 flow. Second operand 7 states and 931 transitions. [2023-08-30 02:57:18,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 265 transitions, 4553 flow [2023-08-30 02:57:19,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 265 transitions, 4362 flow, removed 35 selfloop flow, removed 4 redundant places. [2023-08-30 02:57:19,932 INFO L231 Difference]: Finished difference. Result has 106 places, 212 transitions, 3573 flow [2023-08-30 02:57:19,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=3208, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3573, PETRI_PLACES=106, PETRI_TRANSITIONS=212} [2023-08-30 02:57:19,932 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 55 predicate places. [2023-08-30 02:57:19,932 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 212 transitions, 3573 flow [2023-08-30 02:57:19,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 125.25) internal successors, (1002), 8 states have internal predecessors, (1002), 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) [2023-08-30 02:57:19,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:19,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:19,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:57:19,934 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:19,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:19,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1223555188, now seen corresponding path program 3 times [2023-08-30 02:57:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:19,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795901600] [2023-08-30 02:57:19,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:19,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:21,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:21,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795901600] [2023-08-30 02:57:21,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795901600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:21,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:21,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:57:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027721703] [2023-08-30 02:57:21,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:21,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:57:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:21,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:57:21,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:57:21,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 277 [2023-08-30 02:57:21,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 212 transitions, 3573 flow. Second operand has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 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) [2023-08-30 02:57:21,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:21,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 277 [2023-08-30 02:57:21,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:25,097 INFO L130 PetriNetUnfolder]: 19609/28116 cut-off events. [2023-08-30 02:57:25,097 INFO L131 PetriNetUnfolder]: For 313673/313673 co-relation queries the response was YES. [2023-08-30 02:57:25,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176153 conditions, 28116 events. 19609/28116 cut-off events. For 313673/313673 co-relation queries the response was YES. Maximal size of possible extension queue 1207. Compared 174359 event pairs, 3861 based on Foata normal form. 272/28388 useless extension candidates. Maximal degree in co-relation 176113. Up to 14241 conditions per place. [2023-08-30 02:57:25,309 INFO L137 encePairwiseOnDemand]: 263/277 looper letters, 164 selfloop transitions, 129 changer transitions 46/339 dead transitions. [2023-08-30 02:57:25,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 339 transitions, 5702 flow [2023-08-30 02:57:25,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 02:57:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 02:57:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1214 transitions. [2023-08-30 02:57:25,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43826714801444044 [2023-08-30 02:57:25,312 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1214 transitions. [2023-08-30 02:57:25,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1214 transitions. [2023-08-30 02:57:25,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:25,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1214 transitions. [2023-08-30 02:57:25,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.4) internal successors, (1214), 10 states have internal predecessors, (1214), 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) [2023-08-30 02:57:25,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 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) [2023-08-30 02:57:25,318 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 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) [2023-08-30 02:57:25,318 INFO L175 Difference]: Start difference. First operand has 106 places, 212 transitions, 3573 flow. Second operand 10 states and 1214 transitions. [2023-08-30 02:57:25,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 339 transitions, 5702 flow [2023-08-30 02:57:26,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 339 transitions, 5602 flow, removed 35 selfloop flow, removed 4 redundant places. [2023-08-30 02:57:26,316 INFO L231 Difference]: Finished difference. Result has 117 places, 245 transitions, 4627 flow [2023-08-30 02:57:26,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=3497, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4627, PETRI_PLACES=117, PETRI_TRANSITIONS=245} [2023-08-30 02:57:26,317 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 66 predicate places. [2023-08-30 02:57:26,317 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 245 transitions, 4627 flow [2023-08-30 02:57:26,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 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) [2023-08-30 02:57:26,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:26,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:26,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:57:26,317 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:26,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:26,318 INFO L85 PathProgramCache]: Analyzing trace with hash -6163708, now seen corresponding path program 4 times [2023-08-30 02:57:26,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:26,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944669039] [2023-08-30 02:57:26,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:26,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:27,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:27,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944669039] [2023-08-30 02:57:27,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944669039] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:27,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:27,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:57:27,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689031122] [2023-08-30 02:57:27,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:27,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:57:27,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:27,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:57:27,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:57:27,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 277 [2023-08-30 02:57:27,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 245 transitions, 4627 flow. Second operand has 8 states, 8 states have (on average 123.25) internal successors, (986), 8 states have internal predecessors, (986), 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) [2023-08-30 02:57:27,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:27,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 277 [2023-08-30 02:57:27,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:30,801 INFO L130 PetriNetUnfolder]: 16027/24021 cut-off events. [2023-08-30 02:57:30,802 INFO L131 PetriNetUnfolder]: For 380419/382766 co-relation queries the response was YES. [2023-08-30 02:57:30,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168495 conditions, 24021 events. 16027/24021 cut-off events. For 380419/382766 co-relation queries the response was YES. Maximal size of possible extension queue 1282. Compared 162473 event pairs, 2737 based on Foata normal form. 1384/25019 useless extension candidates. Maximal degree in co-relation 168450. Up to 13990 conditions per place. [2023-08-30 02:57:31,054 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 188 selfloop transitions, 44 changer transitions 15/295 dead transitions. [2023-08-30 02:57:31,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 295 transitions, 5650 flow [2023-08-30 02:57:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:57:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:57:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 915 transitions. [2023-08-30 02:57:31,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4718927282104177 [2023-08-30 02:57:31,057 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 915 transitions. [2023-08-30 02:57:31,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 915 transitions. [2023-08-30 02:57:31,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:31,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 915 transitions. [2023-08-30 02:57:31,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.71428571428572) internal successors, (915), 7 states have internal predecessors, (915), 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) [2023-08-30 02:57:31,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:57:31,061 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:57:31,061 INFO L175 Difference]: Start difference. First operand has 117 places, 245 transitions, 4627 flow. Second operand 7 states and 915 transitions. [2023-08-30 02:57:31,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 295 transitions, 5650 flow [2023-08-30 02:57:32,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 295 transitions, 5525 flow, removed 62 selfloop flow, removed 3 redundant places. [2023-08-30 02:57:32,386 INFO L231 Difference]: Finished difference. Result has 120 places, 248 transitions, 4739 flow [2023-08-30 02:57:32,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=4514, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4739, PETRI_PLACES=120, PETRI_TRANSITIONS=248} [2023-08-30 02:57:32,387 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 69 predicate places. [2023-08-30 02:57:32,387 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 248 transitions, 4739 flow [2023-08-30 02:57:32,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 123.25) internal successors, (986), 8 states have internal predecessors, (986), 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) [2023-08-30 02:57:32,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:32,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:32,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:57:32,388 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:32,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:32,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1910600988, now seen corresponding path program 5 times [2023-08-30 02:57:32,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:32,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253239216] [2023-08-30 02:57:32,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:32,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:33,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:33,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253239216] [2023-08-30 02:57:33,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253239216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:33,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:33,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:57:33,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411412417] [2023-08-30 02:57:33,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:33,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:57:33,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:33,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:57:33,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:57:33,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 277 [2023-08-30 02:57:33,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 248 transitions, 4739 flow. Second operand has 7 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 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) [2023-08-30 02:57:33,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:33,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 277 [2023-08-30 02:57:33,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:37,667 INFO L130 PetriNetUnfolder]: 21309/31016 cut-off events. [2023-08-30 02:57:37,667 INFO L131 PetriNetUnfolder]: For 406628/406628 co-relation queries the response was YES. [2023-08-30 02:57:37,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199812 conditions, 31016 events. 21309/31016 cut-off events. For 406628/406628 co-relation queries the response was YES. Maximal size of possible extension queue 1311. Compared 199711 event pairs, 1920 based on Foata normal form. 416/31432 useless extension candidates. Maximal degree in co-relation 199766. Up to 10393 conditions per place. [2023-08-30 02:57:37,950 INFO L137 encePairwiseOnDemand]: 263/277 looper letters, 192 selfloop transitions, 133 changer transitions 45/370 dead transitions. [2023-08-30 02:57:37,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 370 transitions, 7001 flow [2023-08-30 02:57:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 02:57:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 02:57:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1219 transitions. [2023-08-30 02:57:37,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44007220216606496 [2023-08-30 02:57:37,953 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1219 transitions. [2023-08-30 02:57:37,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1219 transitions. [2023-08-30 02:57:37,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:37,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1219 transitions. [2023-08-30 02:57:37,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.9) internal successors, (1219), 10 states have internal predecessors, (1219), 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) [2023-08-30 02:57:37,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 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) [2023-08-30 02:57:37,959 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 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) [2023-08-30 02:57:37,959 INFO L175 Difference]: Start difference. First operand has 120 places, 248 transitions, 4739 flow. Second operand 10 states and 1219 transitions. [2023-08-30 02:57:37,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 370 transitions, 7001 flow [2023-08-30 02:57:39,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 370 transitions, 6895 flow, removed 25 selfloop flow, removed 6 redundant places. [2023-08-30 02:57:39,755 INFO L231 Difference]: Finished difference. Result has 127 places, 270 transitions, 5577 flow [2023-08-30 02:57:39,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=4656, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5577, PETRI_PLACES=127, PETRI_TRANSITIONS=270} [2023-08-30 02:57:39,756 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 76 predicate places. [2023-08-30 02:57:39,756 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 270 transitions, 5577 flow [2023-08-30 02:57:39,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 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) [2023-08-30 02:57:39,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:39,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:39,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 02:57:39,757 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:39,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1141278074, now seen corresponding path program 1 times [2023-08-30 02:57:39,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:39,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737522831] [2023-08-30 02:57:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:39,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:39,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:39,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737522831] [2023-08-30 02:57:39,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737522831] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:39,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:39,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:57:39,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685563677] [2023-08-30 02:57:39,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:39,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:57:39,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:39,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:57:39,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:57:39,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-30 02:57:39,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 270 transitions, 5577 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 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) [2023-08-30 02:57:39,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:39,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-30 02:57:39,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:43,007 INFO L130 PetriNetUnfolder]: 13222/20531 cut-off events. [2023-08-30 02:57:43,007 INFO L131 PetriNetUnfolder]: For 462242/469207 co-relation queries the response was YES. [2023-08-30 02:57:43,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142734 conditions, 20531 events. 13222/20531 cut-off events. For 462242/469207 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 151590 event pairs, 2529 based on Foata normal form. 4716/24758 useless extension candidates. Maximal degree in co-relation 142685. Up to 13751 conditions per place. [2023-08-30 02:57:43,213 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 415 selfloop transitions, 10 changer transitions 47/541 dead transitions. [2023-08-30 02:57:43,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 541 transitions, 12463 flow [2023-08-30 02:57:43,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:57:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:57:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2023-08-30 02:57:43,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48736462093862815 [2023-08-30 02:57:43,215 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 675 transitions. [2023-08-30 02:57:43,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions. [2023-08-30 02:57:43,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:43,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions. [2023-08-30 02:57:43,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 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) [2023-08-30 02:57:43,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 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) [2023-08-30 02:57:43,219 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 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) [2023-08-30 02:57:43,219 INFO L175 Difference]: Start difference. First operand has 127 places, 270 transitions, 5577 flow. Second operand 5 states and 675 transitions. [2023-08-30 02:57:43,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 541 transitions, 12463 flow [2023-08-30 02:57:43,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 541 transitions, 12205 flow, removed 75 selfloop flow, removed 4 redundant places. [2023-08-30 02:57:43,938 INFO L231 Difference]: Finished difference. Result has 127 places, 267 transitions, 5372 flow [2023-08-30 02:57:43,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=5246, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5372, PETRI_PLACES=127, PETRI_TRANSITIONS=267} [2023-08-30 02:57:43,939 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 76 predicate places. [2023-08-30 02:57:43,939 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 267 transitions, 5372 flow [2023-08-30 02:57:43,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 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) [2023-08-30 02:57:43,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:43,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:43,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 02:57:43,940 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:43,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash -14876050, now seen corresponding path program 1 times [2023-08-30 02:57:43,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:43,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085400729] [2023-08-30 02:57:43,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:43,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:44,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:44,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085400729] [2023-08-30 02:57:44,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085400729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:44,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:44,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:57:44,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080205085] [2023-08-30 02:57:44,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:44,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:57:44,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:44,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:57:44,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:57:44,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-30 02:57:44,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 267 transitions, 5372 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 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) [2023-08-30 02:57:44,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:44,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-30 02:57:44,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:46,817 INFO L130 PetriNetUnfolder]: 9897/15857 cut-off events. [2023-08-30 02:57:46,817 INFO L131 PetriNetUnfolder]: For 377257/385340 co-relation queries the response was YES. [2023-08-30 02:57:46,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118439 conditions, 15857 events. 9897/15857 cut-off events. For 377257/385340 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 118983 event pairs, 643 based on Foata normal form. 4669/20179 useless extension candidates. Maximal degree in co-relation 118389. Up to 6528 conditions per place. [2023-08-30 02:57:46,928 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 473 selfloop transitions, 18 changer transitions 111/663 dead transitions. [2023-08-30 02:57:46,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 663 transitions, 15229 flow [2023-08-30 02:57:46,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:57:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:57:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 946 transitions. [2023-08-30 02:57:46,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878803506962352 [2023-08-30 02:57:46,930 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 946 transitions. [2023-08-30 02:57:46,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 946 transitions. [2023-08-30 02:57:46,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:46,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 946 transitions. [2023-08-30 02:57:46,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 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) [2023-08-30 02:57:46,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:57:46,934 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:57:46,934 INFO L175 Difference]: Start difference. First operand has 127 places, 267 transitions, 5372 flow. Second operand 7 states and 946 transitions. [2023-08-30 02:57:46,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 663 transitions, 15229 flow [2023-08-30 02:57:47,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 663 transitions, 14970 flow, removed 127 selfloop flow, removed 1 redundant places. [2023-08-30 02:57:47,303 INFO L231 Difference]: Finished difference. Result has 135 places, 243 transitions, 4788 flow [2023-08-30 02:57:47,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=4641, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4788, PETRI_PLACES=135, PETRI_TRANSITIONS=243} [2023-08-30 02:57:47,304 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 84 predicate places. [2023-08-30 02:57:47,304 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 243 transitions, 4788 flow [2023-08-30 02:57:47,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 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) [2023-08-30 02:57:47,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:47,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:47,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 02:57:47,305 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:47,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:47,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1399476782, now seen corresponding path program 1 times [2023-08-30 02:57:47,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:47,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14566739] [2023-08-30 02:57:47,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:47,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:47,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:47,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14566739] [2023-08-30 02:57:47,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14566739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:47,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:47,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:57:47,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412262203] [2023-08-30 02:57:47,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:47,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:57:47,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:47,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:57:47,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:57:47,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 277 [2023-08-30 02:57:47,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 243 transitions, 4788 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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) [2023-08-30 02:57:47,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:47,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 277 [2023-08-30 02:57:47,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:52,074 INFO L130 PetriNetUnfolder]: 16461/26506 cut-off events. [2023-08-30 02:57:52,074 INFO L131 PetriNetUnfolder]: For 524432/524881 co-relation queries the response was YES. [2023-08-30 02:57:52,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218249 conditions, 26506 events. 16461/26506 cut-off events. For 524432/524881 co-relation queries the response was YES. Maximal size of possible extension queue 1422. Compared 204424 event pairs, 1602 based on Foata normal form. 543/26984 useless extension candidates. Maximal degree in co-relation 218196. Up to 11291 conditions per place. [2023-08-30 02:57:52,363 INFO L137 encePairwiseOnDemand]: 263/277 looper letters, 148 selfloop transitions, 66 changer transitions 299/519 dead transitions. [2023-08-30 02:57:52,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 519 transitions, 10427 flow [2023-08-30 02:57:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:57:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:57:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2023-08-30 02:57:52,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4559051057246003 [2023-08-30 02:57:52,365 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2023-08-30 02:57:52,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2023-08-30 02:57:52,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:52,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2023-08-30 02:57:52,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 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) [2023-08-30 02:57:52,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:57:52,369 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:57:52,369 INFO L175 Difference]: Start difference. First operand has 135 places, 243 transitions, 4788 flow. Second operand 7 states and 884 transitions. [2023-08-30 02:57:52,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 519 transitions, 10427 flow [2023-08-30 02:57:55,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 519 transitions, 10198 flow, removed 84 selfloop flow, removed 4 redundant places. [2023-08-30 02:57:55,472 INFO L231 Difference]: Finished difference. Result has 140 places, 160 transitions, 3253 flow [2023-08-30 02:57:55,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=4731, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3253, PETRI_PLACES=140, PETRI_TRANSITIONS=160} [2023-08-30 02:57:55,473 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 89 predicate places. [2023-08-30 02:57:55,473 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 160 transitions, 3253 flow [2023-08-30 02:57:55,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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) [2023-08-30 02:57:55,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:55,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:55,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 02:57:55,477 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:55,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:55,477 INFO L85 PathProgramCache]: Analyzing trace with hash 627875262, now seen corresponding path program 2 times [2023-08-30 02:57:55,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:55,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882339327] [2023-08-30 02:57:55,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:55,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:55,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:55,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882339327] [2023-08-30 02:57:55,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882339327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:55,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:55,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:57:55,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778835406] [2023-08-30 02:57:55,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:55,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:57:55,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:55,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:57:55,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:57:55,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-30 02:57:55,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 160 transitions, 3253 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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) [2023-08-30 02:57:55,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:55,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-30 02:57:55,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:57,523 INFO L130 PetriNetUnfolder]: 7078/12651 cut-off events. [2023-08-30 02:57:57,523 INFO L131 PetriNetUnfolder]: For 264087/264796 co-relation queries the response was YES. [2023-08-30 02:57:57,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98709 conditions, 12651 events. 7078/12651 cut-off events. For 264087/264796 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 101404 event pairs, 2097 based on Foata normal form. 525/13062 useless extension candidates. Maximal degree in co-relation 98654. Up to 6147 conditions per place. [2023-08-30 02:57:57,601 INFO L137 encePairwiseOnDemand]: 273/277 looper letters, 127 selfloop transitions, 22 changer transitions 60/225 dead transitions. [2023-08-30 02:57:57,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 225 transitions, 4619 flow [2023-08-30 02:57:57,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:57:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:57:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2023-08-30 02:57:57,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4866425992779783 [2023-08-30 02:57:57,603 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2023-08-30 02:57:57,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2023-08-30 02:57:57,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:57,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2023-08-30 02:57:57,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 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) [2023-08-30 02:57:57,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 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) [2023-08-30 02:57:57,605 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 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) [2023-08-30 02:57:57,605 INFO L175 Difference]: Start difference. First operand has 140 places, 160 transitions, 3253 flow. Second operand 5 states and 674 transitions. [2023-08-30 02:57:57,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 225 transitions, 4619 flow [2023-08-30 02:57:58,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 225 transitions, 4418 flow, removed 38 selfloop flow, removed 14 redundant places. [2023-08-30 02:57:58,262 INFO L231 Difference]: Finished difference. Result has 130 places, 144 transitions, 2779 flow [2023-08-30 02:57:58,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=3077, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2779, PETRI_PLACES=130, PETRI_TRANSITIONS=144} [2023-08-30 02:57:58,262 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 79 predicate places. [2023-08-30 02:57:58,262 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 144 transitions, 2779 flow [2023-08-30 02:57:58,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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) [2023-08-30 02:57:58,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:58,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:58,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 02:57:58,263 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:58,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:58,263 INFO L85 PathProgramCache]: Analyzing trace with hash -880102960, now seen corresponding path program 1 times [2023-08-30 02:57:58,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:58,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49516864] [2023-08-30 02:57:58,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:58,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:58,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:58,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49516864] [2023-08-30 02:57:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49516864] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:58,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:58,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:57:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049653557] [2023-08-30 02:57:58,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:58,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:57:58,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:58,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:57:58,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:57:58,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-30 02:57:58,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 144 transitions, 2779 flow. Second operand has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 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) [2023-08-30 02:57:58,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:58,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-30 02:57:58,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:59,767 INFO L130 PetriNetUnfolder]: 4960/8768 cut-off events. [2023-08-30 02:57:59,767 INFO L131 PetriNetUnfolder]: For 206093/208623 co-relation queries the response was YES. [2023-08-30 02:57:59,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62668 conditions, 8768 events. 4960/8768 cut-off events. For 206093/208623 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 69076 event pairs, 204 based on Foata normal form. 2268/10887 useless extension candidates. Maximal degree in co-relation 62618. Up to 3253 conditions per place. [2023-08-30 02:57:59,832 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 199 selfloop transitions, 17 changer transitions 219/455 dead transitions. [2023-08-30 02:57:59,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 455 transitions, 10331 flow [2023-08-30 02:57:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:57:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:57:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1203 transitions. [2023-08-30 02:57:59,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4825511432009627 [2023-08-30 02:57:59,833 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1203 transitions. [2023-08-30 02:57:59,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1203 transitions. [2023-08-30 02:57:59,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:59,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1203 transitions. [2023-08-30 02:57:59,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.66666666666666) internal successors, (1203), 9 states have internal predecessors, (1203), 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) [2023-08-30 02:57:59,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 277.0) internal successors, (2770), 10 states have internal predecessors, (2770), 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) [2023-08-30 02:57:59,838 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 277.0) internal successors, (2770), 10 states have internal predecessors, (2770), 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) [2023-08-30 02:57:59,838 INFO L175 Difference]: Start difference. First operand has 130 places, 144 transitions, 2779 flow. Second operand 9 states and 1203 transitions. [2023-08-30 02:57:59,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 455 transitions, 10331 flow [2023-08-30 02:58:00,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 455 transitions, 9636 flow, removed 126 selfloop flow, removed 10 redundant places. [2023-08-30 02:58:00,304 INFO L231 Difference]: Finished difference. Result has 129 places, 115 transitions, 2116 flow [2023-08-30 02:58:00,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=2358, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2116, PETRI_PLACES=129, PETRI_TRANSITIONS=115} [2023-08-30 02:58:00,307 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 78 predicate places. [2023-08-30 02:58:00,307 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 115 transitions, 2116 flow [2023-08-30 02:58:00,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 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) [2023-08-30 02:58:00,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:00,307 INFO L208 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] [2023-08-30 02:58:00,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 02:58:00,308 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:00,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1204189911, now seen corresponding path program 1 times [2023-08-30 02:58:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253858333] [2023-08-30 02:58:00,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:00,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:00,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:00,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253858333] [2023-08-30 02:58:00,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253858333] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:00,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:00,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:58:00,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068950865] [2023-08-30 02:58:00,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:00,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:58:00,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:00,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:58:00,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:58:00,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-30 02:58:00,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 115 transitions, 2116 flow. Second operand has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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) [2023-08-30 02:58:00,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:00,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-30 02:58:00,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:01,519 INFO L130 PetriNetUnfolder]: 3006/5501 cut-off events. [2023-08-30 02:58:01,519 INFO L131 PetriNetUnfolder]: For 108796/110435 co-relation queries the response was YES. [2023-08-30 02:58:01,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41251 conditions, 5501 events. 3006/5501 cut-off events. For 108796/110435 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 42378 event pairs, 142 based on Foata normal form. 1094/6520 useless extension candidates. Maximal degree in co-relation 41203. Up to 1761 conditions per place. [2023-08-30 02:58:01,545 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 33 selfloop transitions, 17 changer transitions 335/389 dead transitions. [2023-08-30 02:58:01,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 389 transitions, 8417 flow [2023-08-30 02:58:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 02:58:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 02:58:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1441 transitions. [2023-08-30 02:58:01,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4729241877256318 [2023-08-30 02:58:01,547 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1441 transitions. [2023-08-30 02:58:01,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1441 transitions. [2023-08-30 02:58:01,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:01,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1441 transitions. [2023-08-30 02:58:01,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 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) [2023-08-30 02:58:01,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 277.0) internal successors, (3324), 12 states have internal predecessors, (3324), 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) [2023-08-30 02:58:01,551 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 277.0) internal successors, (3324), 12 states have internal predecessors, (3324), 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) [2023-08-30 02:58:01,551 INFO L175 Difference]: Start difference. First operand has 129 places, 115 transitions, 2116 flow. Second operand 11 states and 1441 transitions. [2023-08-30 02:58:01,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 389 transitions, 8417 flow [2023-08-30 02:58:01,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 389 transitions, 8026 flow, removed 132 selfloop flow, removed 13 redundant places. [2023-08-30 02:58:01,819 INFO L231 Difference]: Finished difference. Result has 128 places, 41 transitions, 526 flow [2023-08-30 02:58:01,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=526, PETRI_PLACES=128, PETRI_TRANSITIONS=41} [2023-08-30 02:58:01,819 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 77 predicate places. [2023-08-30 02:58:01,820 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 41 transitions, 526 flow [2023-08-30 02:58:01,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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) [2023-08-30 02:58:01,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:01,820 INFO L208 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] [2023-08-30 02:58:01,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 02:58:01,820 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:01,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:01,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1618203421, now seen corresponding path program 1 times [2023-08-30 02:58:01,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:01,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46767099] [2023-08-30 02:58:01,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:01,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:58:01,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:58:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:58:01,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:58:01,914 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:58:01,915 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:58:01,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:58:01,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:58:01,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:58:01,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:58:01,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:58:01,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:58:01,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:58:01,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:58:01,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:58:01,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:58:01,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:58:01,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:58:01,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:58:01,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:58:01,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:58:01,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 02:58:01,925 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:01,931 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:58:01,931 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:58:02,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:58:02 BasicIcfg [2023-08-30 02:58:02,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:58:02,029 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:58:02,029 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:58:02,029 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:58:02,030 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:56:40" (3/4) ... [2023-08-30 02:58:02,032 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:58:02,032 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:58:02,033 INFO L158 Benchmark]: Toolchain (without parser) took 83329.44ms. Allocated memory was 75.5MB in the beginning and 13.1GB in the end (delta: 13.0GB). Free memory was 56.7MB in the beginning and 10.1GB in the end (delta: -10.0GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2023-08-30 02:58:02,033 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 75.5MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:58:02,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.34ms. Allocated memory is still 75.5MB. Free memory was 56.7MB in the beginning and 33.3MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-30 02:58:02,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.38ms. Allocated memory is still 75.5MB. Free memory was 33.3MB in the beginning and 30.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:58:02,034 INFO L158 Benchmark]: Boogie Preprocessor took 60.22ms. Allocated memory is still 75.5MB. Free memory was 30.4MB in the beginning and 28.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:58:02,034 INFO L158 Benchmark]: RCFGBuilder took 702.95ms. Allocated memory was 75.5MB in the beginning and 102.8MB in the end (delta: 27.3MB). Free memory was 28.6MB in the beginning and 47.2MB in the end (delta: -18.6MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2023-08-30 02:58:02,034 INFO L158 Benchmark]: TraceAbstraction took 81974.08ms. Allocated memory was 102.8MB in the beginning and 13.1GB in the end (delta: 13.0GB). Free memory was 46.7MB in the beginning and 10.1GB in the end (delta: -10.0GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2023-08-30 02:58:02,034 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 13.1GB. Free memory is still 10.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:58:02,041 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 75.5MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.34ms. Allocated memory is still 75.5MB. Free memory was 56.7MB in the beginning and 33.3MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.38ms. Allocated memory is still 75.5MB. Free memory was 33.3MB in the beginning and 30.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.22ms. Allocated memory is still 75.5MB. Free memory was 30.4MB in the beginning and 28.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 702.95ms. Allocated memory was 75.5MB in the beginning and 102.8MB in the end (delta: 27.3MB). Free memory was 28.6MB in the beginning and 47.2MB in the end (delta: -18.6MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * TraceAbstraction took 81974.08ms. Allocated memory was 102.8MB in the beginning and 13.1GB in the end (delta: 13.0GB). Free memory was 46.7MB in the beginning and 10.1GB in the end (delta: -10.0GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 13.1GB. Free memory is still 10.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 148 PlacesBefore, 51 PlacesAfterwards, 137 TransitionsBefore, 39 TransitionsAfterwards, 3258 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 136 TotalNumberOfCompositions, 8450 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4394, independent: 4185, independent conditional: 0, independent unconditional: 4185, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1731, independent: 1701, independent conditional: 0, independent unconditional: 1701, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4394, independent: 2484, independent conditional: 0, independent unconditional: 2484, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 1731, unknown conditional: 0, unknown unconditional: 1731] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 181, Positive conditional cache size: 0, Positive unconditional cache size: 181, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1253, ((void *)0), P0, ((void *)0))=-2, t1253={5: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] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, pthread_create(&t1254, ((void *)0), P1, ((void *)0))=-1, t1253={5:0}, t1254={6: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 t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1255, ((void *)0), P2, ((void *)0))=0, t1253={5:0}, t1254={6:0}, t1255={7: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 t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1256, ((void *)0), P3, ((void *)0))=1, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3: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] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, 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] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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] [L750] 1 b = 1 VAL [__unbuffered_cnt=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=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] [L753] 1 x = 1 VAL [__unbuffered_cnt=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=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] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=2, 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] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=2, 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] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, 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] [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, 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] [L786] 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) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 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 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 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 [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, 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] [L822] 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) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 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 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 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 [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=2, 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] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 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 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 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 [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 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) [L869] 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)) [L870] 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)) [L871] 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)) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 16 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: 81.7s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 65.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1935 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1636 mSDsluCounter, 1246 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1105 mSDsCounter, 351 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4835 IncrementalHoareTripleChecker+Invalid, 5186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 351 mSolverCounterUnsat, 141 mSDtfsCounter, 4835 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5577occurred in iteration=17, InterpolantAutomatonStates: 164, 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.6s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 405 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 355 ConstructedInterpolants, 0 QuantifiedInterpolants, 4286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 [2023-08-30 02:58:02,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/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 ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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.graphml --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 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:58:04,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:58:04,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:58:04,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:58:04,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:58:04,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:58:04,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:58:04,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:58:04,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:58:04,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:58:04,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:58:04,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:58:04,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:58:04,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:58:04,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:58:04,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:58:04,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:58:04,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:58:04,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:58:04,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:58:04,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:58:04,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:58:04,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:58:04,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:58:04,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:58:04,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:58:04,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:58:04,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:58:04,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:58:04,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:58:04,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:58:04,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:58:04,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:58:04,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:58:04,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:58:04,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:58:04,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:58:04,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:58:04,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:58:04,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:58:04,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:58:04,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:58:04,718 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:58:04,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:58:04,720 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:58:04,720 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:58:04,721 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:58:04,721 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:58:04,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:58:04,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:58:04,722 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:58:04,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:58:04,723 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:58:04,723 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:58:04,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:58:04,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:58:04,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:58:04,724 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:58:04,724 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:58:04,724 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:58:04,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:58:04,724 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:58:04,725 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:58:04,725 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:58:04,725 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:58:04,725 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:58:04,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:58:04,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:58:04,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:58:04,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:58:04,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:58:04,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:58:04,726 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:58:04,727 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:58:04,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:58:04,727 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:58:04,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:58:04,727 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:58:04,727 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:58:04,728 INFO L138 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.graphml 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 -> 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:58:05,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:58:05,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:58:05,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:58:05,049 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:58:05,050 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:58:05,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-30 02:58:06,218 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:58:06,452 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:58:06,452 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-30 02:58:06,467 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b91640fd/77671772798448a5a4e0d3f6a195cae8/FLAG5a44a5ab2 [2023-08-30 02:58:06,488 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b91640fd/77671772798448a5a4e0d3f6a195cae8 [2023-08-30 02:58:06,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:58:06,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:58:06,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:58:06,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:58:06,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:58:06,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:58:06" (1/1) ... [2023-08-30 02:58:06,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25cdec1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:06, skipping insertion in model container [2023-08-30 02:58:06,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:58:06" (1/1) ... [2023-08-30 02:58:06,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:58:06,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:58:06,758 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-08-30 02:58:06,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:58:07,000 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:58:07,013 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-08-30 02:58:07,065 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:58:07,110 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:58:07,110 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:58:07,116 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:58:07,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:07 WrapperNode [2023-08-30 02:58:07,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:58:07,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:58:07,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:58:07,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:58:07,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:07" (1/1) ... [2023-08-30 02:58:07,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:07" (1/1) ... [2023-08-30 02:58:07,200 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2023-08-30 02:58:07,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:58:07,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:58:07,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:58:07,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:58:07,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:07" (1/1) ... [2023-08-30 02:58:07,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:07" (1/1) ... [2023-08-30 02:58:07,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:07" (1/1) ... [2023-08-30 02:58:07,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:07" (1/1) ... [2023-08-30 02:58:07,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:07" (1/1) ... [2023-08-30 02:58:07,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:07" (1/1) ... [2023-08-30 02:58:07,255 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:07" (1/1) ... [2023-08-30 02:58:07,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:07" (1/1) ... [2023-08-30 02:58:07,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:58:07,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:58:07,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:58:07,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:58:07,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:07" (1/1) ... [2023-08-30 02:58:07,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:58:07,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:58:07,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:58:07,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:58:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:58:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:58:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:58:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:58:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:58:07,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:58:07,339 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:58:07,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:58:07,339 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:58:07,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:58:07,339 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:58:07,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:58:07,340 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:58:07,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:58:07,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:58:07,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:58:07,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:58:07,342 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:58:07,468 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:58:07,470 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:58:07,864 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:58:08,010 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:58:08,011 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:58:08,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:08 BoogieIcfgContainer [2023-08-30 02:58:08,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:58:08,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:58:08,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:58:08,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:58:08,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:58:06" (1/3) ... [2023-08-30 02:58:08,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169ed907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:58:08, skipping insertion in model container [2023-08-30 02:58:08,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:07" (2/3) ... [2023-08-30 02:58:08,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169ed907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:58:08, skipping insertion in model container [2023-08-30 02:58:08,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:08" (3/3) ... [2023-08-30 02:58:08,022 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-30 02:58:08,035 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:58:08,035 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:58:08,035 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:58:08,124 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:58:08,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-08-30 02:58:08,210 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-30 02:58:08,211 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:08,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-30 02:58:08,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-08-30 02:58:08,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 138 transitions, 288 flow [2023-08-30 02:58:08,232 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:58:08,240 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-30 02:58:08,243 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-30 02:58:08,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 288 flow [2023-08-30 02:58:08,267 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-30 02:58:08,267 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:08,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-30 02:58:08,270 INFO L119 LiptonReduction]: Number of co-enabled transitions 3258 [2023-08-30 02:58:16,119 INFO L134 LiptonReduction]: Checked pairs total: 8434 [2023-08-30 02:58:16,119 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-30 02:58:16,132 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:58:16,138 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@189541bd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:58:16,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:58:16,140 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:58:16,141 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:16,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:16,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:58:16,142 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:16,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:16,147 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times [2023-08-30 02:58:16,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:16,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961021558] [2023-08-30 02:58:16,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:16,164 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 [2023-08-30 02:58:16,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:16,185 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) [2023-08-30 02:58:16,218 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 [2023-08-30 02:58:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:16,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:58:16,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:16,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:16,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:16,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961021558] [2023-08-30 02:58:16,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961021558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:16,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:16,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:58:16,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312484724] [2023-08-30 02:58:16,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:16,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:58:16,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:16,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:58:16,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:58:16,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 277 [2023-08-30 02:58:16,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 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) [2023-08-30 02:58:16,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:16,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 277 [2023-08-30 02:58:16,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:17,218 INFO L130 PetriNetUnfolder]: 3743/5261 cut-off events. [2023-08-30 02:58:17,219 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-30 02:58:17,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10501 conditions, 5261 events. 3743/5261 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 27052 event pairs, 3743 based on Foata normal form. 0/4492 useless extension candidates. Maximal degree in co-relation 10489. Up to 5137 conditions per place. [2023-08-30 02:58:17,257 INFO L137 encePairwiseOnDemand]: 269/277 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-30 02:58:17,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-08-30 02:58:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:58:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:58:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2023-08-30 02:58:17,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252707581227437 [2023-08-30 02:58:17,278 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 291 transitions. [2023-08-30 02:58:17,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions. [2023-08-30 02:58:17,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:17,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions. [2023-08-30 02:58:17,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 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) [2023-08-30 02:58:17,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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) [2023-08-30 02:58:17,296 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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) [2023-08-30 02:58:17,298 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 86 flow. Second operand 2 states and 291 transitions. [2023-08-30 02:58:17,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-08-30 02:58:17,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:17,309 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-30 02:58:17,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-30 02:58:17,316 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-30 02:58:17,317 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-30 02:58:17,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 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) [2023-08-30 02:58:17,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:17,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:17,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:17,533 WARN L477 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 [2023-08-30 02:58:17,534 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:17,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash -218921628, now seen corresponding path program 1 times [2023-08-30 02:58:17,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:17,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121256035] [2023-08-30 02:58:17,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:17,536 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 [2023-08-30 02:58:17,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:17,538 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) [2023-08-30 02:58:17,542 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 [2023-08-30 02:58:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:17,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:58:17,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:17,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:17,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:17,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121256035] [2023-08-30 02:58:17,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121256035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:17,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:17,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:58:17,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103616473] [2023-08-30 02:58:17,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:17,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:58:17,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:17,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:58:17,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:58:17,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 277 [2023-08-30 02:58:17,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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) [2023-08-30 02:58:17,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:17,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 277 [2023-08-30 02:58:17,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:18,378 INFO L130 PetriNetUnfolder]: 3113/4523 cut-off events. [2023-08-30 02:58:18,379 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:18,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8914 conditions, 4523 events. 3113/4523 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 24534 event pairs, 593 based on Foata normal form. 0/4150 useless extension candidates. Maximal degree in co-relation 8911. Up to 3385 conditions per place. [2023-08-30 02:58:18,400 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 32 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-08-30 02:58:18,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 160 flow [2023-08-30 02:58:18,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:58:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:58:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-30 02:58:18,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50661853188929 [2023-08-30 02:58:18,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-30 02:58:18,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-30 02:58:18,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:18,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-30 02:58:18,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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) [2023-08-30 02:58:18,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 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) [2023-08-30 02:58:18,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 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) [2023-08-30 02:58:18,415 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 421 transitions. [2023-08-30 02:58:18,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 160 flow [2023-08-30 02:58:18,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:58:18,417 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-30 02:58:18,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-30 02:58:18,418 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-30 02:58:18,418 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-30 02:58:18,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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) [2023-08-30 02:58:18,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:18,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:18,428 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 [2023-08-30 02:58:18,628 WARN L477 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 [2023-08-30 02:58:18,628 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:18,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash 69802272, now seen corresponding path program 1 times [2023-08-30 02:58:18,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:18,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391286322] [2023-08-30 02:58:18,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:18,631 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 [2023-08-30 02:58:18,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:18,632 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) [2023-08-30 02:58:18,635 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 [2023-08-30 02:58:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:18,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:58:18,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:18,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:18,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:18,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391286322] [2023-08-30 02:58:18,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391286322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:18,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:18,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:18,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914992626] [2023-08-30 02:58:18,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:18,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:58:18,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:18,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:58:18,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:58:18,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 277 [2023-08-30 02:58:18,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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) [2023-08-30 02:58:18,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:18,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 277 [2023-08-30 02:58:18,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:19,304 INFO L130 PetriNetUnfolder]: 2213/3220 cut-off events. [2023-08-30 02:58:19,304 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2023-08-30 02:58:19,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6689 conditions, 3220 events. 2213/3220 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 16339 event pairs, 423 based on Foata normal form. 180/3261 useless extension candidates. Maximal degree in co-relation 6685. Up to 2428 conditions per place. [2023-08-30 02:58:19,319 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 35 selfloop transitions, 5 changer transitions 23/67 dead transitions. [2023-08-30 02:58:19,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 284 flow [2023-08-30 02:58:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-30 02:58:19,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48014440433212996 [2023-08-30 02:58:19,322 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-30 02:58:19,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-30 02:58:19,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:19,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-30 02:58:19,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 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) [2023-08-30 02:58:19,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 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) [2023-08-30 02:58:19,328 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 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) [2023-08-30 02:58:19,328 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 5 states and 665 transitions. [2023-08-30 02:58:19,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 284 flow [2023-08-30 02:58:19,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:19,332 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 107 flow [2023-08-30 02:58:19,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-30 02:58:19,333 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-30 02:58:19,333 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 107 flow [2023-08-30 02:58:19,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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) [2023-08-30 02:58:19,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:19,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:19,350 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 [2023-08-30 02:58:19,547 WARN L477 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 [2023-08-30 02:58:19,548 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:19,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:19,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1977177652, now seen corresponding path program 1 times [2023-08-30 02:58:19,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:19,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780101587] [2023-08-30 02:58:19,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:19,549 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 [2023-08-30 02:58:19,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:19,550 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) [2023-08-30 02:58:19,553 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 [2023-08-30 02:58:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:19,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:58:19,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:19,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:19,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:19,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780101587] [2023-08-30 02:58:19,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780101587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:19,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:19,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:19,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633067373] [2023-08-30 02:58:19,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:19,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:19,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:19,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:19,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:19,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 277 [2023-08-30 02:58:19,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 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) [2023-08-30 02:58:19,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:19,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 277 [2023-08-30 02:58:19,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:20,128 INFO L130 PetriNetUnfolder]: 1185/1840 cut-off events. [2023-08-30 02:58:20,129 INFO L131 PetriNetUnfolder]: For 769/769 co-relation queries the response was YES. [2023-08-30 02:58:20,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5116 conditions, 1840 events. 1185/1840 cut-off events. For 769/769 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8975 event pairs, 173 based on Foata normal form. 132/1909 useless extension candidates. Maximal degree in co-relation 5109. Up to 872 conditions per place. [2023-08-30 02:58:20,139 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 46 selfloop transitions, 9 changer transitions 23/82 dead transitions. [2023-08-30 02:58:20,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 425 flow [2023-08-30 02:58:20,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:58:20,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:58:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions. [2023-08-30 02:58:20,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4813477737665463 [2023-08-30 02:58:20,143 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 800 transitions. [2023-08-30 02:58:20,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions. [2023-08-30 02:58:20,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:20,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions. [2023-08-30 02:58:20,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 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) [2023-08-30 02:58:20,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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) [2023-08-30 02:58:20,150 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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) [2023-08-30 02:58:20,150 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 107 flow. Second operand 6 states and 800 transitions. [2023-08-30 02:58:20,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 425 flow [2023-08-30 02:58:20,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 418 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:20,157 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 172 flow [2023-08-30 02:58:20,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-30 02:58:20,158 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-30 02:58:20,158 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 172 flow [2023-08-30 02:58:20,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 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) [2023-08-30 02:58:20,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:20,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:20,175 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 (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:20,369 WARN L477 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 [2023-08-30 02:58:20,369 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:20,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash -808798012, now seen corresponding path program 1 times [2023-08-30 02:58:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:20,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669374669] [2023-08-30 02:58:20,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:20,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:20,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:20,371 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) [2023-08-30 02:58:20,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 02:58:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:20,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:58:20,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:20,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:20,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:20,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669374669] [2023-08-30 02:58:20,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669374669] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:20,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:20,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:58:20,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285977236] [2023-08-30 02:58:20,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:20,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:20,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:20,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:20,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:20,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 277 [2023-08-30 02:58:20,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 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) [2023-08-30 02:58:20,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:20,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 277 [2023-08-30 02:58:20,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:20,956 INFO L130 PetriNetUnfolder]: 649/1052 cut-off events. [2023-08-30 02:58:20,956 INFO L131 PetriNetUnfolder]: For 1200/1200 co-relation queries the response was YES. [2023-08-30 02:58:20,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3439 conditions, 1052 events. 649/1052 cut-off events. For 1200/1200 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4654 event pairs, 123 based on Foata normal form. 56/1089 useless extension candidates. Maximal degree in co-relation 3430. Up to 391 conditions per place. [2023-08-30 02:58:20,963 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 55 selfloop transitions, 13 changer transitions 23/95 dead transitions. [2023-08-30 02:58:20,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 95 transitions, 586 flow [2023-08-30 02:58:20,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 933 transitions. [2023-08-30 02:58:20,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481175863847344 [2023-08-30 02:58:20,967 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 933 transitions. [2023-08-30 02:58:20,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 933 transitions. [2023-08-30 02:58:20,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:20,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 933 transitions. [2023-08-30 02:58:20,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.28571428571428) internal successors, (933), 7 states have internal predecessors, (933), 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) [2023-08-30 02:58:20,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:58:20,974 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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) [2023-08-30 02:58:20,974 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 172 flow. Second operand 7 states and 933 transitions. [2023-08-30 02:58:20,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 95 transitions, 586 flow [2023-08-30 02:58:20,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 524 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:20,985 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 222 flow [2023-08-30 02:58:20,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-30 02:58:20,986 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-30 02:58:20,987 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 222 flow [2023-08-30 02:58:20,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 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) [2023-08-30 02:58:20,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:20,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:21,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:21,197 WARN L477 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 [2023-08-30 02:58:21,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:21,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:21,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1279127939, now seen corresponding path program 1 times [2023-08-30 02:58:21,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:21,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343516286] [2023-08-30 02:58:21,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:21,198 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 [2023-08-30 02:58:21,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:21,199 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) [2023-08-30 02:58:21,201 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 [2023-08-30 02:58:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:21,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:58:21,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:21,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:21,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:21,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343516286] [2023-08-30 02:58:21,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343516286] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:21,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:21,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:58:21,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748321640] [2023-08-30 02:58:21,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:21,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:58:21,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:21,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:58:21,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:58:21,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 277 [2023-08-30 02:58:21,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 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) [2023-08-30 02:58:21,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:21,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 277 [2023-08-30 02:58:21,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:21,822 INFO L130 PetriNetUnfolder]: 528/843 cut-off events. [2023-08-30 02:58:21,822 INFO L131 PetriNetUnfolder]: For 950/950 co-relation queries the response was YES. [2023-08-30 02:58:21,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2642 conditions, 843 events. 528/843 cut-off events. For 950/950 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3542 event pairs, 119 based on Foata normal form. 12/847 useless extension candidates. Maximal degree in co-relation 2632. Up to 340 conditions per place. [2023-08-30 02:58:21,829 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 51 selfloop transitions, 17 changer transitions 12/84 dead transitions. [2023-08-30 02:58:21,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 530 flow [2023-08-30 02:58:21,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:58:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:58:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1042 transitions. [2023-08-30 02:58:21,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47021660649819497 [2023-08-30 02:58:21,834 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1042 transitions. [2023-08-30 02:58:21,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1042 transitions. [2023-08-30 02:58:21,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:21,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1042 transitions. [2023-08-30 02:58:21,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.25) internal successors, (1042), 8 states have internal predecessors, (1042), 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) [2023-08-30 02:58:21,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 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) [2023-08-30 02:58:21,841 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 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) [2023-08-30 02:58:21,842 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 222 flow. Second operand 8 states and 1042 transitions. [2023-08-30 02:58:21,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 530 flow [2023-08-30 02:58:21,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 468 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-30 02:58:21,852 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 216 flow [2023-08-30 02:58:21,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-30 02:58:21,853 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-30 02:58:21,853 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 216 flow [2023-08-30 02:58:21,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 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) [2023-08-30 02:58:21,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:21,854 INFO L208 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] [2023-08-30 02:58:21,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:22,064 WARN L477 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 [2023-08-30 02:58:22,064 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:22,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:22,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1407494605, now seen corresponding path program 1 times [2023-08-30 02:58:22,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:22,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515844279] [2023-08-30 02:58:22,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:22,065 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 [2023-08-30 02:58:22,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:22,067 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) [2023-08-30 02:58:22,068 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 [2023-08-30 02:58:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:22,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 02:58:22,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:22,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:22,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:22,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515844279] [2023-08-30 02:58:22,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515844279] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:22,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:22,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:22,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108243759] [2023-08-30 02:58:22,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:22,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:22,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:22,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:22,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:23,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 277 [2023-08-30 02:58:23,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 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) [2023-08-30 02:58:23,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:23,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 277 [2023-08-30 02:58:23,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:23,558 INFO L130 PetriNetUnfolder]: 518/835 cut-off events. [2023-08-30 02:58:23,559 INFO L131 PetriNetUnfolder]: For 1126/1126 co-relation queries the response was YES. [2023-08-30 02:58:23,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2567 conditions, 835 events. 518/835 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3725 event pairs, 90 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 2556. Up to 669 conditions per place. [2023-08-30 02:58:23,565 INFO L137 encePairwiseOnDemand]: 272/277 looper letters, 51 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2023-08-30 02:58:23,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 447 flow [2023-08-30 02:58:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:58:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:58:23,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2023-08-30 02:58:23,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4151624548736462 [2023-08-30 02:58:23,569 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2023-08-30 02:58:23,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2023-08-30 02:58:23,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:23,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2023-08-30 02:58:23,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 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) [2023-08-30 02:58:23,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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) [2023-08-30 02:58:23,573 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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) [2023-08-30 02:58:23,574 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 216 flow. Second operand 6 states and 690 transitions. [2023-08-30 02:58:23,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 447 flow [2023-08-30 02:58:23,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 358 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-30 02:58:23,579 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 158 flow [2023-08-30 02:58:23,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-30 02:58:23,580 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-08-30 02:58:23,580 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 158 flow [2023-08-30 02:58:23,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 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) [2023-08-30 02:58:23,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:23,580 INFO L208 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] [2023-08-30 02:58:23,596 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 [2023-08-30 02:58:23,796 WARN L477 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 [2023-08-30 02:58:23,797 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:23,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash -674909892, now seen corresponding path program 1 times [2023-08-30 02:58:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:23,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364824625] [2023-08-30 02:58:23,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:23,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 [2023-08-30 02:58:23,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:23,799 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) [2023-08-30 02:58:23,802 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 [2023-08-30 02:58:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:23,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:58:23,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:23,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:23,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:23,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364824625] [2023-08-30 02:58:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364824625] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:23,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:23,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:58:23,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562171998] [2023-08-30 02:58:23,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:23,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:58:23,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:23,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:58:23,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:58:23,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 277 [2023-08-30 02:58:23,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-30 02:58:23,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:23,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 277 [2023-08-30 02:58:23,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:24,137 INFO L130 PetriNetUnfolder]: 932/1481 cut-off events. [2023-08-30 02:58:24,137 INFO L131 PetriNetUnfolder]: For 1054/1054 co-relation queries the response was YES. [2023-08-30 02:58:24,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4184 conditions, 1481 events. 932/1481 cut-off events. For 1054/1054 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7500 event pairs, 443 based on Foata normal form. 1/1469 useless extension candidates. Maximal degree in co-relation 4176. Up to 889 conditions per place. [2023-08-30 02:58:24,148 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 50 selfloop transitions, 2 changer transitions 11/66 dead transitions. [2023-08-30 02:58:24,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 412 flow [2023-08-30 02:58:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:58:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:58:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-30 02:58:24,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030084235860409 [2023-08-30 02:58:24,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-30 02:58:24,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-30 02:58:24,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:24,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-30 02:58:24,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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) [2023-08-30 02:58:24,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 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) [2023-08-30 02:58:24,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 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) [2023-08-30 02:58:24,154 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 158 flow. Second operand 3 states and 418 transitions. [2023-08-30 02:58:24,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 412 flow [2023-08-30 02:58:24,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 402 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:24,165 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 159 flow [2023-08-30 02:58:24,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-30 02:58:24,168 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-30 02:58:24,168 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 159 flow [2023-08-30 02:58:24,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-30 02:58:24,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:24,169 INFO L208 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] [2023-08-30 02:58:24,188 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 (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:24,387 WARN L477 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 [2023-08-30 02:58:24,388 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:24,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:24,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1225350938, now seen corresponding path program 2 times [2023-08-30 02:58:24,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:24,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522793923] [2023-08-30 02:58:24,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:58:24,389 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 [2023-08-30 02:58:24,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:24,390 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) [2023-08-30 02:58:24,390 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 [2023-08-30 02:58:24,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:58:24,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:58:24,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:58:24,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:24,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:24,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522793923] [2023-08-30 02:58:24,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522793923] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:24,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:24,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:24,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371533022] [2023-08-30 02:58:24,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:24,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:58:24,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:24,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:58:24,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:58:24,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-08-30 02:58:24,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 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) [2023-08-30 02:58:24,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:24,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-08-30 02:58:24,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:24,726 INFO L130 PetriNetUnfolder]: 485/821 cut-off events. [2023-08-30 02:58:24,726 INFO L131 PetriNetUnfolder]: For 725/727 co-relation queries the response was YES. [2023-08-30 02:58:24,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2522 conditions, 821 events. 485/821 cut-off events. For 725/727 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3792 event pairs, 95 based on Foata normal form. 2/820 useless extension candidates. Maximal degree in co-relation 2513. Up to 471 conditions per place. [2023-08-30 02:58:24,730 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 47 selfloop transitions, 1 changer transitions 31/82 dead transitions. [2023-08-30 02:58:24,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 518 flow [2023-08-30 02:58:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:58:24,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:58:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-30 02:58:24,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963898916967509 [2023-08-30 02:58:24,733 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-30 02:58:24,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-30 02:58:24,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:24,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-30 02:58:24,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 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) [2023-08-30 02:58:24,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 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) [2023-08-30 02:58:24,736 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 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) [2023-08-30 02:58:24,737 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 159 flow. Second operand 4 states and 550 transitions. [2023-08-30 02:58:24,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 518 flow [2023-08-30 02:58:24,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 508 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:24,743 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 160 flow [2023-08-30 02:58:24,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-30 02:58:24,744 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-30 02:58:24,744 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 160 flow [2023-08-30 02:58:24,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 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) [2023-08-30 02:58:24,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:24,745 INFO L208 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] [2023-08-30 02:58:24,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:24,955 WARN L477 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 [2023-08-30 02:58:24,956 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:24,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:24,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1972041630, now seen corresponding path program 3 times [2023-08-30 02:58:24,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:24,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16375252] [2023-08-30 02:58:24,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:58:24,957 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 [2023-08-30 02:58:24,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:24,958 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) [2023-08-30 02:58:24,959 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 [2023-08-30 02:58:25,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:58:25,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:58:25,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:58:25,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:25,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:25,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:25,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16375252] [2023-08-30 02:58:25,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16375252] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:25,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:25,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:58:25,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878063296] [2023-08-30 02:58:25,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:25,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:58:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:25,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:58:25,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:58:25,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 277 [2023-08-30 02:58:25,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-30 02:58:25,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:25,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 277 [2023-08-30 02:58:25,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:25,261 INFO L130 PetriNetUnfolder]: 735/1224 cut-off events. [2023-08-30 02:58:25,261 INFO L131 PetriNetUnfolder]: For 1284/1287 co-relation queries the response was YES. [2023-08-30 02:58:25,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3706 conditions, 1224 events. 735/1224 cut-off events. For 1284/1287 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6075 event pairs, 325 based on Foata normal form. 2/1211 useless extension candidates. Maximal degree in co-relation 3696. Up to 739 conditions per place. [2023-08-30 02:58:25,266 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 38 selfloop transitions, 2 changer transitions 25/68 dead transitions. [2023-08-30 02:58:25,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 422 flow [2023-08-30 02:58:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:58:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:58:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-30 02:58:25,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054151624548736 [2023-08-30 02:58:25,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-30 02:58:25,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-30 02:58:25,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:25,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-30 02:58:25,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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) [2023-08-30 02:58:25,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 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) [2023-08-30 02:58:25,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 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) [2023-08-30 02:58:25,272 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 160 flow. Second operand 3 states and 420 transitions. [2023-08-30 02:58:25,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 422 flow [2023-08-30 02:58:25,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 419 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:25,280 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 165 flow [2023-08-30 02:58:25,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-30 02:58:25,281 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-30 02:58:25,281 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 165 flow [2023-08-30 02:58:25,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-30 02:58:25,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:25,282 INFO L208 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] [2023-08-30 02:58:25,296 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 [2023-08-30 02:58:25,496 WARN L477 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 [2023-08-30 02:58:25,497 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:25,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1514919250, now seen corresponding path program 4 times [2023-08-30 02:58:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:25,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429993914] [2023-08-30 02:58:25,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:58:25,498 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 [2023-08-30 02:58:25,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:25,499 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) [2023-08-30 02:58:25,499 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 [2023-08-30 02:58:25,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:58:25,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:58:25,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:58:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:58:25,834 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:58:25,834 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:58:25,835 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:58:25,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:58:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:58:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:58:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:58:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:58:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:58:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:58:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:58:25,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:58:25,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:58:25,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:58:25,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:58:25,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:58:25,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:58:25,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:58:25,852 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 (12)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:26,050 WARN L477 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 [2023-08-30 02:58:26,050 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:26,054 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:58:26,054 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:58:26,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:58:26 BasicIcfg [2023-08-30 02:58:26,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:58:26,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:58:26,139 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:58:26,139 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:58:26,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:08" (3/4) ... [2023-08-30 02:58:26,142 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:58:26,142 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:58:26,143 INFO L158 Benchmark]: Toolchain (without parser) took 19650.90ms. Allocated memory was 67.1MB in the beginning and 570.4MB in the end (delta: 503.3MB). Free memory was 35.2MB in the beginning and 468.6MB in the end (delta: -433.4MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2023-08-30 02:58:26,143 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory is still 32.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:58:26,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.28ms. Allocated memory is still 67.1MB. Free memory was 34.9MB in the beginning and 42.6MB in the end (delta: -7.6MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2023-08-30 02:58:26,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.34ms. Allocated memory is still 67.1MB. Free memory was 42.6MB in the beginning and 39.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:58:26,144 INFO L158 Benchmark]: Boogie Preprocessor took 60.37ms. Allocated memory is still 67.1MB. Free memory was 39.8MB in the beginning and 37.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:58:26,145 INFO L158 Benchmark]: RCFGBuilder took 745.53ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 37.4MB in the beginning and 46.4MB in the end (delta: -9.0MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2023-08-30 02:58:26,145 INFO L158 Benchmark]: TraceAbstraction took 18122.62ms. Allocated memory was 81.8MB in the beginning and 570.4MB in the end (delta: 488.6MB). Free memory was 45.9MB in the beginning and 468.6MB in the end (delta: -422.7MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2023-08-30 02:58:26,145 INFO L158 Benchmark]: Witness Printer took 4.76ms. Allocated memory is still 570.4MB. Free memory is still 468.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:58:26,147 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory is still 32.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.28ms. Allocated memory is still 67.1MB. Free memory was 34.9MB in the beginning and 42.6MB in the end (delta: -7.6MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.34ms. Allocated memory is still 67.1MB. Free memory was 42.6MB in the beginning and 39.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.37ms. Allocated memory is still 67.1MB. Free memory was 39.8MB in the beginning and 37.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 745.53ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 37.4MB in the beginning and 46.4MB in the end (delta: -9.0MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18122.62ms. Allocated memory was 81.8MB in the beginning and 570.4MB in the end (delta: 488.6MB). Free memory was 45.9MB in the beginning and 468.6MB in the end (delta: -422.7MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * Witness Printer took 4.76ms. Allocated memory is still 570.4MB. Free memory is still 468.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 149 PlacesBefore, 50 PlacesAfterwards, 138 TransitionsBefore, 37 TransitionsAfterwards, 3258 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 135 TotalNumberOfCompositions, 8434 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3998, independent: 3781, independent conditional: 0, independent unconditional: 3781, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1785, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3998, independent: 2037, independent conditional: 0, independent unconditional: 2037, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 1785, unknown conditional: 0, unknown unconditional: 1785] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1253, ((void *)0), P0, ((void *)0))=0, t1253={11: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] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, pthread_create(&t1254, ((void *)0), P1, ((void *)0))=1, t1253={11:0}, t1254={15: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 t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1255, ((void *)0), P2, ((void *)0))=2, t1253={11:0}, t1254={15:0}, t1255={7: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 t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1256, ((void *)0), P3, ((void *)0))=3, t1253={11:0}, t1254={15:0}, t1255={7:0}, t1256={-2147483637: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] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, 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] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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] [L750] 1 b = 1 VAL [__unbuffered_cnt=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=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] [L753] 1 x = 1 VAL [__unbuffered_cnt=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=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] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=2, 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] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=2, 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] [L780] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, 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] [L783] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, 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] [L786] 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) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 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 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, 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] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L822] 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) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 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 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=2, 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] [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 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 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 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 [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={11:0}, t1254={15:0}, t1255={7:0}, t1256={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 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) [L869] 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)) [L870] 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)) [L871] 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)) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: 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, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 locations, 16 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: 17.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 404 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1649 IncrementalHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 41 mSDtfsCounter, 1649 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=5, InterpolantAutomatonStates: 47, 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, 0.9s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 167 ConstructedInterpolants, 14 QuantifiedInterpolants, 1443 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1522 ConjunctsInSsa, 66 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 [2023-08-30 02:58:26,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample