./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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 b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:38:03,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:38:03,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:38:03,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:38:03,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:38:03,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:38:03,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:38:03,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:38:03,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:38:03,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:38:03,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:38:03,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:38:03,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:38:03,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:38:03,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:38:03,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:38:03,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:38:03,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:38:03,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:38:03,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:38:03,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:38:03,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:38:03,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:38:03,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:38:03,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:38:03,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:38:03,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:38:03,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:38:03,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:38:03,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:38:03,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:38:03,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:38:03,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:38:03,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:38:03,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:38:03,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:38:03,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:38:03,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:38:03,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:38:03,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:38:03,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:38:03,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:38:03,675 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:38:03,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:38:03,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:38:03,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:38:03,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:38:03,677 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:38:03,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:38:03,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:38:03,678 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:38:03,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:38:03,678 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:38:03,678 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:38:03,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:38:03,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:38:03,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:38:03,678 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:38:03,679 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:38:03,679 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:38:03,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:38:03,679 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:38:03,679 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:38:03,679 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:38:03,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:38:03,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:38:03,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:38:03,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:38:03,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:38:03,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:38:03,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:38:03,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:38:03,680 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:38:03,680 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:38:03,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:38:03,680 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:38:03,680 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 -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 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 -> BEFORE [2023-08-31 23:38:04,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:38:04,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:38:04,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:38:04,032 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:38:04,032 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:38:04,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:38:05,086 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:38:05,360 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:38:05,380 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:38:05,397 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4855337fb/9c798cc58cd04613a679c6caca4c2b54/FLAG96b38ac8b [2023-08-31 23:38:05,417 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4855337fb/9c798cc58cd04613a679c6caca4c2b54 [2023-08-31 23:38:05,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:38:05,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:38:05,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:38:05,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:38:05,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:38:05,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:38:05" (1/1) ... [2023-08-31 23:38:05,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27cba4d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05, skipping insertion in model container [2023-08-31 23:38:05,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:38:05" (1/1) ... [2023-08-31 23:38:05,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:38:05,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:38:05,633 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-31 23:38:05,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:38:05,867 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:38:05,878 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-31 23:38:05,927 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:38:05,955 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:38:05,955 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:38:05,961 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:38:05,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05 WrapperNode [2023-08-31 23:38:05,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:38:05,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:38:05,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:38:05,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:38:05,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05" (1/1) ... [2023-08-31 23:38:05,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05" (1/1) ... [2023-08-31 23:38:06,008 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-08-31 23:38:06,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:38:06,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:38:06,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:38:06,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:38:06,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05" (1/1) ... [2023-08-31 23:38:06,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05" (1/1) ... [2023-08-31 23:38:06,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05" (1/1) ... [2023-08-31 23:38:06,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05" (1/1) ... [2023-08-31 23:38:06,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05" (1/1) ... [2023-08-31 23:38:06,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05" (1/1) ... [2023-08-31 23:38:06,034 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05" (1/1) ... [2023-08-31 23:38:06,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05" (1/1) ... [2023-08-31 23:38:06,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:38:06,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:38:06,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:38:06,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:38:06,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05" (1/1) ... [2023-08-31 23:38:06,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:38:06,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:38:06,094 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-31 23:38:06,105 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-31 23:38:06,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:38:06,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:38:06,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:38:06,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:38:06,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:38:06,136 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:38:06,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:38:06,137 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:38:06,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:38:06,137 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:38:06,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:38:06,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:38:06,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:38:06,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:38:06,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:38:06,139 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:38:06,309 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:38:06,310 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:38:06,655 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:38:06,796 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:38:06,797 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:38:06,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:38:06 BoogieIcfgContainer [2023-08-31 23:38:06,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:38:06,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:38:06,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:38:06,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:38:06,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:38:05" (1/3) ... [2023-08-31 23:38:06,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a89f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:38:06, skipping insertion in model container [2023-08-31 23:38:06,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:05" (2/3) ... [2023-08-31 23:38:06,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a89f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:38:06, skipping insertion in model container [2023-08-31 23:38:06,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:38:06" (3/3) ... [2023-08-31 23:38:06,808 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:38:06,823 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:38:06,824 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:38:06,824 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:38:06,878 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:38:06,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2023-08-31 23:38:06,972 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-08-31 23:38:06,972 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:38:06,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:38:06,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2023-08-31 23:38:06,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-08-31 23:38:06,984 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:38:06,992 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-08-31 23:38:06,994 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-08-31 23:38:06,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-08-31 23:38:07,016 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-08-31 23:38:07,016 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:38:07,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:38:07,019 INFO L119 LiptonReduction]: Number of co-enabled transitions 2032 [2023-08-31 23:38:11,925 INFO L134 LiptonReduction]: Checked pairs total: 4845 [2023-08-31 23:38:11,926 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-31 23:38:11,938 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:38:11,944 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;@34816f38, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:38:11,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:38:11,946 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:38:11,946 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:38:11,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:11,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:38:11,947 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:11,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:11,957 INFO L85 PathProgramCache]: Analyzing trace with hash 502, now seen corresponding path program 1 times [2023-08-31 23:38:11,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:11,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310760094] [2023-08-31 23:38:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:11,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:12,057 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-31 23:38:12,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:12,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310760094] [2023-08-31 23:38:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310760094] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:12,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:12,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:38:12,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357679250] [2023-08-31 23:38:12,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:12,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:38:12,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:12,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:38:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:38:12,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 222 [2023-08-31 23:38:12,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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-31 23:38:12,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:12,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 222 [2023-08-31 23:38:12,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:12,493 INFO L130 PetriNetUnfolder]: 1095/1657 cut-off events. [2023-08-31 23:38:12,494 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-31 23:38:12,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3340 conditions, 1657 events. 1095/1657 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7518 event pairs, 1095 based on Foata normal form. 0/1365 useless extension candidates. Maximal degree in co-relation 3329. Up to 1627 conditions per place. [2023-08-31 23:38:12,510 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 21 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-31 23:38:12,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 97 flow [2023-08-31 23:38:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:38:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:38:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 231 transitions. [2023-08-31 23:38:12,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2023-08-31 23:38:12,526 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 231 transitions. [2023-08-31 23:38:12,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 231 transitions. [2023-08-31 23:38:12,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:12,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 231 transitions. [2023-08-31 23:38:12,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 115.5) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 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-31 23:38:12,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 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-31 23:38:12,540 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 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-31 23:38:12,541 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 67 flow. Second operand 2 states and 231 transitions. [2023-08-31 23:38:12,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 97 flow [2023-08-31 23:38:12,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:38:12,546 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-08-31 23:38:12,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-31 23:38:12,551 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-08-31 23:38:12,552 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-08-31 23:38:12,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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-31 23:38:12,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:12,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:38:12,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:38:12,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:12,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:12,565 INFO L85 PathProgramCache]: Analyzing trace with hash 493236, now seen corresponding path program 1 times [2023-08-31 23:38:12,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:12,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772745209] [2023-08-31 23:38:12,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:12,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:12,854 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-31 23:38:12,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:12,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772745209] [2023-08-31 23:38:12,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772745209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:12,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:12,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:38:12,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461326923] [2023-08-31 23:38:12,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:12,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:38:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:12,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:38:12,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:38:12,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 222 [2023-08-31 23:38:12,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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-31 23:38:12,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:12,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 222 [2023-08-31 23:38:12,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:13,114 INFO L130 PetriNetUnfolder]: 855/1392 cut-off events. [2023-08-31 23:38:13,116 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:38:13,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 1392 events. 855/1392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7192 event pairs, 135 based on Foata normal form. 0/1259 useless extension candidates. Maximal degree in co-relation 2714. Up to 1039 conditions per place. [2023-08-31 23:38:13,122 INFO L137 encePairwiseOnDemand]: 219/222 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-31 23:38:13,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 154 flow [2023-08-31 23:38:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:38:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:38:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-08-31 23:38:13,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509009009009009 [2023-08-31 23:38:13,126 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-08-31 23:38:13,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-08-31 23:38:13,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:13,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-08-31 23:38:13,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-31 23:38:13,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 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-31 23:38:13,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 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-31 23:38:13,131 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 339 transitions. [2023-08-31 23:38:13,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 154 flow [2023-08-31 23:38:13,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:38:13,133 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-31 23:38:13,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-31 23:38:13,134 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-31 23:38:13,134 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-31 23:38:13,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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-31 23:38:13,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:13,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:13,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:38:13,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:13,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1417657759, now seen corresponding path program 1 times [2023-08-31 23:38:13,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:13,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030542167] [2023-08-31 23:38:13,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:14,377 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-31 23:38:14,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:14,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030542167] [2023-08-31 23:38:14,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030542167] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:14,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:38:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596235464] [2023-08-31 23:38:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:14,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:38:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:38:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:38:14,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-31 23:38:14,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 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-31 23:38:14,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:14,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-31 23:38:14,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:14,701 INFO L130 PetriNetUnfolder]: 1037/1656 cut-off events. [2023-08-31 23:38:14,701 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2023-08-31 23:38:14,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3387 conditions, 1656 events. 1037/1656 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7899 event pairs, 215 based on Foata normal form. 0/1596 useless extension candidates. Maximal degree in co-relation 3383. Up to 1040 conditions per place. [2023-08-31 23:38:14,709 INFO L137 encePairwiseOnDemand]: 211/222 looper letters, 32 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2023-08-31 23:38:14,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 43 transitions, 184 flow [2023-08-31 23:38:14,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:38:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:38:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2023-08-31 23:38:14,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2023-08-31 23:38:14,712 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2023-08-31 23:38:14,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2023-08-31 23:38:14,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:14,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2023-08-31 23:38:14,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 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-31 23:38:14,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 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-31 23:38:14,716 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 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-31 23:38:14,716 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 4 states and 416 transitions. [2023-08-31 23:38:14,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 43 transitions, 184 flow [2023-08-31 23:38:14,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:38:14,718 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 124 flow [2023-08-31 23:38:14,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2023-08-31 23:38:14,718 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2023-08-31 23:38:14,719 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 124 flow [2023-08-31 23:38:14,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 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-31 23:38:14,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:14,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:14,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:38:14,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:14,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1417657742, now seen corresponding path program 1 times [2023-08-31 23:38:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:14,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34281651] [2023-08-31 23:38:14,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:15,076 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-31 23:38:15,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:15,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34281651] [2023-08-31 23:38:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34281651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:15,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:15,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:38:15,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111568084] [2023-08-31 23:38:15,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:15,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:38:15,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:15,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:38:15,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:38:15,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 222 [2023-08-31 23:38:15,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 0 states have call successors, (0), 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-31 23:38:15,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:15,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 222 [2023-08-31 23:38:15,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:15,412 INFO L130 PetriNetUnfolder]: 695/1069 cut-off events. [2023-08-31 23:38:15,413 INFO L131 PetriNetUnfolder]: For 661/685 co-relation queries the response was YES. [2023-08-31 23:38:15,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3088 conditions, 1069 events. 695/1069 cut-off events. For 661/685 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4619 event pairs, 160 based on Foata normal form. 104/1125 useless extension candidates. Maximal degree in co-relation 3082. Up to 984 conditions per place. [2023-08-31 23:38:15,419 INFO L137 encePairwiseOnDemand]: 218/222 looper letters, 29 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-08-31 23:38:15,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 202 flow [2023-08-31 23:38:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:38:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:38:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2023-08-31 23:38:15,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41711711711711713 [2023-08-31 23:38:15,421 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 463 transitions. [2023-08-31 23:38:15,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 463 transitions. [2023-08-31 23:38:15,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:15,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 463 transitions. [2023-08-31 23:38:15,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 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-31 23:38:15,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 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-31 23:38:15,426 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 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-31 23:38:15,426 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 124 flow. Second operand 5 states and 463 transitions. [2023-08-31 23:38:15,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 202 flow [2023-08-31 23:38:15,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:38:15,429 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 112 flow [2023-08-31 23:38:15,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2023-08-31 23:38:15,430 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2023-08-31 23:38:15,430 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 112 flow [2023-08-31 23:38:15,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 0 states have call successors, (0), 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-31 23:38:15,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:15,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:15,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:38:15,431 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:15,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:15,432 INFO L85 PathProgramCache]: Analyzing trace with hash -998342817, now seen corresponding path program 1 times [2023-08-31 23:38:15,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:15,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802619167] [2023-08-31 23:38:15,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:15,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:16,347 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-31 23:38:16,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:16,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802619167] [2023-08-31 23:38:16,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802619167] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:16,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:16,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:38:16,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667675125] [2023-08-31 23:38:16,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:16,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:38:16,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:16,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:38:16,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:38:16,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-31 23:38:16,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 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-31 23:38:16,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:16,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-31 23:38:16,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:16,646 INFO L130 PetriNetUnfolder]: 1092/1725 cut-off events. [2023-08-31 23:38:16,646 INFO L131 PetriNetUnfolder]: For 781/787 co-relation queries the response was YES. [2023-08-31 23:38:16,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4863 conditions, 1725 events. 1092/1725 cut-off events. For 781/787 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8594 event pairs, 173 based on Foata normal form. 60/1783 useless extension candidates. Maximal degree in co-relation 4856. Up to 897 conditions per place. [2023-08-31 23:38:16,655 INFO L137 encePairwiseOnDemand]: 213/222 looper letters, 35 selfloop transitions, 9 changer transitions 12/57 dead transitions. [2023-08-31 23:38:16,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 57 transitions, 343 flow [2023-08-31 23:38:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:38:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:38:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2023-08-31 23:38:16,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2023-08-31 23:38:16,658 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2023-08-31 23:38:16,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2023-08-31 23:38:16,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:16,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2023-08-31 23:38:16,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 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-31 23:38:16,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 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-31 23:38:16,662 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 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-31 23:38:16,662 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 112 flow. Second operand 5 states and 516 transitions. [2023-08-31 23:38:16,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 57 transitions, 343 flow [2023-08-31 23:38:16,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 335 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:38:16,665 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 141 flow [2023-08-31 23:38:16,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-31 23:38:16,666 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-31 23:38:16,667 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 141 flow [2023-08-31 23:38:16,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 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-31 23:38:16,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:16,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:16,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:38:16,668 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:16,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:16,668 INFO L85 PathProgramCache]: Analyzing trace with hash -864537529, now seen corresponding path program 1 times [2023-08-31 23:38:16,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:16,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156230230] [2023-08-31 23:38:16,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:17,593 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-31 23:38:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156230230] [2023-08-31 23:38:17,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156230230] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:17,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:17,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:38:17,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137729029] [2023-08-31 23:38:17,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:17,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:38:17,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:17,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:38:17,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:38:17,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 222 [2023-08-31 23:38:17,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 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-31 23:38:17,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:17,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 222 [2023-08-31 23:38:17,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:17,896 INFO L130 PetriNetUnfolder]: 906/1373 cut-off events. [2023-08-31 23:38:17,896 INFO L131 PetriNetUnfolder]: For 1264/1264 co-relation queries the response was YES. [2023-08-31 23:38:17,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4449 conditions, 1373 events. 906/1373 cut-off events. For 1264/1264 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5556 event pairs, 279 based on Foata normal form. 6/1379 useless extension candidates. Maximal degree in co-relation 4440. Up to 1162 conditions per place. [2023-08-31 23:38:17,904 INFO L137 encePairwiseOnDemand]: 211/222 looper letters, 37 selfloop transitions, 17 changer transitions 0/54 dead transitions. [2023-08-31 23:38:17,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 351 flow [2023-08-31 23:38:17,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:38:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:38:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2023-08-31 23:38:17,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46959459459459457 [2023-08-31 23:38:17,907 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 417 transitions. [2023-08-31 23:38:17,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 417 transitions. [2023-08-31 23:38:17,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:17,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 417 transitions. [2023-08-31 23:38:17,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 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-31 23:38:17,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 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-31 23:38:17,910 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 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-31 23:38:17,910 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 141 flow. Second operand 4 states and 417 transitions. [2023-08-31 23:38:17,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 351 flow [2023-08-31 23:38:17,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 327 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-31 23:38:17,914 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 232 flow [2023-08-31 23:38:17,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-08-31 23:38:17,915 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-31 23:38:17,916 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 232 flow [2023-08-31 23:38:17,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 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-31 23:38:17,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:17,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:17,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:38:17,917 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:17,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:17,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1030231386, now seen corresponding path program 1 times [2023-08-31 23:38:17,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:17,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656309787] [2023-08-31 23:38:17,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:17,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:18,631 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-31 23:38:18,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:18,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656309787] [2023-08-31 23:38:18,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656309787] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:18,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:18,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:38:18,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765150226] [2023-08-31 23:38:18,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:18,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:38:18,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:18,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:38:18,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:38:18,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-31 23:38:18,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 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-31 23:38:18,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:18,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-31 23:38:18,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:18,918 INFO L130 PetriNetUnfolder]: 973/1585 cut-off events. [2023-08-31 23:38:18,919 INFO L131 PetriNetUnfolder]: For 2710/2806 co-relation queries the response was YES. [2023-08-31 23:38:18,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5763 conditions, 1585 events. 973/1585 cut-off events. For 2710/2806 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7736 event pairs, 264 based on Foata normal form. 48/1621 useless extension candidates. Maximal degree in co-relation 5753. Up to 808 conditions per place. [2023-08-31 23:38:18,926 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 46 selfloop transitions, 8 changer transitions 3/59 dead transitions. [2023-08-31 23:38:18,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 448 flow [2023-08-31 23:38:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:38:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:38:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2023-08-31 23:38:18,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2023-08-31 23:38:18,928 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2023-08-31 23:38:18,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2023-08-31 23:38:18,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:18,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2023-08-31 23:38:18,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 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-31 23:38:18,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 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-31 23:38:18,931 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 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-31 23:38:18,932 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 232 flow. Second operand 4 states and 414 transitions. [2023-08-31 23:38:18,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 448 flow [2023-08-31 23:38:18,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 446 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-31 23:38:18,937 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 264 flow [2023-08-31 23:38:18,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=264, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-31 23:38:18,937 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2023-08-31 23:38:18,938 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 264 flow [2023-08-31 23:38:18,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 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-31 23:38:18,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:18,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:18,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:38:18,939 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:18,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:18,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1080729394, now seen corresponding path program 1 times [2023-08-31 23:38:18,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:18,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754249530] [2023-08-31 23:38:18,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:18,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:19,373 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-31 23:38:19,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:19,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754249530] [2023-08-31 23:38:19,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754249530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:19,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:19,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:38:19,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124189405] [2023-08-31 23:38:19,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:19,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:38:19,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:19,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:38:19,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:38:19,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 222 [2023-08-31 23:38:19,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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-31 23:38:19,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:19,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 222 [2023-08-31 23:38:19,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:19,628 INFO L130 PetriNetUnfolder]: 979/1549 cut-off events. [2023-08-31 23:38:19,628 INFO L131 PetriNetUnfolder]: For 3034/3081 co-relation queries the response was YES. [2023-08-31 23:38:19,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5931 conditions, 1549 events. 979/1549 cut-off events. For 3034/3081 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7101 event pairs, 334 based on Foata normal form. 51/1597 useless extension candidates. Maximal degree in co-relation 5918. Up to 1353 conditions per place. [2023-08-31 23:38:19,638 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 50 selfloop transitions, 8 changer transitions 2/62 dead transitions. [2023-08-31 23:38:19,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 517 flow [2023-08-31 23:38:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:38:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:38:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-08-31 23:38:19,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2023-08-31 23:38:19,640 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-08-31 23:38:19,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-08-31 23:38:19,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:19,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-08-31 23:38:19,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 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-31 23:38:19,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 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-31 23:38:19,643 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 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-31 23:38:19,643 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 264 flow. Second operand 4 states and 440 transitions. [2023-08-31 23:38:19,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 517 flow [2023-08-31 23:38:19,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 485 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-31 23:38:19,648 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 289 flow [2023-08-31 23:38:19,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=289, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-31 23:38:19,648 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2023-08-31 23:38:19,649 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 289 flow [2023-08-31 23:38:19,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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-31 23:38:19,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:19,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:19,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:38:19,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:19,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash 457812626, now seen corresponding path program 1 times [2023-08-31 23:38:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:19,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081179247] [2023-08-31 23:38:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:19,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:20,069 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-31 23:38:20,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:20,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081179247] [2023-08-31 23:38:20,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081179247] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:20,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:20,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:38:20,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418472889] [2023-08-31 23:38:20,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:20,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:38:20,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:20,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:38:20,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:38:20,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 222 [2023-08-31 23:38:20,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 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-31 23:38:20,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:20,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 222 [2023-08-31 23:38:20,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:20,331 INFO L130 PetriNetUnfolder]: 920/1472 cut-off events. [2023-08-31 23:38:20,332 INFO L131 PetriNetUnfolder]: For 3337/3375 co-relation queries the response was YES. [2023-08-31 23:38:20,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5962 conditions, 1472 events. 920/1472 cut-off events. For 3337/3375 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6724 event pairs, 442 based on Foata normal form. 38/1510 useless extension candidates. Maximal degree in co-relation 5948. Up to 1297 conditions per place. [2023-08-31 23:38:20,341 INFO L137 encePairwiseOnDemand]: 218/222 looper letters, 49 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2023-08-31 23:38:20,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 483 flow [2023-08-31 23:38:20,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:38:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:38:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2023-08-31 23:38:20,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49324324324324326 [2023-08-31 23:38:20,344 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 438 transitions. [2023-08-31 23:38:20,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 438 transitions. [2023-08-31 23:38:20,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:20,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 438 transitions. [2023-08-31 23:38:20,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 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-31 23:38:20,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 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-31 23:38:20,347 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 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-31 23:38:20,347 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 289 flow. Second operand 4 states and 438 transitions. [2023-08-31 23:38:20,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 483 flow [2023-08-31 23:38:20,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 464 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-31 23:38:20,352 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 288 flow [2023-08-31 23:38:20,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-31 23:38:20,353 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2023-08-31 23:38:20,353 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 288 flow [2023-08-31 23:38:20,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 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-31 23:38:20,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:20,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:20,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:38:20,354 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:20,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:20,355 INFO L85 PathProgramCache]: Analyzing trace with hash 855559165, now seen corresponding path program 1 times [2023-08-31 23:38:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:20,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982586980] [2023-08-31 23:38:20,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:20,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:21,124 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-31 23:38:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982586980] [2023-08-31 23:38:21,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982586980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:21,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:21,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:38:21,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722004759] [2023-08-31 23:38:21,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:21,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:38:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:21,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:38:21,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:38:21,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 222 [2023-08-31 23:38:21,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 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-31 23:38:21,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:21,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 222 [2023-08-31 23:38:21,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:21,446 INFO L130 PetriNetUnfolder]: 952/1516 cut-off events. [2023-08-31 23:38:21,446 INFO L131 PetriNetUnfolder]: For 3512/3550 co-relation queries the response was YES. [2023-08-31 23:38:21,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6180 conditions, 1516 events. 952/1516 cut-off events. For 3512/3550 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6944 event pairs, 254 based on Foata normal form. 48/1558 useless extension candidates. Maximal degree in co-relation 6166. Up to 1224 conditions per place. [2023-08-31 23:38:21,462 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 55 selfloop transitions, 18 changer transitions 4/79 dead transitions. [2023-08-31 23:38:21,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 678 flow [2023-08-31 23:38:21,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:38:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:38:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2023-08-31 23:38:21,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4873873873873874 [2023-08-31 23:38:21,465 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2023-08-31 23:38:21,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2023-08-31 23:38:21,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:21,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2023-08-31 23:38:21,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 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-31 23:38:21,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 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-31 23:38:21,469 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 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-31 23:38:21,469 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 288 flow. Second operand 5 states and 541 transitions. [2023-08-31 23:38:21,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 678 flow [2023-08-31 23:38:21,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 665 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:38:21,479 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 440 flow [2023-08-31 23:38:21,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=440, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2023-08-31 23:38:21,481 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-08-31 23:38:21,482 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 440 flow [2023-08-31 23:38:21,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 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-31 23:38:21,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:21,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:21,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:38:21,483 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:21,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:21,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1899623195, now seen corresponding path program 1 times [2023-08-31 23:38:21,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:21,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323471463] [2023-08-31 23:38:21,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:21,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:22,316 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-31 23:38:22,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:22,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323471463] [2023-08-31 23:38:22,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323471463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:22,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:22,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:38:22,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693852618] [2023-08-31 23:38:22,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:22,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:38:22,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:22,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:38:22,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:38:22,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 222 [2023-08-31 23:38:22,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 440 flow. Second operand has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 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-31 23:38:22,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:22,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 222 [2023-08-31 23:38:22,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:22,726 INFO L130 PetriNetUnfolder]: 990/1570 cut-off events. [2023-08-31 23:38:22,726 INFO L131 PetriNetUnfolder]: For 4986/4986 co-relation queries the response was YES. [2023-08-31 23:38:22,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7105 conditions, 1570 events. 990/1570 cut-off events. For 4986/4986 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7107 event pairs, 399 based on Foata normal form. 3/1573 useless extension candidates. Maximal degree in co-relation 7088. Up to 1264 conditions per place. [2023-08-31 23:38:22,742 INFO L137 encePairwiseOnDemand]: 211/222 looper letters, 55 selfloop transitions, 27 changer transitions 4/86 dead transitions. [2023-08-31 23:38:22,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 808 flow [2023-08-31 23:38:22,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:38:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:38:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions. [2023-08-31 23:38:22,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4512012012012012 [2023-08-31 23:38:22,746 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 601 transitions. [2023-08-31 23:38:22,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions. [2023-08-31 23:38:22,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:22,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions. [2023-08-31 23:38:22,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 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-31 23:38:22,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 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-31 23:38:22,751 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 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-31 23:38:22,751 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 440 flow. Second operand 6 states and 601 transitions. [2023-08-31 23:38:22,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 808 flow [2023-08-31 23:38:22,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 796 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-31 23:38:22,759 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 581 flow [2023-08-31 23:38:22,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=581, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2023-08-31 23:38:22,760 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 23 predicate places. [2023-08-31 23:38:22,760 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 581 flow [2023-08-31 23:38:22,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 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-31 23:38:22,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:22,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:22,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:38:22,761 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:22,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:22,762 INFO L85 PathProgramCache]: Analyzing trace with hash 221276101, now seen corresponding path program 2 times [2023-08-31 23:38:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:22,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112245154] [2023-08-31 23:38:22,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:22,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:23,135 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-31 23:38:23,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:23,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112245154] [2023-08-31 23:38:23,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112245154] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:23,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:23,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:38:23,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028186399] [2023-08-31 23:38:23,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:23,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:38:23,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:23,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:38:23,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:38:23,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 222 [2023-08-31 23:38:23,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 581 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 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-31 23:38:23,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:23,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 222 [2023-08-31 23:38:23,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:23,483 INFO L130 PetriNetUnfolder]: 945/1537 cut-off events. [2023-08-31 23:38:23,483 INFO L131 PetriNetUnfolder]: For 7697/7759 co-relation queries the response was YES. [2023-08-31 23:38:23,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7903 conditions, 1537 events. 945/1537 cut-off events. For 7697/7759 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7312 event pairs, 354 based on Foata normal form. 73/1604 useless extension candidates. Maximal degree in co-relation 7884. Up to 1123 conditions per place. [2023-08-31 23:38:23,492 INFO L137 encePairwiseOnDemand]: 214/222 looper letters, 60 selfloop transitions, 30 changer transitions 7/100 dead transitions. [2023-08-31 23:38:23,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 1100 flow [2023-08-31 23:38:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:38:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:38:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions. [2023-08-31 23:38:23,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4872372372372372 [2023-08-31 23:38:23,496 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 649 transitions. [2023-08-31 23:38:23,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 649 transitions. [2023-08-31 23:38:23,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:23,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 649 transitions. [2023-08-31 23:38:23,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 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-31 23:38:23,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 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-31 23:38:23,500 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 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-31 23:38:23,500 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 581 flow. Second operand 6 states and 649 transitions. [2023-08-31 23:38:23,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 1100 flow [2023-08-31 23:38:23,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 100 transitions, 1082 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-08-31 23:38:23,512 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 789 flow [2023-08-31 23:38:23,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=789, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2023-08-31 23:38:23,514 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2023-08-31 23:38:23,515 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 789 flow [2023-08-31 23:38:23,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 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-31 23:38:23,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:23,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:23,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:38:23,516 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:23,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:23,516 INFO L85 PathProgramCache]: Analyzing trace with hash -169966833, now seen corresponding path program 1 times [2023-08-31 23:38:23,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:23,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937149137] [2023-08-31 23:38:23,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:23,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:23,803 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-31 23:38:23,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:23,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937149137] [2023-08-31 23:38:23,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937149137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:23,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:23,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:38:23,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260623604] [2023-08-31 23:38:23,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:23,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:38:23,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:23,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:38:23,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:38:23,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-31 23:38:23,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 789 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 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-31 23:38:23,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:23,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-31 23:38:23,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:24,070 INFO L130 PetriNetUnfolder]: 663/1196 cut-off events. [2023-08-31 23:38:24,070 INFO L131 PetriNetUnfolder]: For 10551/10696 co-relation queries the response was YES. [2023-08-31 23:38:24,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6509 conditions, 1196 events. 663/1196 cut-off events. For 10551/10696 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6406 event pairs, 100 based on Foata normal form. 235/1422 useless extension candidates. Maximal degree in co-relation 6487. Up to 581 conditions per place. [2023-08-31 23:38:24,077 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 85 selfloop transitions, 5 changer transitions 9/107 dead transitions. [2023-08-31 23:38:24,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 107 transitions, 1444 flow [2023-08-31 23:38:24,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:38:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:38:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2023-08-31 23:38:24,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48085585585585583 [2023-08-31 23:38:24,079 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 427 transitions. [2023-08-31 23:38:24,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 427 transitions. [2023-08-31 23:38:24,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:24,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 427 transitions. [2023-08-31 23:38:24,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 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-31 23:38:24,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 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-31 23:38:24,082 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 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-31 23:38:24,082 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 789 flow. Second operand 4 states and 427 transitions. [2023-08-31 23:38:24,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 107 transitions, 1444 flow [2023-08-31 23:38:24,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 1393 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-31 23:38:24,096 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 704 flow [2023-08-31 23:38:24,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=704, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-08-31 23:38:24,097 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2023-08-31 23:38:24,098 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 704 flow [2023-08-31 23:38:24,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 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-31 23:38:24,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:24,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:24,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:38:24,099 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:24,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1397370602, now seen corresponding path program 1 times [2023-08-31 23:38:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994760098] [2023-08-31 23:38:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:24,353 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-31 23:38:24,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:24,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994760098] [2023-08-31 23:38:24,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994760098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:24,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:24,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:38:24,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429582119] [2023-08-31 23:38:24,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:24,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:38:24,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:24,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:38:24,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:38:24,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-31 23:38:24,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 704 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-31 23:38:24,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:24,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-31 23:38:24,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:24,565 INFO L130 PetriNetUnfolder]: 334/651 cut-off events. [2023-08-31 23:38:24,565 INFO L131 PetriNetUnfolder]: For 6137/6188 co-relation queries the response was YES. [2023-08-31 23:38:24,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3796 conditions, 651 events. 334/651 cut-off events. For 6137/6188 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3135 event pairs, 45 based on Foata normal form. 120/767 useless extension candidates. Maximal degree in co-relation 3771. Up to 289 conditions per place. [2023-08-31 23:38:24,569 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 76 selfloop transitions, 8 changer transitions 11/103 dead transitions. [2023-08-31 23:38:24,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 103 transitions, 1313 flow [2023-08-31 23:38:24,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:38:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:38:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-08-31 23:38:24,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2023-08-31 23:38:24,572 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-08-31 23:38:24,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-08-31 23:38:24,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:24,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-08-31 23:38:24,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 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-31 23:38:24,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 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-31 23:38:24,576 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 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-31 23:38:24,576 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 704 flow. Second operand 5 states and 534 transitions. [2023-08-31 23:38:24,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 103 transitions, 1313 flow [2023-08-31 23:38:24,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 103 transitions, 1271 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-31 23:38:24,585 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 631 flow [2023-08-31 23:38:24,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=631, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2023-08-31 23:38:24,585 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2023-08-31 23:38:24,586 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 631 flow [2023-08-31 23:38:24,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-31 23:38:24,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:24,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:24,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:38:24,587 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:24,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:24,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1059031841, now seen corresponding path program 1 times [2023-08-31 23:38:24,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:24,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485090568] [2023-08-31 23:38:24,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:24,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:24,889 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-31 23:38:24,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:24,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485090568] [2023-08-31 23:38:24,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485090568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:24,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:24,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:38:24,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978292299] [2023-08-31 23:38:24,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:24,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:38:24,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:24,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:38:24,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:38:24,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-31 23:38:24,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 631 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 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-31 23:38:24,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:24,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-31 23:38:24,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:25,088 INFO L130 PetriNetUnfolder]: 202/411 cut-off events. [2023-08-31 23:38:25,089 INFO L131 PetriNetUnfolder]: For 3148/3170 co-relation queries the response was YES. [2023-08-31 23:38:25,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 411 events. 202/411 cut-off events. For 3148/3170 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1797 event pairs, 35 based on Foata normal form. 41/450 useless extension candidates. Maximal degree in co-relation 2461. Up to 172 conditions per place. [2023-08-31 23:38:25,091 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 43 selfloop transitions, 11 changer transitions 31/89 dead transitions. [2023-08-31 23:38:25,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 89 transitions, 1116 flow [2023-08-31 23:38:25,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:38:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:38:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 621 transitions. [2023-08-31 23:38:25,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2023-08-31 23:38:25,095 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 621 transitions. [2023-08-31 23:38:25,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 621 transitions. [2023-08-31 23:38:25,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:25,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 621 transitions. [2023-08-31 23:38:25,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 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-31 23:38:25,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 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-31 23:38:25,099 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 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-31 23:38:25,099 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 631 flow. Second operand 6 states and 621 transitions. [2023-08-31 23:38:25,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 89 transitions, 1116 flow [2023-08-31 23:38:25,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 89 transitions, 1050 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-08-31 23:38:25,111 INFO L231 Difference]: Finished difference. Result has 74 places, 39 transitions, 377 flow [2023-08-31 23:38:25,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=74, PETRI_TRANSITIONS=39} [2023-08-31 23:38:25,112 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2023-08-31 23:38:25,112 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 39 transitions, 377 flow [2023-08-31 23:38:25,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 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-31 23:38:25,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:25,112 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] [2023-08-31 23:38:25,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:38:25,113 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:25,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:25,113 INFO L85 PathProgramCache]: Analyzing trace with hash 495273293, now seen corresponding path program 1 times [2023-08-31 23:38:25,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:25,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471508065] [2023-08-31 23:38:25,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:25,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:25,812 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-31 23:38:25,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:25,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471508065] [2023-08-31 23:38:25,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471508065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:25,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:25,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:38:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598817172] [2023-08-31 23:38:25,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:25,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:38:25,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:38:25,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:38:25,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-31 23:38:25,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 39 transitions, 377 flow. Second operand has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 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-31 23:38:25,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:25,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-31 23:38:25,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:25,976 INFO L130 PetriNetUnfolder]: 145/281 cut-off events. [2023-08-31 23:38:25,977 INFO L131 PetriNetUnfolder]: For 1427/1427 co-relation queries the response was YES. [2023-08-31 23:38:25,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1625 conditions, 281 events. 145/281 cut-off events. For 1427/1427 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 958 event pairs, 18 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 1601. Up to 185 conditions per place. [2023-08-31 23:38:25,979 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 44 selfloop transitions, 12 changer transitions 6/63 dead transitions. [2023-08-31 23:38:25,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 63 transitions, 679 flow [2023-08-31 23:38:25,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:38:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:38:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-08-31 23:38:25,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46756756756756757 [2023-08-31 23:38:25,981 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-08-31 23:38:25,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-08-31 23:38:25,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:25,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-08-31 23:38:25,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 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-31 23:38:25,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 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-31 23:38:25,985 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 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-31 23:38:25,985 INFO L175 Difference]: Start difference. First operand has 74 places, 39 transitions, 377 flow. Second operand 5 states and 519 transitions. [2023-08-31 23:38:25,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 63 transitions, 679 flow [2023-08-31 23:38:25,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 461 flow, removed 50 selfloop flow, removed 23 redundant places. [2023-08-31 23:38:25,990 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 285 flow [2023-08-31 23:38:25,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-31 23:38:25,991 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2023-08-31 23:38:25,991 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 285 flow [2023-08-31 23:38:25,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 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-31 23:38:25,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:25,992 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] [2023-08-31 23:38:25,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:38:25,992 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:25,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash -959368807, now seen corresponding path program 2 times [2023-08-31 23:38:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:25,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565459195] [2023-08-31 23:38:25,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:26,867 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-31 23:38:26,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:38:26,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565459195] [2023-08-31 23:38:26,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565459195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:26,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:26,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:38:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018503829] [2023-08-31 23:38:26,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:26,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:38:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:38:26,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:38:26,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:38:26,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 222 [2023-08-31 23:38:26,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 285 flow. Second operand has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 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-31 23:38:26,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:26,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 222 [2023-08-31 23:38:26,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:27,108 INFO L130 PetriNetUnfolder]: 145/295 cut-off events. [2023-08-31 23:38:27,108 INFO L131 PetriNetUnfolder]: For 742/742 co-relation queries the response was YES. [2023-08-31 23:38:27,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 295 events. 145/295 cut-off events. For 742/742 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1077 event pairs, 19 based on Foata normal form. 1/296 useless extension candidates. Maximal degree in co-relation 1263. Up to 147 conditions per place. [2023-08-31 23:38:27,110 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 37 selfloop transitions, 12 changer transitions 19/69 dead transitions. [2023-08-31 23:38:27,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 549 flow [2023-08-31 23:38:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:38:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:38:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2023-08-31 23:38:27,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827327327327327 [2023-08-31 23:38:27,113 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2023-08-31 23:38:27,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2023-08-31 23:38:27,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:27,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2023-08-31 23:38:27,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 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-31 23:38:27,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 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-31 23:38:27,118 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 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-31 23:38:27,118 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 285 flow. Second operand 6 states and 643 transitions. [2023-08-31 23:38:27,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 549 flow [2023-08-31 23:38:27,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 536 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-31 23:38:27,121 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 302 flow [2023-08-31 23:38:27,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2023-08-31 23:38:27,123 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2023-08-31 23:38:27,123 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 302 flow [2023-08-31 23:38:27,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 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-31 23:38:27,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:27,124 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] [2023-08-31 23:38:27,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:38:27,124 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:27,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2024044439, now seen corresponding path program 3 times [2023-08-31 23:38:27,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:38:27,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935710373] [2023-08-31 23:38:27,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:27,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:38:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:38:27,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:38:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:38:27,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:38:27,265 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:38:27,265 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:38:27,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:38:27,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:38:27,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:38:27,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:38:27,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:38:27,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:38:27,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:38:27,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:38:27,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:38:27,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:38:27,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:38:27,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:38:27,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:38:27,272 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:27,277 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:38:27,277 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:38:27,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:38:27 BasicIcfg [2023-08-31 23:38:27,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:38:27,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:38:27,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:38:27,353 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:38:27,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:38:06" (3/4) ... [2023-08-31 23:38:27,356 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:38:27,356 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:38:27,357 INFO L158 Benchmark]: Toolchain (without parser) took 21935.56ms. Allocated memory was 67.1MB in the beginning and 501.2MB in the end (delta: 434.1MB). Free memory was 42.8MB in the beginning and 444.6MB in the end (delta: -401.7MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2023-08-31 23:38:27,357 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 67.1MB. Free memory is still 44.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:38:27,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.74ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 42.6MB in the beginning and 53.3MB in the end (delta: -10.7MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2023-08-31 23:38:27,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.23ms. Allocated memory is still 83.9MB. Free memory was 53.3MB in the beginning and 50.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:38:27,358 INFO L158 Benchmark]: Boogie Preprocessor took 29.50ms. Allocated memory is still 83.9MB. Free memory was 50.6MB in the beginning and 48.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:38:27,358 INFO L158 Benchmark]: RCFGBuilder took 759.28ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 45.1MB in the end (delta: 3.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-08-31 23:38:27,358 INFO L158 Benchmark]: TraceAbstraction took 20551.14ms. Allocated memory was 83.9MB in the beginning and 501.2MB in the end (delta: 417.3MB). Free memory was 44.6MB in the beginning and 445.6MB in the end (delta: -401.0MB). Peak memory consumption was 294.4MB. Max. memory is 16.1GB. [2023-08-31 23:38:27,359 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 501.2MB. Free memory was 445.6MB in the beginning and 444.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:38:27,360 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.18ms. Allocated memory is still 67.1MB. Free memory is still 44.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.74ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 42.6MB in the beginning and 53.3MB in the end (delta: -10.7MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.23ms. Allocated memory is still 83.9MB. Free memory was 53.3MB in the beginning and 50.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.50ms. Allocated memory is still 83.9MB. Free memory was 50.6MB in the beginning and 48.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 759.28ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 45.1MB in the end (delta: 3.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 20551.14ms. Allocated memory was 83.9MB in the beginning and 501.2MB in the end (delta: 417.3MB). Free memory was 44.6MB in the beginning and 445.6MB in the end (delta: -401.0MB). Peak memory consumption was 294.4MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 501.2MB. Free memory was 445.6MB in the beginning and 444.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 120 PlacesBefore, 39 PlacesAfterwards, 112 TransitionsBefore, 29 TransitionsAfterwards, 2032 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 4845 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2468, independent: 2321, independent conditional: 0, independent unconditional: 2321, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1111, independent: 1074, independent conditional: 0, independent unconditional: 1074, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2468, independent: 1247, independent conditional: 0, independent unconditional: 1247, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 1111, unknown conditional: 0, unknown unconditional: 1111] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-1, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=0, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=1, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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: 814]: 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 7 procedures, 141 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 760 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1528 IncrementalHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 236 mSolverCounterUnsat, 83 mSDtfsCounter, 1528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=789occurred in iteration=12, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 2913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-31 23:38:27,392 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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 b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:38:29,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:38:29,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:38:29,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:38:29,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:38:29,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:38:29,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:38:29,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:38:29,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:38:29,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:38:29,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:38:29,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:38:29,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:38:29,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:38:29,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:38:29,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:38:29,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:38:29,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:38:29,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:38:29,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:38:29,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:38:29,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:38:29,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:38:29,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:38:29,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:38:29,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:38:29,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:38:29,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:38:29,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:38:29,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:38:29,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:38:29,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:38:29,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:38:29,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:38:29,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:38:29,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:38:29,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:38:29,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:38:29,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:38:29,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:38:29,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:38:29,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:38:29,466 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:38:29,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:38:29,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:38:29,467 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:38:29,468 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:38:29,468 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:38:29,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:38:29,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:38:29,469 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:38:29,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:38:29,470 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:38:29,470 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:38:29,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:38:29,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:38:29,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:38:29,470 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:38:29,470 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:38:29,470 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:38:29,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:38:29,471 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:38:29,471 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:38:29,471 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:38:29,471 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:38:29,471 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:38:29,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:38:29,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:38:29,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:38:29,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:38:29,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:38:29,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:38:29,472 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:38:29,472 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:38:29,473 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:38:29,473 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:38:29,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:38:29,473 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:38:29,473 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:38:29,473 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 -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 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 -> BEFORE [2023-08-31 23:38:29,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:38:29,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:38:29,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:38:29,780 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:38:29,780 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:38:29,781 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:38:30,858 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:38:31,090 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:38:31,090 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:38:31,114 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f02ddb39/4726ba1f851d447c8e6adff1870024f7/FLAG26d2237e7 [2023-08-31 23:38:31,127 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f02ddb39/4726ba1f851d447c8e6adff1870024f7 [2023-08-31 23:38:31,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:38:31,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:38:31,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:38:31,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:38:31,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:38:31,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:38:31" (1/1) ... [2023-08-31 23:38:31,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28dd9537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31, skipping insertion in model container [2023-08-31 23:38:31,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:38:31" (1/1) ... [2023-08-31 23:38:31,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:38:31,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:38:31,327 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-31 23:38:31,519 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:38:31,539 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:38:31,553 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-31 23:38:31,603 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:38:31,643 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:38:31,643 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:38:31,649 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:38:31,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31 WrapperNode [2023-08-31 23:38:31,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:38:31,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:38:31,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:38:31,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:38:31,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31" (1/1) ... [2023-08-31 23:38:31,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31" (1/1) ... [2023-08-31 23:38:31,731 INFO L138 Inliner]: procedures = 179, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-31 23:38:31,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:38:31,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:38:31,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:38:31,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:38:31,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31" (1/1) ... [2023-08-31 23:38:31,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31" (1/1) ... [2023-08-31 23:38:31,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31" (1/1) ... [2023-08-31 23:38:31,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31" (1/1) ... [2023-08-31 23:38:31,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31" (1/1) ... [2023-08-31 23:38:31,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31" (1/1) ... [2023-08-31 23:38:31,777 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31" (1/1) ... [2023-08-31 23:38:31,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31" (1/1) ... [2023-08-31 23:38:31,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:38:31,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:38:31,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:38:31,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:38:31,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31" (1/1) ... [2023-08-31 23:38:31,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:38:31,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:38:31,818 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-31 23:38:31,844 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-31 23:38:31,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:38:31,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:38:31,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:38:31,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:38:31,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:38:31,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:38:31,860 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:38:31,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:38:31,860 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:38:31,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:38:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:38:31,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:38:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:38:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:38:31,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:38:31,862 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:38:32,032 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:38:32,034 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:38:32,401 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:38:32,640 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:38:32,640 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:38:32,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:38:32 BoogieIcfgContainer [2023-08-31 23:38:32,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:38:32,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:38:32,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:38:32,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:38:32,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:38:31" (1/3) ... [2023-08-31 23:38:32,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c7374e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:38:32, skipping insertion in model container [2023-08-31 23:38:32,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:31" (2/3) ... [2023-08-31 23:38:32,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c7374e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:38:32, skipping insertion in model container [2023-08-31 23:38:32,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:38:32" (3/3) ... [2023-08-31 23:38:32,661 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:38:32,676 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:38:32,676 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:38:32,676 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:38:32,748 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:38:32,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2023-08-31 23:38:32,854 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-08-31 23:38:32,854 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:38:32,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:38:32,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2023-08-31 23:38:32,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2023-08-31 23:38:32,870 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:38:32,888 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2023-08-31 23:38:32,896 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2023-08-31 23:38:32,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2023-08-31 23:38:32,932 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-08-31 23:38:32,933 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:38:32,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:38:32,937 INFO L119 LiptonReduction]: Number of co-enabled transitions 2032 [2023-08-31 23:38:39,554 INFO L134 LiptonReduction]: Checked pairs total: 4674 [2023-08-31 23:38:39,555 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-31 23:38:39,567 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:38:39,572 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;@50845737, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:38:39,572 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:38:39,574 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:38:39,574 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:38:39,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:39,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:38:39,575 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:39,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash 509, now seen corresponding path program 1 times [2023-08-31 23:38:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:38:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465327299] [2023-08-31 23:38:39,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:39,590 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-31 23:38:39,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:38:39,601 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-31 23:38:39,606 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-31 23:38:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:39,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:38:39,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:38:39,678 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-31 23:38:39,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:38:39,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:38:39,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465327299] [2023-08-31 23:38:39,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465327299] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:39,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:39,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:38:39,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499793182] [2023-08-31 23:38:39,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:39,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:38:39,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:38:39,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:38:39,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:38:39,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 229 [2023-08-31 23:38:39,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 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-31 23:38:39,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:39,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 229 [2023-08-31 23:38:39,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:40,144 INFO L130 PetriNetUnfolder]: 1095/1643 cut-off events. [2023-08-31 23:38:40,145 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-31 23:38:40,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3326 conditions, 1643 events. 1095/1643 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7395 event pairs, 1095 based on Foata normal form. 0/1356 useless extension candidates. Maximal degree in co-relation 3315. Up to 1627 conditions per place. [2023-08-31 23:38:40,156 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 21 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-31 23:38:40,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 97 flow [2023-08-31 23:38:40,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:38:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:38:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2023-08-31 23:38:40,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087336244541485 [2023-08-31 23:38:40,168 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 233 transitions. [2023-08-31 23:38:40,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 233 transitions. [2023-08-31 23:38:40,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:40,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 233 transitions. [2023-08-31 23:38:40,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 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-31 23:38:40,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 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-31 23:38:40,190 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 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-31 23:38:40,191 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 67 flow. Second operand 2 states and 233 transitions. [2023-08-31 23:38:40,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 97 flow [2023-08-31 23:38:40,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:38:40,195 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-08-31 23:38:40,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-31 23:38:40,199 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-08-31 23:38:40,199 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-08-31 23:38:40,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 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-31 23:38:40,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:40,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:38:40,214 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-31 23:38:40,414 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-31 23:38:40,414 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:40,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:40,415 INFO L85 PathProgramCache]: Analyzing trace with hash 501832, now seen corresponding path program 1 times [2023-08-31 23:38:40,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:38:40,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357732574] [2023-08-31 23:38:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:40,416 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-31 23:38:40,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:38:40,417 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-31 23:38:40,420 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-31 23:38:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:40,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:38:40,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:38:40,501 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-31 23:38:40,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:38:40,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:38:40,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357732574] [2023-08-31 23:38:40,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357732574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:40,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:40,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:38:40,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313954804] [2023-08-31 23:38:40,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:40,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:38:40,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:38:40,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:38:40,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:38:40,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 229 [2023-08-31 23:38:40,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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-31 23:38:40,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:40,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 229 [2023-08-31 23:38:40,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:40,763 INFO L130 PetriNetUnfolder]: 855/1341 cut-off events. [2023-08-31 23:38:40,764 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:38:40,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 1341 events. 855/1341 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6255 event pairs, 231 based on Foata normal form. 0/1209 useless extension candidates. Maximal degree in co-relation 2663. Up to 1039 conditions per place. [2023-08-31 23:38:40,769 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-31 23:38:40,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 154 flow [2023-08-31 23:38:40,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:38:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:38:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-31 23:38:40,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978165938864629 [2023-08-31 23:38:40,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-31 23:38:40,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-31 23:38:40,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:40,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-31 23:38:40,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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-31 23:38:40,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 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-31 23:38:40,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 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-31 23:38:40,778 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 342 transitions. [2023-08-31 23:38:40,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 154 flow [2023-08-31 23:38:40,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:38:40,779 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-31 23:38:40,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-31 23:38:40,780 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-31 23:38:40,780 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-31 23:38:40,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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-31 23:38:40,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:40,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:40,793 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-31 23:38:40,989 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-31 23:38:40,990 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:40,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash -176832908, now seen corresponding path program 1 times [2023-08-31 23:38:40,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:38:40,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844920458] [2023-08-31 23:38:40,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:40,992 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-31 23:38:40,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:38:40,994 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-31 23:38:41,020 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-31 23:38:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:41,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:38:41,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:38:41,118 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-31 23:38:41,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:38:41,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:38:41,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844920458] [2023-08-31 23:38:41,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844920458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:41,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:41,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:38:41,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441428045] [2023-08-31 23:38:41,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:41,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:38:41,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:38:41,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:38:41,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:38:41,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-08-31 23:38:41,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 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-31 23:38:41,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:41,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-08-31 23:38:41,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:41,330 INFO L130 PetriNetUnfolder]: 494/822 cut-off events. [2023-08-31 23:38:41,331 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-31 23:38:41,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 822 events. 494/822 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3792 event pairs, 112 based on Foata normal form. 64/838 useless extension candidates. Maximal degree in co-relation 1746. Up to 401 conditions per place. [2023-08-31 23:38:41,335 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 36 selfloop transitions, 5 changer transitions 1/44 dead transitions. [2023-08-31 23:38:41,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 190 flow [2023-08-31 23:38:41,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:38:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:38:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2023-08-31 23:38:41,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47161572052401746 [2023-08-31 23:38:41,338 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2023-08-31 23:38:41,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2023-08-31 23:38:41,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:41,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2023-08-31 23:38:41,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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-31 23:38:41,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 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-31 23:38:41,344 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 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-31 23:38:41,345 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 4 states and 432 transitions. [2023-08-31 23:38:41,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 190 flow [2023-08-31 23:38:41,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:38:41,346 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 82 flow [2023-08-31 23:38:41,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-08-31 23:38:41,348 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2023-08-31 23:38:41,348 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 82 flow [2023-08-31 23:38:41,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 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-31 23:38:41,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:41,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:41,363 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-31 23:38:41,558 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-31 23:38:41,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:41,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:41,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1903610676, now seen corresponding path program 1 times [2023-08-31 23:38:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:38:41,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618589389] [2023-08-31 23:38:41,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:41,560 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-31 23:38:41,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:38:41,561 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-31 23:38:41,564 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-31 23:38:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:41,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:38:41,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:38:41,678 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-31 23:38:41,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:38:41,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:38:41,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618589389] [2023-08-31 23:38:41,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618589389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:41,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:41,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:38:41,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955381401] [2023-08-31 23:38:41,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:41,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:38:41,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:38:41,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:38:41,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:38:41,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-08-31 23:38:41,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 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-31 23:38:41,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:41,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-08-31 23:38:41,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:41,875 INFO L130 PetriNetUnfolder]: 224/417 cut-off events. [2023-08-31 23:38:41,875 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2023-08-31 23:38:41,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 417 events. 224/417 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1683 event pairs, 56 based on Foata normal form. 37/442 useless extension candidates. Maximal degree in co-relation 1100. Up to 162 conditions per place. [2023-08-31 23:38:41,878 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 44 selfloop transitions, 8 changer transitions 1/55 dead transitions. [2023-08-31 23:38:41,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 271 flow [2023-08-31 23:38:41,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:38:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:38:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2023-08-31 23:38:41,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47161572052401746 [2023-08-31 23:38:41,880 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2023-08-31 23:38:41,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2023-08-31 23:38:41,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:41,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2023-08-31 23:38:41,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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-31 23:38:41,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 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-31 23:38:41,884 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 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-31 23:38:41,885 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 82 flow. Second operand 5 states and 540 transitions. [2023-08-31 23:38:41,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 271 flow [2023-08-31 23:38:41,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 55 transitions, 261 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:38:41,887 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 122 flow [2023-08-31 23:38:41,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-08-31 23:38:41,888 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-08-31 23:38:41,888 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 122 flow [2023-08-31 23:38:41,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 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-31 23:38:41,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:41,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:41,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-08-31 23:38:42,098 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-31 23:38:42,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:42,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:42,099 INFO L85 PathProgramCache]: Analyzing trace with hash -65893264, now seen corresponding path program 1 times [2023-08-31 23:38:42,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:38:42,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281350442] [2023-08-31 23:38:42,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:42,100 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-31 23:38:42,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:38:42,101 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-31 23:38:42,104 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-31 23:38:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:42,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:38:42,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:38:42,256 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-31 23:38:42,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:38:42,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:38:42,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281350442] [2023-08-31 23:38:42,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281350442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:42,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:42,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:38:42,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666859321] [2023-08-31 23:38:42,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:42,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:38:42,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:38:42,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:38:42,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:38:42,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-08-31 23:38:42,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 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-31 23:38:42,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:42,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-08-31 23:38:42,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:42,478 INFO L130 PetriNetUnfolder]: 143/273 cut-off events. [2023-08-31 23:38:42,478 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2023-08-31 23:38:42,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 273 events. 143/273 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 981 event pairs, 56 based on Foata normal form. 10/280 useless extension candidates. Maximal degree in co-relation 803. Up to 108 conditions per place. [2023-08-31 23:38:42,480 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 32 selfloop transitions, 11 changer transitions 1/46 dead transitions. [2023-08-31 23:38:42,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 258 flow [2023-08-31 23:38:42,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:38:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:38:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2023-08-31 23:38:42,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4570596797671033 [2023-08-31 23:38:42,483 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 628 transitions. [2023-08-31 23:38:42,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 628 transitions. [2023-08-31 23:38:42,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:42,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 628 transitions. [2023-08-31 23:38:42,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 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-31 23:38:42,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 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-31 23:38:42,488 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 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-31 23:38:42,488 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 122 flow. Second operand 6 states and 628 transitions. [2023-08-31 23:38:42,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 258 flow [2023-08-31 23:38:42,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 233 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-31 23:38:42,492 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 136 flow [2023-08-31 23:38:42,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-31 23:38:42,493 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-31 23:38:42,493 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 136 flow [2023-08-31 23:38:42,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 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-31 23:38:42,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:42,494 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] [2023-08-31 23:38:42,503 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-31 23:38:42,703 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-31 23:38:42,703 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:42,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:42,706 INFO L85 PathProgramCache]: Analyzing trace with hash -765908020, now seen corresponding path program 1 times [2023-08-31 23:38:42,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:38:42,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802821503] [2023-08-31 23:38:42,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:42,707 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-31 23:38:42,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:38:42,708 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-31 23:38:42,710 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-31 23:38:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:42,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-31 23:38:42,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:38:43,140 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-31 23:38:43,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:38:43,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:38:43,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802821503] [2023-08-31 23:38:43,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802821503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:43,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:43,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:38:43,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799992350] [2023-08-31 23:38:43,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:43,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:38:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:38:43,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:38:43,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:38:43,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-31 23:38:43,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 136 flow. Second operand has 9 states, 9 states have (on average 100.11111111111111) internal successors, (901), 9 states have internal predecessors, (901), 0 states have call successors, (0), 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-31 23:38:43,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:43,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-31 23:38:43,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:43,415 INFO L130 PetriNetUnfolder]: 188/364 cut-off events. [2023-08-31 23:38:43,416 INFO L131 PetriNetUnfolder]: For 408/408 co-relation queries the response was YES. [2023-08-31 23:38:43,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 364 events. 188/364 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1410 event pairs, 71 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1087. Up to 194 conditions per place. [2023-08-31 23:38:43,418 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 49 selfloop transitions, 6 changer transitions 0/56 dead transitions. [2023-08-31 23:38:43,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 404 flow [2023-08-31 23:38:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:38:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:38:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-08-31 23:38:43,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4646288209606987 [2023-08-31 23:38:43,421 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-08-31 23:38:43,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-08-31 23:38:43,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:43,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-08-31 23:38:43,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 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-31 23:38:43,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 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-31 23:38:43,424 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 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-31 23:38:43,424 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 136 flow. Second operand 5 states and 532 transitions. [2023-08-31 23:38:43,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 404 flow [2023-08-31 23:38:43,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 56 transitions, 275 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-08-31 23:38:43,428 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 110 flow [2023-08-31 23:38:43,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-31 23:38:43,429 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-08-31 23:38:43,429 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 110 flow [2023-08-31 23:38:43,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 100.11111111111111) internal successors, (901), 9 states have internal predecessors, (901), 0 states have call successors, (0), 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-31 23:38:43,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:43,430 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] [2023-08-31 23:38:43,439 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-31 23:38:43,639 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-31 23:38:43,639 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:43,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1975746460, now seen corresponding path program 1 times [2023-08-31 23:38:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:38:43,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913450052] [2023-08-31 23:38:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:38:43,640 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-31 23:38:43,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:38:43,641 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-31 23:38:43,642 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-31 23:38:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:38:43,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-31 23:38:43,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:38:44,082 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-31 23:38:44,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:38:44,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:38:44,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913450052] [2023-08-31 23:38:44,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913450052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:44,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:44,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:38:44,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910226486] [2023-08-31 23:38:44,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:44,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:38:44,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:38:44,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:38:44,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:38:44,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 229 [2023-08-31 23:38:44,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 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-31 23:38:44,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:44,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 229 [2023-08-31 23:38:44,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:44,568 INFO L130 PetriNetUnfolder]: 175/332 cut-off events. [2023-08-31 23:38:44,569 INFO L131 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2023-08-31 23:38:44,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 332 events. 175/332 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1299 event pairs, 22 based on Foata normal form. 2/334 useless extension candidates. Maximal degree in co-relation 945. Up to 275 conditions per place. [2023-08-31 23:38:44,571 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 32 selfloop transitions, 3 changer transitions 2/40 dead transitions. [2023-08-31 23:38:44,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 228 flow [2023-08-31 23:38:44,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:38:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:38:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2023-08-31 23:38:44,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4043668122270742 [2023-08-31 23:38:44,573 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 463 transitions. [2023-08-31 23:38:44,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 463 transitions. [2023-08-31 23:38:44,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:44,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 463 transitions. [2023-08-31 23:38:44,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 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-31 23:38:44,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 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-31 23:38:44,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 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-31 23:38:44,577 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 110 flow. Second operand 5 states and 463 transitions. [2023-08-31 23:38:44,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 228 flow [2023-08-31 23:38:44,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:38:44,579 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 110 flow [2023-08-31 23:38:44,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-31 23:38:44,580 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2023-08-31 23:38:44,580 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 110 flow [2023-08-31 23:38:44,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 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-31 23:38:44,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:44,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] [2023-08-31 23:38:44,597 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-31 23:38:44,790 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-31 23:38:44,790 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:44,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2094004256, now seen corresponding path program 2 times [2023-08-31 23:38:44,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:38:44,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962284030] [2023-08-31 23:38:44,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:38:44,792 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-31 23:38:44,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:38:44,793 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-31 23:38:44,795 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-31 23:38:44,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:38:44,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:38:44,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 23:38:44,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:38:45,255 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-31 23:38:45,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:38:45,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:38:45,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962284030] [2023-08-31 23:38:45,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962284030] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:45,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:45,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:38:45,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282214448] [2023-08-31 23:38:45,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:45,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:38:45,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:38:45,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:38:45,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:38:45,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-31 23:38:45,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 110 flow. Second operand has 9 states, 9 states have (on average 100.11111111111111) internal successors, (901), 9 states have internal predecessors, (901), 0 states have call successors, (0), 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-31 23:38:45,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:45,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-31 23:38:45,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:45,479 INFO L130 PetriNetUnfolder]: 196/384 cut-off events. [2023-08-31 23:38:45,479 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2023-08-31 23:38:45,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 384 events. 196/384 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1525 event pairs, 80 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 1058. Up to 177 conditions per place. [2023-08-31 23:38:45,481 INFO L137 encePairwiseOnDemand]: 224/229 looper letters, 41 selfloop transitions, 6 changer transitions 7/55 dead transitions. [2023-08-31 23:38:45,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 307 flow [2023-08-31 23:38:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:38:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:38:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2023-08-31 23:38:45,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.462882096069869 [2023-08-31 23:38:45,484 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2023-08-31 23:38:45,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2023-08-31 23:38:45,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:45,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2023-08-31 23:38:45,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 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-31 23:38:45,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 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-31 23:38:45,487 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 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-31 23:38:45,487 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 110 flow. Second operand 5 states and 530 transitions. [2023-08-31 23:38:45,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 307 flow [2023-08-31 23:38:45,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 299 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:38:45,489 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 126 flow [2023-08-31 23:38:45,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-31 23:38:45,490 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-31 23:38:45,490 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 126 flow [2023-08-31 23:38:45,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 100.11111111111111) internal successors, (901), 9 states have internal predecessors, (901), 0 states have call successors, (0), 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-31 23:38:45,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:45,491 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] [2023-08-31 23:38:45,507 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-31 23:38:45,700 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-31 23:38:45,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:45,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash 851390534, now seen corresponding path program 3 times [2023-08-31 23:38:45,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:38:45,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795033958] [2023-08-31 23:38:45,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:38:45,702 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-31 23:38:45,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:38:45,703 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-31 23:38:45,705 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-31 23:38:45,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:38:45,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:38:45,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:38:45,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:38:45,816 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-31 23:38:45,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:38:45,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:38:45,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795033958] [2023-08-31 23:38:45,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795033958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:45,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:45,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:38:45,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546479338] [2023-08-31 23:38:45,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:45,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:38:45,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:38:45,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:38:45,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:38:45,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 229 [2023-08-31 23:38:45,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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-31 23:38:45,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:45,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 229 [2023-08-31 23:38:45,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:45,950 INFO L130 PetriNetUnfolder]: 316/604 cut-off events. [2023-08-31 23:38:45,951 INFO L131 PetriNetUnfolder]: For 388/392 co-relation queries the response was YES. [2023-08-31 23:38:45,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 604 events. 316/604 cut-off events. For 388/392 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2832 event pairs, 107 based on Foata normal form. 4/597 useless extension candidates. Maximal degree in co-relation 1784. Up to 334 conditions per place. [2023-08-31 23:38:45,953 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 35 selfloop transitions, 2 changer transitions 12/51 dead transitions. [2023-08-31 23:38:45,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 298 flow [2023-08-31 23:38:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:38:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:38:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-08-31 23:38:45,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861717612809316 [2023-08-31 23:38:45,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-08-31 23:38:45,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-08-31 23:38:45,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:45,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-08-31 23:38:45,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-31 23:38:45,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 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-31 23:38:45,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 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-31 23:38:45,957 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 126 flow. Second operand 3 states and 334 transitions. [2023-08-31 23:38:45,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 298 flow [2023-08-31 23:38:45,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:38:45,961 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 117 flow [2023-08-31 23:38:45,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-31 23:38:45,962 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-31 23:38:45,962 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 117 flow [2023-08-31 23:38:45,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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-31 23:38:45,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:45,963 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] [2023-08-31 23:38:45,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:38:46,172 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-31 23:38:46,172 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:46,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:46,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1871080872, now seen corresponding path program 4 times [2023-08-31 23:38:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:38:46,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288711399] [2023-08-31 23:38:46,173 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:38:46,173 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-31 23:38:46,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:38:46,175 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-31 23:38:46,214 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-31 23:38:46,272 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:38:46,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:38:46,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:38:46,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:38:46,312 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-31 23:38:46,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:38:46,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:38:46,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288711399] [2023-08-31 23:38:46,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288711399] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:38:46,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:38:46,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:38:46,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836572293] [2023-08-31 23:38:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:38:46,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:38:46,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:38:46,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:38:46,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:38:46,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-31 23:38:46,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:38:46,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:38:46,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-31 23:38:46,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:38:46,430 INFO L130 PetriNetUnfolder]: 193/398 cut-off events. [2023-08-31 23:38:46,430 INFO L131 PetriNetUnfolder]: For 251/252 co-relation queries the response was YES. [2023-08-31 23:38:46,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 398 events. 193/398 cut-off events. For 251/252 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1744 event pairs, 61 based on Foata normal form. 2/395 useless extension candidates. Maximal degree in co-relation 1230. Up to 218 conditions per place. [2023-08-31 23:38:46,432 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 29 selfloop transitions, 3 changer transitions 17/50 dead transitions. [2023-08-31 23:38:46,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 289 flow [2023-08-31 23:38:46,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:38:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:38:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2023-08-31 23:38:46,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672489082969432 [2023-08-31 23:38:46,434 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2023-08-31 23:38:46,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2023-08-31 23:38:46,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:38:46,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2023-08-31 23:38:46,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 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-31 23:38:46,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 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-31 23:38:46,438 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 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-31 23:38:46,438 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 117 flow. Second operand 4 states and 428 transitions. [2023-08-31 23:38:46,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 289 flow [2023-08-31 23:38:46,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 270 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-31 23:38:46,440 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 101 flow [2023-08-31 23:38:46,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-31 23:38:46,442 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-31 23:38:46,442 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 101 flow [2023-08-31 23:38:46,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:38:46,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:38:46,443 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] [2023-08-31 23:38:46,452 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-31 23:38:46,652 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-31 23:38:46,652 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:38:46,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:38:46,652 INFO L85 PathProgramCache]: Analyzing trace with hash -323632070, now seen corresponding path program 5 times [2023-08-31 23:38:46,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:38:46,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511234143] [2023-08-31 23:38:46,653 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:38:46,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:38:46,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:38:46,654 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-31 23:38:46,654 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-31 23:38:46,758 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:38:46,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:38:46,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:38:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:38:46,858 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:38:46,858 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:38:46,859 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:38:46,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:38:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:38:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:38:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:38:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:38:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:38:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:38:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:38:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:38:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:38:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:38:46,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:38:46,874 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-31 23:38:47,062 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-31 23:38:47,062 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-08-31 23:38:47,066 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:38:47,066 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:38:47,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:38:47 BasicIcfg [2023-08-31 23:38:47,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:38:47,123 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:38:47,123 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:38:47,123 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:38:47,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:38:32" (3/4) ... [2023-08-31 23:38:47,127 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:38:47,128 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:38:47,128 INFO L158 Benchmark]: Toolchain (without parser) took 15997.88ms. Allocated memory was 58.7MB in the beginning and 163.6MB in the end (delta: 104.9MB). Free memory was 35.2MB in the beginning and 37.4MB in the end (delta: -2.3MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. [2023-08-31 23:38:47,128 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 46.1MB. Free memory was 25.2MB in the beginning and 25.1MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:38:47,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.89ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 35.0MB in the beginning and 39.1MB in the end (delta: -4.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2023-08-31 23:38:47,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.13ms. Allocated memory is still 71.3MB. Free memory was 39.1MB in the beginning and 36.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:38:47,129 INFO L158 Benchmark]: Boogie Preprocessor took 54.22ms. Allocated memory is still 71.3MB. Free memory was 36.2MB in the beginning and 34.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:38:47,129 INFO L158 Benchmark]: RCFGBuilder took 865.72ms. Allocated memory is still 71.3MB. Free memory was 34.1MB in the beginning and 36.7MB in the end (delta: -2.5MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2023-08-31 23:38:47,129 INFO L158 Benchmark]: TraceAbstraction took 14466.79ms. Allocated memory was 71.3MB in the beginning and 163.6MB in the end (delta: 92.3MB). Free memory was 36.3MB in the beginning and 37.4MB in the end (delta: -1.2MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2023-08-31 23:38:47,130 INFO L158 Benchmark]: Witness Printer took 5.02ms. Allocated memory is still 163.6MB. Free memory is still 37.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:38:47,131 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 46.1MB. Free memory was 25.2MB in the beginning and 25.1MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.89ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 35.0MB in the beginning and 39.1MB in the end (delta: -4.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.13ms. Allocated memory is still 71.3MB. Free memory was 39.1MB in the beginning and 36.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.22ms. Allocated memory is still 71.3MB. Free memory was 36.2MB in the beginning and 34.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 865.72ms. Allocated memory is still 71.3MB. Free memory was 34.1MB in the beginning and 36.7MB in the end (delta: -2.5MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14466.79ms. Allocated memory was 71.3MB in the beginning and 163.6MB in the end (delta: 92.3MB). Free memory was 36.3MB in the beginning and 37.4MB in the end (delta: -1.2MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. * Witness Printer took 5.02ms. Allocated memory is still 163.6MB. Free memory is still 37.4MB. 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: 6.7s, 121 PlacesBefore, 39 PlacesAfterwards, 113 TransitionsBefore, 29 TransitionsAfterwards, 2032 CoEnabledTransitionPairs, 6 FixpointIterations, 48 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 113 TotalNumberOfCompositions, 4674 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2359, independent: 2214, independent conditional: 0, independent unconditional: 2214, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1116, independent: 1075, independent conditional: 0, independent unconditional: 1075, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2359, independent: 1139, independent conditional: 0, independent unconditional: 1139, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 1116, unknown conditional: 0, unknown unconditional: 1116] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-1, t2177={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=0, t2177={-6:0}, t2178={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=1, t2177={-6:0}, t2178={-10:0}, t2179={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L785] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={-6:0}, t2178={-10:0}, t2179={-2:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={-6:0}, t2178={-10:0}, t2179={-2:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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: 814]: 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 7 procedures, 142 locations, 13 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: 14.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 452 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 357 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1120 IncrementalHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 29 mSDtfsCounter, 1120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=5, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 131 ConstructedInterpolants, 17 QuantifiedInterpolants, 1451 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1260 ConjunctsInSsa, 86 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-31 23:38:47,152 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