./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_power.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 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:09:36,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:09:36,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:09:36,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:09:36,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:09:36,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:09:36,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:09:36,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:09:36,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:09:36,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:09:36,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:09:36,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:09:36,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:09:36,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:09:36,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:09:36,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:09:36,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:09:36,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:09:36,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:09:36,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:09:36,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:09:36,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:09:36,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:09:36,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:09:36,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:09:36,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:09:36,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:09:36,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:09:36,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:09:36,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:09:36,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:09:36,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:09:36,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:09:36,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:09:36,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:09:36,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:09:36,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:09:36,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:09:36,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:09:36,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:09:36,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:09:36,149 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 03:09:36,172 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:09:36,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:09:36,173 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:09:36,174 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:09:36,174 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:09:36,174 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:09:36,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:09:36,175 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:09:36,175 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:09:36,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:09:36,176 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:09:36,176 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:09:36,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:09:36,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:09:36,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:09:36,177 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:09:36,177 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:09:36,177 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:09:36,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:09:36,178 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:09:36,178 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:09:36,178 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:09:36,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:09:36,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:09:36,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:09:36,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:09:36,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:09:36,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:09:36,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 03:09:36,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 03:09:36,179 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:09:36,179 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:09:36,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:09:36,180 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:09:36,180 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 -> 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:09:36,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:09:36,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:09:36,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:09:36,436 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:09:36,437 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:09:36,438 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2023-08-30 03:09:37,457 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:09:37,727 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:09:37,727 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2023-08-30 03:09:37,748 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2b12d63/521e387062db4096b580058d0a1a9277/FLAG74cfaccc5 [2023-08-30 03:09:37,764 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2b12d63/521e387062db4096b580058d0a1a9277 [2023-08-30 03:09:37,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:09:37,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:09:37,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:09:37,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:09:37,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:09:37,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:09:37" (1/1) ... [2023-08-30 03:09:37,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8bba732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:37, skipping insertion in model container [2023-08-30 03:09:37,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:09:37" (1/1) ... [2023-08-30 03:09:37,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:09:37,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:09:37,905 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/safe014_power.opt.i[994,1007] [2023-08-30 03:09:38,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:09:38,097 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:09:38,109 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/safe014_power.opt.i[994,1007] [2023-08-30 03:09:38,155 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:09:38,191 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:09:38,191 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:09:38,196 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:09:38,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:38 WrapperNode [2023-08-30 03:09:38,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:09:38,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:09:38,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:09:38,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:09:38,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:38" (1/1) ... [2023-08-30 03:09:38,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:38" (1/1) ... [2023-08-30 03:09:38,248 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2023-08-30 03:09:38,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:09:38,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:09:38,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:09:38,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:09:38,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:38" (1/1) ... [2023-08-30 03:09:38,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:38" (1/1) ... [2023-08-30 03:09:38,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:38" (1/1) ... [2023-08-30 03:09:38,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:38" (1/1) ... [2023-08-30 03:09:38,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:38" (1/1) ... [2023-08-30 03:09:38,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:38" (1/1) ... [2023-08-30 03:09:38,290 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:38" (1/1) ... [2023-08-30 03:09:38,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:38" (1/1) ... [2023-08-30 03:09:38,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:09:38,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:09:38,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:09:38,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:09:38,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:38" (1/1) ... [2023-08-30 03:09:38,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:09:38,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:09:38,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:09:38,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:09:38,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 03:09:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 03:09:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:09:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:09:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:09:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:09:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:09:38,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:09:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:09:38,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:09:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:09:38,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:09:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 03:09:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:09:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:09:38,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:09:38,355 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:09:38,515 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:09:38,517 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:09:38,854 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:09:39,194 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:09:39,195 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:09:39,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:09:39 BoogieIcfgContainer [2023-08-30 03:09:39,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:09:39,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:09:39,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:09:39,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:09:39,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:09:37" (1/3) ... [2023-08-30 03:09:39,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3185d8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:09:39, skipping insertion in model container [2023-08-30 03:09:39,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:09:38" (2/3) ... [2023-08-30 03:09:39,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3185d8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:09:39, skipping insertion in model container [2023-08-30 03:09:39,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:09:39" (3/3) ... [2023-08-30 03:09:39,215 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.opt.i [2023-08-30 03:09:39,229 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:09:39,229 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-08-30 03:09:39,230 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:09:39,312 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:09:39,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 161 transitions, 337 flow [2023-08-30 03:09:39,401 INFO L130 PetriNetUnfolder]: 2/158 cut-off events. [2023-08-30 03:09:39,402 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:09:39,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 158 events. 2/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 211 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2023-08-30 03:09:39,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 161 transitions, 337 flow [2023-08-30 03:09:39,412 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 158 transitions, 325 flow [2023-08-30 03:09:39,414 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:09:39,421 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 158 transitions, 325 flow [2023-08-30 03:09:39,423 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 158 transitions, 325 flow [2023-08-30 03:09:39,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 158 transitions, 325 flow [2023-08-30 03:09:39,463 INFO L130 PetriNetUnfolder]: 2/158 cut-off events. [2023-08-30 03:09:39,463 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:09:39,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 158 events. 2/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 209 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2023-08-30 03:09:39,466 INFO L119 LiptonReduction]: Number of co-enabled transitions 4876 [2023-08-30 03:09:49,854 INFO L134 LiptonReduction]: Checked pairs total: 19800 [2023-08-30 03:09:49,854 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-08-30 03:09:49,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:09:49,886 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;@5c47b6b7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:09:49,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-08-30 03:09:49,888 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 03:09:49,888 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:09:49,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:49,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:09:49,889 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:49,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:49,892 INFO L85 PathProgramCache]: Analyzing trace with hash 952, now seen corresponding path program 1 times [2023-08-30 03:09:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:49,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364647228] [2023-08-30 03:09:49,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:49,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:49,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:49,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364647228] [2023-08-30 03:09:49,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364647228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:49,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:09:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552150926] [2023-08-30 03:09:49,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:49,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:09:49,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:50,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:09:50,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:09:50,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 300 [2023-08-30 03:09:50,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 127 flow. Second operand has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:50,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:50,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 300 [2023-08-30 03:09:50,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:51,043 INFO L130 PetriNetUnfolder]: 5254/7571 cut-off events. [2023-08-30 03:09:51,044 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:09:51,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15183 conditions, 7571 events. 5254/7571 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 43438 event pairs, 5254 based on Foata normal form. 0/4316 useless extension candidates. Maximal degree in co-relation 15172. Up to 7566 conditions per place. [2023-08-30 03:09:51,077 INFO L137 encePairwiseOnDemand]: 280/300 looper letters, 37 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-08-30 03:09:51,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 161 flow [2023-08-30 03:09:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:09:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:09:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 303 transitions. [2023-08-30 03:09:51,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505 [2023-08-30 03:09:51,086 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 303 transitions. [2023-08-30 03:09:51,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 303 transitions. [2023-08-30 03:09:51,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:51,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 303 transitions. [2023-08-30 03:09:51,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:51,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:51,094 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:51,095 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 127 flow. Second operand 2 states and 303 transitions. [2023-08-30 03:09:51,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 161 flow [2023-08-30 03:09:51,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:09:51,099 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 84 flow [2023-08-30 03:09:51,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-30 03:09:51,102 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -22 predicate places. [2023-08-30 03:09:51,102 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 84 flow [2023-08-30 03:09:51,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:51,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:51,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:09:51,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 03:09:51,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:51,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash 941813, now seen corresponding path program 1 times [2023-08-30 03:09:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:51,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569812525] [2023-08-30 03:09:51,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:51,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:51,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-30 03:09:51,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:51,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569812525] [2023-08-30 03:09:51,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569812525] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:51,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:51,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:09:51,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068308143] [2023-08-30 03:09:51,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:51,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:09:51,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:51,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:09:51,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:09:51,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 300 [2023-08-30 03:09:51,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:51,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:51,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 300 [2023-08-30 03:09:51,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:51,875 INFO L130 PetriNetUnfolder]: 2825/4127 cut-off events. [2023-08-30 03:09:51,875 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:09:51,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8286 conditions, 4127 events. 2825/4127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 21998 event pairs, 2825 based on Foata normal form. 0/2754 useless extension candidates. Maximal degree in co-relation 8283. Up to 4122 conditions per place. [2023-08-30 03:09:51,893 INFO L137 encePairwiseOnDemand]: 294/300 looper letters, 31 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-30 03:09:51,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 138 flow [2023-08-30 03:09:51,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:09:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:09:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-08-30 03:09:51,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4477777777777778 [2023-08-30 03:09:51,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-08-30 03:09:51,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-08-30 03:09:51,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:51,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-08-30 03:09:51,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:51,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:51,903 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:51,903 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 84 flow. Second operand 3 states and 403 transitions. [2023-08-30 03:09:51,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 138 flow [2023-08-30 03:09:51,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:09:51,905 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-08-30 03:09:51,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-30 03:09:51,905 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -25 predicate places. [2023-08-30 03:09:51,905 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-08-30 03:09:51,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:51,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:51,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:09:51,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 03:09:51,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:51,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:51,908 INFO L85 PathProgramCache]: Analyzing trace with hash 941812, now seen corresponding path program 1 times [2023-08-30 03:09:51,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913740210] [2023-08-30 03:09:51,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:51,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913740210] [2023-08-30 03:09:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913740210] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:51,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:51,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:09:51,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373261969] [2023-08-30 03:09:51,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:51,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:09:51,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:51,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:09:51,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:09:51,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 300 [2023-08-30 03:09:51,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:51,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:51,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 300 [2023-08-30 03:09:51,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:52,436 INFO L130 PetriNetUnfolder]: 2010/3125 cut-off events. [2023-08-30 03:09:52,436 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:09:52,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6205 conditions, 3125 events. 2010/3125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 17777 event pairs, 1238 based on Foata normal form. 0/2476 useless extension candidates. Maximal degree in co-relation 6201. Up to 1791 conditions per place. [2023-08-30 03:09:52,450 INFO L137 encePairwiseOnDemand]: 288/300 looper letters, 35 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2023-08-30 03:09:52,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 180 flow [2023-08-30 03:09:52,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:09:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:09:52,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-08-30 03:09:52,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4488888888888889 [2023-08-30 03:09:52,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-08-30 03:09:52,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-08-30 03:09:52,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:52,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-08-30 03:09:52,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:52,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:52,454 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:52,454 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 404 transitions. [2023-08-30 03:09:52,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 180 flow [2023-08-30 03:09:52,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:09:52,456 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 125 flow [2023-08-30 03:09:52,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-30 03:09:52,457 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -24 predicate places. [2023-08-30 03:09:52,459 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 125 flow [2023-08-30 03:09:52,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:52,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:52,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:52,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 03:09:52,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:52,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash -947670117, now seen corresponding path program 1 times [2023-08-30 03:09:52,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:52,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441725658] [2023-08-30 03:09:52,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:52,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:52,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:52,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441725658] [2023-08-30 03:09:52,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441725658] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:52,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:52,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:09:52,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356248333] [2023-08-30 03:09:52,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:52,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:09:52,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:52,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:09:52,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:09:52,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 300 [2023-08-30 03:09:52,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:52,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:52,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 300 [2023-08-30 03:09:52,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:52,899 INFO L130 PetriNetUnfolder]: 1713/2669 cut-off events. [2023-08-30 03:09:52,900 INFO L131 PetriNetUnfolder]: For 548/548 co-relation queries the response was YES. [2023-08-30 03:09:52,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6658 conditions, 2669 events. 1713/2669 cut-off events. For 548/548 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 14946 event pairs, 532 based on Foata normal form. 0/2344 useless extension candidates. Maximal degree in co-relation 6653. Up to 1809 conditions per place. [2023-08-30 03:09:52,913 INFO L137 encePairwiseOnDemand]: 297/300 looper letters, 51 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-30 03:09:52,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 297 flow [2023-08-30 03:09:52,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:09:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:09:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-30 03:09:52,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45666666666666667 [2023-08-30 03:09:52,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-30 03:09:52,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-30 03:09:52,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:52,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-30 03:09:52,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 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-30 03:09:52,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:52,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:52,921 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 125 flow. Second operand 3 states and 411 transitions. [2023-08-30 03:09:52,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 297 flow [2023-08-30 03:09:52,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:09:52,931 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 113 flow [2023-08-30 03:09:52,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-08-30 03:09:52,932 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -25 predicate places. [2023-08-30 03:09:52,932 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 113 flow [2023-08-30 03:09:52,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:52,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:52,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:52,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 03:09:52,933 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:52,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:52,933 INFO L85 PathProgramCache]: Analyzing trace with hash 687086542, now seen corresponding path program 1 times [2023-08-30 03:09:52,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:52,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969327568] [2023-08-30 03:09:52,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:52,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:53,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:53,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969327568] [2023-08-30 03:09:53,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969327568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:53,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:53,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:09:53,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640936280] [2023-08-30 03:09:53,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:53,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:09:53,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:53,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:09:53,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:09:53,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 300 [2023-08-30 03:09:53,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:53,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:53,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 300 [2023-08-30 03:09:53,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:53,626 INFO L130 PetriNetUnfolder]: 2344/3552 cut-off events. [2023-08-30 03:09:53,626 INFO L131 PetriNetUnfolder]: For 920/920 co-relation queries the response was YES. [2023-08-30 03:09:53,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8623 conditions, 3552 events. 2344/3552 cut-off events. For 920/920 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 20512 event pairs, 315 based on Foata normal form. 0/2962 useless extension candidates. Maximal degree in co-relation 8618. Up to 2884 conditions per place. [2023-08-30 03:09:53,637 INFO L137 encePairwiseOnDemand]: 297/300 looper letters, 59 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-30 03:09:53,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 319 flow [2023-08-30 03:09:53,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:09:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:09:53,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-30 03:09:53,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4577777777777778 [2023-08-30 03:09:53,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-30 03:09:53,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-30 03:09:53,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:53,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-30 03:09:53,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:53,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:53,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:53,643 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 113 flow. Second operand 3 states and 412 transitions. [2023-08-30 03:09:53,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 319 flow [2023-08-30 03:09:53,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:09:53,644 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 117 flow [2023-08-30 03:09:53,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-30 03:09:53,645 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -24 predicate places. [2023-08-30 03:09:53,645 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 117 flow [2023-08-30 03:09:53,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:53,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:53,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:53,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 03:09:53,646 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:53,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:53,646 INFO L85 PathProgramCache]: Analyzing trace with hash 687086354, now seen corresponding path program 1 times [2023-08-30 03:09:53,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:53,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869155646] [2023-08-30 03:09:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:53,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:53,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:53,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869155646] [2023-08-30 03:09:53,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869155646] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:53,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:53,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:09:53,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974365172] [2023-08-30 03:09:53,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:53,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:09:53,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:53,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:09:53,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:09:53,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 300 [2023-08-30 03:09:53,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:53,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:53,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 300 [2023-08-30 03:09:53,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:54,069 INFO L130 PetriNetUnfolder]: 1602/2573 cut-off events. [2023-08-30 03:09:54,069 INFO L131 PetriNetUnfolder]: For 528/528 co-relation queries the response was YES. [2023-08-30 03:09:54,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6600 conditions, 2573 events. 1602/2573 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14512 event pairs, 696 based on Foata normal form. 0/2194 useless extension candidates. Maximal degree in co-relation 6594. Up to 1713 conditions per place. [2023-08-30 03:09:54,083 INFO L137 encePairwiseOnDemand]: 296/300 looper letters, 57 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-08-30 03:09:54,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 62 transitions, 320 flow [2023-08-30 03:09:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:09:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:09:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-30 03:09:54,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46555555555555556 [2023-08-30 03:09:54,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-30 03:09:54,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-30 03:09:54,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:54,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-30 03:09:54,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:54,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:54,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:54,089 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 117 flow. Second operand 3 states and 419 transitions. [2023-08-30 03:09:54,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 62 transitions, 320 flow [2023-08-30 03:09:54,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:09:54,090 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 126 flow [2023-08-30 03:09:54,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-30 03:09:54,091 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -23 predicate places. [2023-08-30 03:09:54,091 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 126 flow [2023-08-30 03:09:54,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:54,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:54,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:54,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 03:09:54,092 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:54,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash -175154979, now seen corresponding path program 1 times [2023-08-30 03:09:54,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:54,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521777671] [2023-08-30 03:09:54,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:54,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:54,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:54,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521777671] [2023-08-30 03:09:54,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521777671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:54,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:54,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:09:54,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974904011] [2023-08-30 03:09:54,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:54,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:09:54,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:54,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:09:54,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:09:54,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 300 [2023-08-30 03:09:54,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:54,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:54,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 300 [2023-08-30 03:09:54,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:54,582 INFO L130 PetriNetUnfolder]: 1611/2655 cut-off events. [2023-08-30 03:09:54,583 INFO L131 PetriNetUnfolder]: For 514/514 co-relation queries the response was YES. [2023-08-30 03:09:54,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6883 conditions, 2655 events. 1611/2655 cut-off events. For 514/514 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 16077 event pairs, 313 based on Foata normal form. 0/2408 useless extension candidates. Maximal degree in co-relation 6876. Up to 1128 conditions per place. [2023-08-30 03:09:54,594 INFO L137 encePairwiseOnDemand]: 292/300 looper letters, 48 selfloop transitions, 12 changer transitions 0/62 dead transitions. [2023-08-30 03:09:54,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 314 flow [2023-08-30 03:09:54,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:09:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:09:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-30 03:09:54,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44416666666666665 [2023-08-30 03:09:54,596 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-30 03:09:54,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-30 03:09:54,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:54,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-30 03:09:54,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:54,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:54,600 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:54,600 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 126 flow. Second operand 4 states and 533 transitions. [2023-08-30 03:09:54,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 314 flow [2023-08-30 03:09:54,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:09:54,602 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 156 flow [2023-08-30 03:09:54,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-08-30 03:09:54,603 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -23 predicate places. [2023-08-30 03:09:54,603 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 156 flow [2023-08-30 03:09:54,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:54,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:54,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:54,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 03:09:54,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:54,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash -175154978, now seen corresponding path program 1 times [2023-08-30 03:09:54,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:54,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406783930] [2023-08-30 03:09:54,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:54,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:54,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406783930] [2023-08-30 03:09:54,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406783930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:54,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:54,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:09:54,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397891015] [2023-08-30 03:09:54,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:54,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:09:54,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:54,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:09:54,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:09:54,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 300 [2023-08-30 03:09:54,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:54,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:54,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 300 [2023-08-30 03:09:54,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:55,083 INFO L130 PetriNetUnfolder]: 1552/2566 cut-off events. [2023-08-30 03:09:55,083 INFO L131 PetriNetUnfolder]: For 715/715 co-relation queries the response was YES. [2023-08-30 03:09:55,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6950 conditions, 2566 events. 1552/2566 cut-off events. For 715/715 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15504 event pairs, 558 based on Foata normal form. 30/2397 useless extension candidates. Maximal degree in co-relation 6943. Up to 1650 conditions per place. [2023-08-30 03:09:55,093 INFO L137 encePairwiseOnDemand]: 297/300 looper letters, 57 selfloop transitions, 3 changer transitions 1/63 dead transitions. [2023-08-30 03:09:55,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 359 flow [2023-08-30 03:09:55,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:09:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:09:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-30 03:09:55,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445 [2023-08-30 03:09:55,096 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-30 03:09:55,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-30 03:09:55,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:55,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-30 03:09:55,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 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-30 03:09:55,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:55,098 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:55,099 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 156 flow. Second operand 4 states and 534 transitions. [2023-08-30 03:09:55,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 359 flow [2023-08-30 03:09:55,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:09:55,102 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 144 flow [2023-08-30 03:09:55,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-30 03:09:55,102 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -23 predicate places. [2023-08-30 03:09:55,102 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 144 flow [2023-08-30 03:09:55,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:55,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:55,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:55,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 03:09:55,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:55,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:55,103 INFO L85 PathProgramCache]: Analyzing trace with hash 964046667, now seen corresponding path program 1 times [2023-08-30 03:09:55,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:55,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749036275] [2023-08-30 03:09:55,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:55,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:55,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:55,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749036275] [2023-08-30 03:09:55,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749036275] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:55,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:55,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:09:55,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426663913] [2023-08-30 03:09:55,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:55,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:09:55,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:55,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:09:55,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:09:55,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 300 [2023-08-30 03:09:55,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:55,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:55,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 300 [2023-08-30 03:09:55,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:55,526 INFO L130 PetriNetUnfolder]: 1539/2432 cut-off events. [2023-08-30 03:09:55,527 INFO L131 PetriNetUnfolder]: For 1098/1098 co-relation queries the response was YES. [2023-08-30 03:09:55,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6542 conditions, 2432 events. 1539/2432 cut-off events. For 1098/1098 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 13906 event pairs, 247 based on Foata normal form. 6/2188 useless extension candidates. Maximal degree in co-relation 6536. Up to 2067 conditions per place. [2023-08-30 03:09:55,536 INFO L137 encePairwiseOnDemand]: 297/300 looper letters, 51 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-30 03:09:55,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 319 flow [2023-08-30 03:09:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:09:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:09:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-08-30 03:09:55,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4477777777777778 [2023-08-30 03:09:55,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-08-30 03:09:55,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-08-30 03:09:55,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:55,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-08-30 03:09:55,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:55,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:55,540 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:55,540 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 144 flow. Second operand 3 states and 403 transitions. [2023-08-30 03:09:55,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 319 flow [2023-08-30 03:09:55,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:09:55,542 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 148 flow [2023-08-30 03:09:55,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-30 03:09:55,543 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -22 predicate places. [2023-08-30 03:09:55,543 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 148 flow [2023-08-30 03:09:55,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:55,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:55,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:55,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 03:09:55,543 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:55,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash -179325973, now seen corresponding path program 1 times [2023-08-30 03:09:55,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:55,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460879676] [2023-08-30 03:09:55,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:55,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:55,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460879676] [2023-08-30 03:09:55,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460879676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:55,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:55,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:09:55,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707243382] [2023-08-30 03:09:55,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:55,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:09:55,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:55,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:09:55,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:09:55,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 300 [2023-08-30 03:09:55,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:55,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:55,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 300 [2023-08-30 03:09:55,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:56,070 INFO L130 PetriNetUnfolder]: 2124/3307 cut-off events. [2023-08-30 03:09:56,071 INFO L131 PetriNetUnfolder]: For 1159/1159 co-relation queries the response was YES. [2023-08-30 03:09:56,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9044 conditions, 3307 events. 2124/3307 cut-off events. For 1159/1159 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 18513 event pairs, 1297 based on Foata normal form. 12/2878 useless extension candidates. Maximal degree in co-relation 9037. Up to 2381 conditions per place. [2023-08-30 03:09:56,099 INFO L137 encePairwiseOnDemand]: 297/300 looper letters, 63 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-30 03:09:56,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 389 flow [2023-08-30 03:09:56,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:09:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:09:56,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-30 03:09:56,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2023-08-30 03:09:56,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-30 03:09:56,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-30 03:09:56,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:56,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-30 03:09:56,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 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-30 03:09:56,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:56,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:56,104 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 148 flow. Second operand 3 states and 408 transitions. [2023-08-30 03:09:56,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 389 flow [2023-08-30 03:09:56,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:09:56,106 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 152 flow [2023-08-30 03:09:56,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-30 03:09:56,107 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -21 predicate places. [2023-08-30 03:09:56,107 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 152 flow [2023-08-30 03:09:56,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:56,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:56,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:56,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 03:09:56,108 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:56,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1134798488, now seen corresponding path program 1 times [2023-08-30 03:09:56,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:56,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594236764] [2023-08-30 03:09:56,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:56,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:56,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594236764] [2023-08-30 03:09:56,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594236764] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:56,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:56,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:09:56,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542496517] [2023-08-30 03:09:56,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:56,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:09:56,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:56,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:09:56,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:09:56,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 300 [2023-08-30 03:09:56,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:56,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:56,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 300 [2023-08-30 03:09:56,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:56,593 INFO L130 PetriNetUnfolder]: 1423/2289 cut-off events. [2023-08-30 03:09:56,593 INFO L131 PetriNetUnfolder]: For 1381/1381 co-relation queries the response was YES. [2023-08-30 03:09:56,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6491 conditions, 2289 events. 1423/2289 cut-off events. For 1381/1381 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12694 event pairs, 524 based on Foata normal form. 0/2000 useless extension candidates. Maximal degree in co-relation 6483. Up to 868 conditions per place. [2023-08-30 03:09:56,604 INFO L137 encePairwiseOnDemand]: 290/300 looper letters, 40 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2023-08-30 03:09:56,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 312 flow [2023-08-30 03:09:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:09:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:09:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-08-30 03:09:56,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42333333333333334 [2023-08-30 03:09:56,606 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-08-30 03:09:56,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-08-30 03:09:56,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:56,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-08-30 03:09:56,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:56,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:56,609 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:56,609 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 152 flow. Second operand 4 states and 508 transitions. [2023-08-30 03:09:56,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 312 flow [2023-08-30 03:09:56,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:09:56,611 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 214 flow [2023-08-30 03:09:56,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-30 03:09:56,612 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -18 predicate places. [2023-08-30 03:09:56,612 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 214 flow [2023-08-30 03:09:56,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:56,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:56,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:56,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 03:09:56,613 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:56,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:56,613 INFO L85 PathProgramCache]: Analyzing trace with hash 133632980, now seen corresponding path program 1 times [2023-08-30 03:09:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:56,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935696838] [2023-08-30 03:09:56,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:56,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:56,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:56,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935696838] [2023-08-30 03:09:56,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935696838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:56,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:56,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:09:56,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12562970] [2023-08-30 03:09:56,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:56,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:09:56,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:56,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:09:56,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:09:56,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 300 [2023-08-30 03:09:56,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:56,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:56,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 300 [2023-08-30 03:09:56,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:57,104 INFO L130 PetriNetUnfolder]: 1405/2332 cut-off events. [2023-08-30 03:09:57,105 INFO L131 PetriNetUnfolder]: For 1850/1850 co-relation queries the response was YES. [2023-08-30 03:09:57,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7058 conditions, 2332 events. 1405/2332 cut-off events. For 1850/1850 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 13783 event pairs, 471 based on Foata normal form. 8/2153 useless extension candidates. Maximal degree in co-relation 7049. Up to 1559 conditions per place. [2023-08-30 03:09:57,113 INFO L137 encePairwiseOnDemand]: 297/300 looper letters, 58 selfloop transitions, 4 changer transitions 1/65 dead transitions. [2023-08-30 03:09:57,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 450 flow [2023-08-30 03:09:57,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:09:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:09:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-30 03:09:57,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46444444444444444 [2023-08-30 03:09:57,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-30 03:09:57,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-30 03:09:57,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:57,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-30 03:09:57,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:57,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:57,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:57,117 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 214 flow. Second operand 3 states and 418 transitions. [2023-08-30 03:09:57,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 450 flow [2023-08-30 03:09:57,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:09:57,120 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 225 flow [2023-08-30 03:09:57,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-08-30 03:09:57,121 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -16 predicate places. [2023-08-30 03:09:57,121 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 225 flow [2023-08-30 03:09:57,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:57,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:57,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:57,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 03:09:57,122 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:57,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:57,122 INFO L85 PathProgramCache]: Analyzing trace with hash -819015007, now seen corresponding path program 1 times [2023-08-30 03:09:57,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:57,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040593657] [2023-08-30 03:09:57,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:57,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:57,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:57,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040593657] [2023-08-30 03:09:57,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040593657] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:57,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:57,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:09:57,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428389068] [2023-08-30 03:09:57,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:57,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:09:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:57,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:09:57,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:09:57,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 300 [2023-08-30 03:09:57,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 225 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:57,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:57,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 300 [2023-08-30 03:09:57,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:57,655 INFO L130 PetriNetUnfolder]: 1232/2027 cut-off events. [2023-08-30 03:09:57,655 INFO L131 PetriNetUnfolder]: For 1933/1933 co-relation queries the response was YES. [2023-08-30 03:09:57,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6539 conditions, 2027 events. 1232/2027 cut-off events. For 1933/1933 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 11332 event pairs, 350 based on Foata normal form. 24/1931 useless extension candidates. Maximal degree in co-relation 6528. Up to 639 conditions per place. [2023-08-30 03:09:57,661 INFO L137 encePairwiseOnDemand]: 289/300 looper letters, 49 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2023-08-30 03:09:57,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 460 flow [2023-08-30 03:09:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:09:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:09:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2023-08-30 03:09:57,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40444444444444444 [2023-08-30 03:09:57,663 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2023-08-30 03:09:57,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2023-08-30 03:09:57,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:57,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2023-08-30 03:09:57,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:57,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:57,666 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:57,666 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 225 flow. Second operand 6 states and 728 transitions. [2023-08-30 03:09:57,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 460 flow [2023-08-30 03:09:57,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:09:57,669 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 297 flow [2023-08-30 03:09:57,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2023-08-30 03:09:57,670 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -11 predicate places. [2023-08-30 03:09:57,670 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 297 flow [2023-08-30 03:09:57,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:57,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:57,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:57,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 03:09:57,671 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:57,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:57,671 INFO L85 PathProgramCache]: Analyzing trace with hash 380339382, now seen corresponding path program 1 times [2023-08-30 03:09:57,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:57,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553426259] [2023-08-30 03:09:57,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:57,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553426259] [2023-08-30 03:09:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553426259] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:57,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:57,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:09:57,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611352165] [2023-08-30 03:09:57,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:57,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:09:57,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:57,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:09:57,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:09:58,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 300 [2023-08-30 03:09:58,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 297 flow. Second operand has 8 states, 8 states have (on average 108.875) internal successors, (871), 8 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:58,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:58,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 300 [2023-08-30 03:09:58,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:58,488 INFO L130 PetriNetUnfolder]: 985/1609 cut-off events. [2023-08-30 03:09:58,488 INFO L131 PetriNetUnfolder]: For 2262/2262 co-relation queries the response was YES. [2023-08-30 03:09:58,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5469 conditions, 1609 events. 985/1609 cut-off events. For 2262/2262 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8385 event pairs, 130 based on Foata normal form. 0/1597 useless extension candidates. Maximal degree in co-relation 5457. Up to 614 conditions per place. [2023-08-30 03:09:58,493 INFO L137 encePairwiseOnDemand]: 293/300 looper letters, 50 selfloop transitions, 11 changer transitions 6/69 dead transitions. [2023-08-30 03:09:58,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 504 flow [2023-08-30 03:09:58,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:09:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:09:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 806 transitions. [2023-08-30 03:09:58,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838095238095238 [2023-08-30 03:09:58,496 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 806 transitions. [2023-08-30 03:09:58,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 806 transitions. [2023-08-30 03:09:58,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:58,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 806 transitions. [2023-08-30 03:09:58,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:58,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:58,501 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:58,501 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 297 flow. Second operand 7 states and 806 transitions. [2023-08-30 03:09:58,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 504 flow [2023-08-30 03:09:58,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 486 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 03:09:58,507 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 267 flow [2023-08-30 03:09:58,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2023-08-30 03:09:58,508 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -10 predicate places. [2023-08-30 03:09:58,508 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 267 flow [2023-08-30 03:09:58,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.875) internal successors, (871), 8 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:58,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:58,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:58,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 03:09:58,509 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:58,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:58,509 INFO L85 PathProgramCache]: Analyzing trace with hash 652646257, now seen corresponding path program 1 times [2023-08-30 03:09:58,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:58,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786537826] [2023-08-30 03:09:58,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:58,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:58,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:09:58,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786537826] [2023-08-30 03:09:58,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786537826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:58,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:58,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:09:58,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598576124] [2023-08-30 03:09:58,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:58,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:09:58,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:09:58,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:09:58,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:09:58,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 300 [2023-08-30 03:09:58,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:58,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:58,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 300 [2023-08-30 03:09:58,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:59,407 INFO L130 PetriNetUnfolder]: 2083/3410 cut-off events. [2023-08-30 03:09:59,407 INFO L131 PetriNetUnfolder]: For 6452/6452 co-relation queries the response was YES. [2023-08-30 03:09:59,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11235 conditions, 3410 events. 2083/3410 cut-off events. For 6452/6452 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 20660 event pairs, 372 based on Foata normal form. 16/3402 useless extension candidates. Maximal degree in co-relation 11222. Up to 1606 conditions per place. [2023-08-30 03:09:59,423 INFO L137 encePairwiseOnDemand]: 295/300 looper letters, 95 selfloop transitions, 8 changer transitions 24/128 dead transitions. [2023-08-30 03:09:59,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 128 transitions, 1109 flow [2023-08-30 03:09:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:09:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:09:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 794 transitions. [2023-08-30 03:09:59,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4411111111111111 [2023-08-30 03:09:59,426 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 794 transitions. [2023-08-30 03:09:59,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 794 transitions. [2023-08-30 03:09:59,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:59,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 794 transitions. [2023-08-30 03:09:59,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:59,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:59,432 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:59,432 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 267 flow. Second operand 6 states and 794 transitions. [2023-08-30 03:09:59,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 128 transitions, 1109 flow [2023-08-30 03:09:59,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 128 transitions, 1031 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 03:09:59,454 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 296 flow [2023-08-30 03:09:59,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2023-08-30 03:09:59,454 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -7 predicate places. [2023-08-30 03:09:59,455 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 296 flow [2023-08-30 03:09:59,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:59,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:59,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:59,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 03:09:59,455 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:09:59,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:59,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1701666853, now seen corresponding path program 2 times [2023-08-30 03:09:59,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:09:59,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86046071] [2023-08-30 03:09:59,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:59,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:09:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:00,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:10:00,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86046071] [2023-08-30 03:10:00,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86046071] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:00,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:00,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:10:00,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072155101] [2023-08-30 03:10:00,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:00,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:10:00,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:10:00,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:10:00,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:10:00,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 300 [2023-08-30 03:10:00,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 296 flow. Second operand has 8 states, 8 states have (on average 106.75) internal successors, (854), 8 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:00,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:00,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 300 [2023-08-30 03:10:00,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:01,702 INFO L130 PetriNetUnfolder]: 2340/3824 cut-off events. [2023-08-30 03:10:01,703 INFO L131 PetriNetUnfolder]: For 6604/6608 co-relation queries the response was YES. [2023-08-30 03:10:01,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12825 conditions, 3824 events. 2340/3824 cut-off events. For 6604/6608 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 24289 event pairs, 254 based on Foata normal form. 16/3760 useless extension candidates. Maximal degree in co-relation 12808. Up to 1969 conditions per place. [2023-08-30 03:10:01,721 INFO L137 encePairwiseOnDemand]: 288/300 looper letters, 99 selfloop transitions, 29 changer transitions 1/133 dead transitions. [2023-08-30 03:10:01,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 133 transitions, 1060 flow [2023-08-30 03:10:01,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 03:10:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 03:10:01,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1465 transitions. [2023-08-30 03:10:01,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37564102564102564 [2023-08-30 03:10:01,725 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1465 transitions. [2023-08-30 03:10:01,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1465 transitions. [2023-08-30 03:10:01,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:01,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1465 transitions. [2023-08-30 03:10:01,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.6923076923077) internal successors, (1465), 13 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:01,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 300.0) internal successors, (4200), 14 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:01,732 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 300.0) internal successors, (4200), 14 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:01,732 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 296 flow. Second operand 13 states and 1465 transitions. [2023-08-30 03:10:01,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 133 transitions, 1060 flow [2023-08-30 03:10:01,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 133 transitions, 1050 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:10:01,753 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 582 flow [2023-08-30 03:10:01,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=582, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2023-08-30 03:10:01,753 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 11 predicate places. [2023-08-30 03:10:01,754 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 582 flow [2023-08-30 03:10:01,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.75) internal successors, (854), 8 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:01,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:01,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:01,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 03:10:01,754 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:01,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash 650945287, now seen corresponding path program 3 times [2023-08-30 03:10:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:10:01,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387200195] [2023-08-30 03:10:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:10:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:02,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:10:02,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387200195] [2023-08-30 03:10:02,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387200195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:02,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:02,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:10:02,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659460016] [2023-08-30 03:10:02,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:02,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:10:02,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:10:02,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:10:02,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:10:02,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 300 [2023-08-30 03:10:02,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 582 flow. Second operand has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:02,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:02,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 300 [2023-08-30 03:10:02,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:03,490 INFO L130 PetriNetUnfolder]: 2721/4388 cut-off events. [2023-08-30 03:10:03,490 INFO L131 PetriNetUnfolder]: For 9775/9781 co-relation queries the response was YES. [2023-08-30 03:10:03,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16970 conditions, 4388 events. 2721/4388 cut-off events. For 9775/9781 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 28100 event pairs, 1415 based on Foata normal form. 14/4290 useless extension candidates. Maximal degree in co-relation 16946. Up to 3600 conditions per place. [2023-08-30 03:10:03,515 INFO L137 encePairwiseOnDemand]: 290/300 looper letters, 101 selfloop transitions, 18 changer transitions 0/123 dead transitions. [2023-08-30 03:10:03,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 123 transitions, 1128 flow [2023-08-30 03:10:03,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 03:10:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 03:10:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1258 transitions. [2023-08-30 03:10:03,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812121212121212 [2023-08-30 03:10:03,518 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1258 transitions. [2023-08-30 03:10:03,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1258 transitions. [2023-08-30 03:10:03,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:03,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1258 transitions. [2023-08-30 03:10:03,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.36363636363636) internal successors, (1258), 11 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:03,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 300.0) internal successors, (3600), 12 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:03,524 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 300.0) internal successors, (3600), 12 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:03,524 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 582 flow. Second operand 11 states and 1258 transitions. [2023-08-30 03:10:03,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 123 transitions, 1128 flow [2023-08-30 03:10:03,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 123 transitions, 1118 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-08-30 03:10:03,566 INFO L231 Difference]: Finished difference. Result has 99 places, 82 transitions, 793 flow [2023-08-30 03:10:03,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=793, PETRI_PLACES=99, PETRI_TRANSITIONS=82} [2023-08-30 03:10:03,567 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 30 predicate places. [2023-08-30 03:10:03,567 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 82 transitions, 793 flow [2023-08-30 03:10:03,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:03,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:03,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:03,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 03:10:03,568 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:03,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:03,568 INFO L85 PathProgramCache]: Analyzing trace with hash 277575583, now seen corresponding path program 4 times [2023-08-30 03:10:03,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:10:03,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266501639] [2023-08-30 03:10:03,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:03,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:10:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:04,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:10:04,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266501639] [2023-08-30 03:10:04,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266501639] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:04,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:04,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:10:04,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276213286] [2023-08-30 03:10:04,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:04,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:10:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:10:04,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:10:04,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:10:04,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 300 [2023-08-30 03:10:04,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 82 transitions, 793 flow. Second operand has 9 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:04,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:04,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 300 [2023-08-30 03:10:04,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:05,735 INFO L130 PetriNetUnfolder]: 3461/5497 cut-off events. [2023-08-30 03:10:05,736 INFO L131 PetriNetUnfolder]: For 15264/15272 co-relation queries the response was YES. [2023-08-30 03:10:05,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22572 conditions, 5497 events. 3461/5497 cut-off events. For 15264/15272 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 36031 event pairs, 798 based on Foata normal form. 20/5370 useless extension candidates. Maximal degree in co-relation 22538. Up to 3908 conditions per place. [2023-08-30 03:10:05,765 INFO L137 encePairwiseOnDemand]: 288/300 looper letters, 108 selfloop transitions, 34 changer transitions 0/146 dead transitions. [2023-08-30 03:10:05,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 146 transitions, 1517 flow [2023-08-30 03:10:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 03:10:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 03:10:05,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1236 transitions. [2023-08-30 03:10:05,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37454545454545457 [2023-08-30 03:10:05,784 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1236 transitions. [2023-08-30 03:10:05,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1236 transitions. [2023-08-30 03:10:05,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:05,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1236 transitions. [2023-08-30 03:10:05,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 112.36363636363636) internal successors, (1236), 11 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:05,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 300.0) internal successors, (3600), 12 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:05,813 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 300.0) internal successors, (3600), 12 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:05,813 INFO L175 Difference]: Start difference. First operand has 99 places, 82 transitions, 793 flow. Second operand 11 states and 1236 transitions. [2023-08-30 03:10:05,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 146 transitions, 1517 flow [2023-08-30 03:10:05,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 146 transitions, 1468 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-08-30 03:10:05,979 INFO L231 Difference]: Finished difference. Result has 115 places, 103 transitions, 1122 flow [2023-08-30 03:10:05,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1122, PETRI_PLACES=115, PETRI_TRANSITIONS=103} [2023-08-30 03:10:05,985 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 46 predicate places. [2023-08-30 03:10:05,985 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 103 transitions, 1122 flow [2023-08-30 03:10:05,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:05,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:05,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:05,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 03:10:05,986 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:05,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:05,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1683007669, now seen corresponding path program 5 times [2023-08-30 03:10:05,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:10:05,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719954253] [2023-08-30 03:10:05,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:05,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:10:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:06,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:10:06,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719954253] [2023-08-30 03:10:06,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719954253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:06,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:06,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:10:06,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626990774] [2023-08-30 03:10:06,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:06,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:10:06,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:10:06,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:10:06,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:10:07,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 300 [2023-08-30 03:10:07,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 103 transitions, 1122 flow. Second operand has 9 states, 9 states have (on average 108.55555555555556) internal successors, (977), 9 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:07,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:07,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 300 [2023-08-30 03:10:07,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:08,097 INFO L130 PetriNetUnfolder]: 3617/5816 cut-off events. [2023-08-30 03:10:08,097 INFO L131 PetriNetUnfolder]: For 19789/19795 co-relation queries the response was YES. [2023-08-30 03:10:08,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25440 conditions, 5816 events. 3617/5816 cut-off events. For 19789/19795 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 39015 event pairs, 433 based on Foata normal form. 16/5686 useless extension candidates. Maximal degree in co-relation 25399. Up to 2109 conditions per place. [2023-08-30 03:10:08,130 INFO L137 encePairwiseOnDemand]: 291/300 looper letters, 99 selfloop transitions, 61 changer transitions 0/164 dead transitions. [2023-08-30 03:10:08,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 164 transitions, 1832 flow [2023-08-30 03:10:08,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 03:10:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 03:10:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1378 transitions. [2023-08-30 03:10:08,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3827777777777778 [2023-08-30 03:10:08,135 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1378 transitions. [2023-08-30 03:10:08,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1378 transitions. [2023-08-30 03:10:08,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:08,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1378 transitions. [2023-08-30 03:10:08,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 114.83333333333333) internal successors, (1378), 12 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:08,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 300.0) internal successors, (3900), 13 states have internal predecessors, (3900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:08,141 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 300.0) internal successors, (3900), 13 states have internal predecessors, (3900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:08,141 INFO L175 Difference]: Start difference. First operand has 115 places, 103 transitions, 1122 flow. Second operand 12 states and 1378 transitions. [2023-08-30 03:10:08,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 164 transitions, 1832 flow [2023-08-30 03:10:08,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 164 transitions, 1787 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-30 03:10:08,237 INFO L231 Difference]: Finished difference. Result has 127 places, 114 transitions, 1426 flow [2023-08-30 03:10:08,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1426, PETRI_PLACES=127, PETRI_TRANSITIONS=114} [2023-08-30 03:10:08,238 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 58 predicate places. [2023-08-30 03:10:08,238 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 114 transitions, 1426 flow [2023-08-30 03:10:08,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.55555555555556) internal successors, (977), 9 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:08,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:08,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:08,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 03:10:08,239 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:08,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:08,239 INFO L85 PathProgramCache]: Analyzing trace with hash 583150381, now seen corresponding path program 1 times [2023-08-30 03:10:08,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:10:08,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404040598] [2023-08-30 03:10:08,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:08,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:10:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:08,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:10:08,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404040598] [2023-08-30 03:10:08,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404040598] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:08,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:08,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:10:08,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794169701] [2023-08-30 03:10:08,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:08,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:10:08,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:10:08,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:10:08,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:10:08,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 300 [2023-08-30 03:10:08,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 114 transitions, 1426 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:08,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:08,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 300 [2023-08-30 03:10:08,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:08,823 INFO L130 PetriNetUnfolder]: 1836/3198 cut-off events. [2023-08-30 03:10:08,823 INFO L131 PetriNetUnfolder]: For 16687/16690 co-relation queries the response was YES. [2023-08-30 03:10:08,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15839 conditions, 3198 events. 1836/3198 cut-off events. For 16687/16690 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19914 event pairs, 356 based on Foata normal form. 62/3174 useless extension candidates. Maximal degree in co-relation 15794. Up to 2984 conditions per place. [2023-08-30 03:10:08,843 INFO L137 encePairwiseOnDemand]: 295/300 looper letters, 140 selfloop transitions, 4 changer transitions 0/148 dead transitions. [2023-08-30 03:10:08,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 148 transitions, 2042 flow [2023-08-30 03:10:08,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:10:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:10:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-30 03:10:08,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44222222222222224 [2023-08-30 03:10:08,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-30 03:10:08,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-30 03:10:08,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:08,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-30 03:10:08,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:08,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:08,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:08,847 INFO L175 Difference]: Start difference. First operand has 127 places, 114 transitions, 1426 flow. Second operand 3 states and 398 transitions. [2023-08-30 03:10:08,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 148 transitions, 2042 flow [2023-08-30 03:10:08,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 148 transitions, 1973 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-30 03:10:08,921 INFO L231 Difference]: Finished difference. Result has 127 places, 117 transitions, 1393 flow [2023-08-30 03:10:08,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1393, PETRI_PLACES=127, PETRI_TRANSITIONS=117} [2023-08-30 03:10:08,921 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 58 predicate places. [2023-08-30 03:10:08,922 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 117 transitions, 1393 flow [2023-08-30 03:10:08,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:08,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:08,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:08,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 03:10:08,922 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:08,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:08,923 INFO L85 PathProgramCache]: Analyzing trace with hash 467345886, now seen corresponding path program 1 times [2023-08-30 03:10:08,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:10:08,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010597785] [2023-08-30 03:10:08,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:08,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:10:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:09,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-30 03:10:09,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:10:09,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010597785] [2023-08-30 03:10:09,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010597785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:09,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:09,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:10:09,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122636452] [2023-08-30 03:10:09,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:09,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:10:09,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:10:09,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:10:09,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:10:09,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 300 [2023-08-30 03:10:09,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 117 transitions, 1393 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:09,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:09,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 300 [2023-08-30 03:10:09,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:09,959 INFO L130 PetriNetUnfolder]: 3952/6636 cut-off events. [2023-08-30 03:10:09,960 INFO L131 PetriNetUnfolder]: For 41178/41178 co-relation queries the response was YES. [2023-08-30 03:10:09,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33782 conditions, 6636 events. 3952/6636 cut-off events. For 41178/41178 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 43602 event pairs, 572 based on Foata normal form. 10/6546 useless extension candidates. Maximal degree in co-relation 33736. Up to 2966 conditions per place. [2023-08-30 03:10:10,001 INFO L137 encePairwiseOnDemand]: 297/300 looper letters, 218 selfloop transitions, 4 changer transitions 66/288 dead transitions. [2023-08-30 03:10:10,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 288 transitions, 4068 flow [2023-08-30 03:10:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:10:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:10:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-30 03:10:10,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4475 [2023-08-30 03:10:10,003 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-30 03:10:10,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-30 03:10:10,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:10,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-30 03:10:10,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:10,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:10,006 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:10,006 INFO L175 Difference]: Start difference. First operand has 127 places, 117 transitions, 1393 flow. Second operand 4 states and 537 transitions. [2023-08-30 03:10:10,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 288 transitions, 4068 flow [2023-08-30 03:10:10,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 288 transitions, 4057 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 03:10:10,194 INFO L231 Difference]: Finished difference. Result has 131 places, 103 transitions, 1167 flow [2023-08-30 03:10:10,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1167, PETRI_PLACES=131, PETRI_TRANSITIONS=103} [2023-08-30 03:10:10,195 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 62 predicate places. [2023-08-30 03:10:10,195 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 103 transitions, 1167 flow [2023-08-30 03:10:10,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:10,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:10,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:10,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 03:10:10,196 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:10,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:10,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1533082737, now seen corresponding path program 1 times [2023-08-30 03:10:10,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:10:10,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434513331] [2023-08-30 03:10:10,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:10,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:10:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:10,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:10:10,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434513331] [2023-08-30 03:10:10,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434513331] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:10,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:10,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:10:10,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647300237] [2023-08-30 03:10:10,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:10,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:10:10,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:10:10,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:10:10,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:10:10,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 300 [2023-08-30 03:10:10,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 103 transitions, 1167 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:10,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:10,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 300 [2023-08-30 03:10:10,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:11,243 INFO L130 PetriNetUnfolder]: 3884/6869 cut-off events. [2023-08-30 03:10:11,244 INFO L131 PetriNetUnfolder]: For 38973/38991 co-relation queries the response was YES. [2023-08-30 03:10:11,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34916 conditions, 6869 events. 3884/6869 cut-off events. For 38973/38991 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 50067 event pairs, 1195 based on Foata normal form. 14/6681 useless extension candidates. Maximal degree in co-relation 34868. Up to 3027 conditions per place. [2023-08-30 03:10:11,281 INFO L137 encePairwiseOnDemand]: 296/300 looper letters, 268 selfloop transitions, 8 changer transitions 32/310 dead transitions. [2023-08-30 03:10:11,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 310 transitions, 4227 flow [2023-08-30 03:10:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:10:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:10:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2023-08-30 03:10:11,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.444 [2023-08-30 03:10:11,282 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2023-08-30 03:10:11,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2023-08-30 03:10:11,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:11,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2023-08-30 03:10:11,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 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-30 03:10:11,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:11,285 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:11,285 INFO L175 Difference]: Start difference. First operand has 131 places, 103 transitions, 1167 flow. Second operand 5 states and 666 transitions. [2023-08-30 03:10:11,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 310 transitions, 4227 flow [2023-08-30 03:10:11,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 310 transitions, 4215 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:10:11,502 INFO L231 Difference]: Finished difference. Result has 135 places, 105 transitions, 1204 flow [2023-08-30 03:10:11,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1204, PETRI_PLACES=135, PETRI_TRANSITIONS=105} [2023-08-30 03:10:11,502 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 66 predicate places. [2023-08-30 03:10:11,502 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 105 transitions, 1204 flow [2023-08-30 03:10:11,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:11,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:11,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:11,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 03:10:11,503 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:11,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:11,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1129567929, now seen corresponding path program 2 times [2023-08-30 03:10:11,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:10:11,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393747613] [2023-08-30 03:10:11,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:11,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:10:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:11,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:10:11,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393747613] [2023-08-30 03:10:11,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393747613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:11,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:11,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:10:11,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016922830] [2023-08-30 03:10:11,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:11,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:10:11,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:10:11,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:10:11,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:10:11,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 300 [2023-08-30 03:10:11,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 105 transitions, 1204 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:11,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:11,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 300 [2023-08-30 03:10:11,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:11,990 INFO L130 PetriNetUnfolder]: 949/2129 cut-off events. [2023-08-30 03:10:11,990 INFO L131 PetriNetUnfolder]: For 12215/12285 co-relation queries the response was YES. [2023-08-30 03:10:11,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11039 conditions, 2129 events. 949/2129 cut-off events. For 12215/12285 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15206 event pairs, 83 based on Foata normal form. 208/2233 useless extension candidates. Maximal degree in co-relation 10990. Up to 1347 conditions per place. [2023-08-30 03:10:12,002 INFO L137 encePairwiseOnDemand]: 295/300 looper letters, 127 selfloop transitions, 7 changer transitions 10/150 dead transitions. [2023-08-30 03:10:12,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 150 transitions, 1912 flow [2023-08-30 03:10:12,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:10:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:10:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-30 03:10:12,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2023-08-30 03:10:12,004 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-30 03:10:12,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-30 03:10:12,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:12,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-30 03:10:12,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,006 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,006 INFO L175 Difference]: Start difference. First operand has 135 places, 105 transitions, 1204 flow. Second operand 4 states and 528 transitions. [2023-08-30 03:10:12,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 150 transitions, 1912 flow [2023-08-30 03:10:12,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 150 transitions, 1849 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-30 03:10:12,039 INFO L231 Difference]: Finished difference. Result has 132 places, 89 transitions, 919 flow [2023-08-30 03:10:12,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=919, PETRI_PLACES=132, PETRI_TRANSITIONS=89} [2023-08-30 03:10:12,040 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 63 predicate places. [2023-08-30 03:10:12,040 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 89 transitions, 919 flow [2023-08-30 03:10:12,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:12,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:12,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 03:10:12,040 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:12,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash -498121549, now seen corresponding path program 1 times [2023-08-30 03:10:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:10:12,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785466712] [2023-08-30 03:10:12,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:12,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:10:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:12,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:10:12,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785466712] [2023-08-30 03:10:12,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785466712] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:12,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:12,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:10:12,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714841041] [2023-08-30 03:10:12,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:12,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:10:12,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:10:12,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:10:12,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:10:12,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 300 [2023-08-30 03:10:12,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 89 transitions, 919 flow. Second operand has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:12,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 300 [2023-08-30 03:10:12,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:12,429 INFO L130 PetriNetUnfolder]: 539/1113 cut-off events. [2023-08-30 03:10:12,430 INFO L131 PetriNetUnfolder]: For 6690/6799 co-relation queries the response was YES. [2023-08-30 03:10:12,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5958 conditions, 1113 events. 539/1113 cut-off events. For 6690/6799 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 7076 event pairs, 30 based on Foata normal form. 143/1183 useless extension candidates. Maximal degree in co-relation 5911. Up to 510 conditions per place. [2023-08-30 03:10:12,437 INFO L137 encePairwiseOnDemand]: 295/300 looper letters, 80 selfloop transitions, 10 changer transitions 17/111 dead transitions. [2023-08-30 03:10:12,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 111 transitions, 1322 flow [2023-08-30 03:10:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:10:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:10:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-08-30 03:10:12,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42933333333333334 [2023-08-30 03:10:12,438 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-08-30 03:10:12,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-08-30 03:10:12,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:12,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-08-30 03:10:12,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,441 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,441 INFO L175 Difference]: Start difference. First operand has 132 places, 89 transitions, 919 flow. Second operand 5 states and 644 transitions. [2023-08-30 03:10:12,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 111 transitions, 1322 flow [2023-08-30 03:10:12,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 111 transitions, 1101 flow, removed 36 selfloop flow, removed 22 redundant places. [2023-08-30 03:10:12,452 INFO L231 Difference]: Finished difference. Result has 100 places, 52 transitions, 429 flow [2023-08-30 03:10:12,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=429, PETRI_PLACES=100, PETRI_TRANSITIONS=52} [2023-08-30 03:10:12,453 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 31 predicate places. [2023-08-30 03:10:12,453 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 52 transitions, 429 flow [2023-08-30 03:10:12,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:12,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:12,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 03:10:12,454 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:12,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1311267892, now seen corresponding path program 1 times [2023-08-30 03:10:12,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:10:12,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693987660] [2023-08-30 03:10:12,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:10:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:12,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:10:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693987660] [2023-08-30 03:10:12,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693987660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:12,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:12,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:10:12,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583801659] [2023-08-30 03:10:12,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:12,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:10:12,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:10:12,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:10:12,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:10:12,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 300 [2023-08-30 03:10:12,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 52 transitions, 429 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:12,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 300 [2023-08-30 03:10:12,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:12,959 INFO L130 PetriNetUnfolder]: 811/1486 cut-off events. [2023-08-30 03:10:12,959 INFO L131 PetriNetUnfolder]: For 6706/6706 co-relation queries the response was YES. [2023-08-30 03:10:12,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7211 conditions, 1486 events. 811/1486 cut-off events. For 6706/6706 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8472 event pairs, 310 based on Foata normal form. 1/1487 useless extension candidates. Maximal degree in co-relation 7178. Up to 859 conditions per place. [2023-08-30 03:10:12,967 INFO L137 encePairwiseOnDemand]: 295/300 looper letters, 66 selfloop transitions, 3 changer transitions 61/130 dead transitions. [2023-08-30 03:10:12,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 130 transitions, 1376 flow [2023-08-30 03:10:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:10:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:10:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2023-08-30 03:10:12,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4077777777777778 [2023-08-30 03:10:12,969 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 734 transitions. [2023-08-30 03:10:12,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 734 transitions. [2023-08-30 03:10:12,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:12,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 734 transitions. [2023-08-30 03:10:12,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,971 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,972 INFO L175 Difference]: Start difference. First operand has 100 places, 52 transitions, 429 flow. Second operand 6 states and 734 transitions. [2023-08-30 03:10:12,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 130 transitions, 1376 flow [2023-08-30 03:10:12,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 130 transitions, 1280 flow, removed 29 selfloop flow, removed 4 redundant places. [2023-08-30 03:10:12,985 INFO L231 Difference]: Finished difference. Result has 95 places, 49 transitions, 387 flow [2023-08-30 03:10:12,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=95, PETRI_TRANSITIONS=49} [2023-08-30 03:10:12,986 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places. [2023-08-30 03:10:12,986 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 49 transitions, 387 flow [2023-08-30 03:10:12,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:12,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:12,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:12,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 03:10:12,987 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:12,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash -165208706, now seen corresponding path program 2 times [2023-08-30 03:10:12,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:10:12,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522200468] [2023-08-30 03:10:12,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:10:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:10:13,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:10:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:10:13,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 03:10:13,093 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:10:13,094 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (58 of 59 remaining) [2023-08-30 03:10:13,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2023-08-30 03:10:13,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2023-08-30 03:10:13,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2023-08-30 03:10:13,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2023-08-30 03:10:13,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2023-08-30 03:10:13,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2023-08-30 03:10:13,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 59 remaining) [2023-08-30 03:10:13,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 59 remaining) [2023-08-30 03:10:13,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2023-08-30 03:10:13,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2023-08-30 03:10:13,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2023-08-30 03:10:13,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2023-08-30 03:10:13,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2023-08-30 03:10:13,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2023-08-30 03:10:13,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2023-08-30 03:10:13,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2023-08-30 03:10:13,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (41 of 59 remaining) [2023-08-30 03:10:13,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 59 remaining) [2023-08-30 03:10:13,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 59 remaining) [2023-08-30 03:10:13,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 59 remaining) [2023-08-30 03:10:13,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 59 remaining) [2023-08-30 03:10:13,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 59 remaining) [2023-08-30 03:10:13,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 59 remaining) [2023-08-30 03:10:13,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 59 remaining) [2023-08-30 03:10:13,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 59 remaining) [2023-08-30 03:10:13,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 59 remaining) [2023-08-30 03:10:13,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 59 remaining) [2023-08-30 03:10:13,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 59 remaining) [2023-08-30 03:10:13,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 59 remaining) [2023-08-30 03:10:13,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 59 remaining) [2023-08-30 03:10:13,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 59 remaining) [2023-08-30 03:10:13,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 59 remaining) [2023-08-30 03:10:13,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 59 remaining) [2023-08-30 03:10:13,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (24 of 59 remaining) [2023-08-30 03:10:13,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 59 remaining) [2023-08-30 03:10:13,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 59 remaining) [2023-08-30 03:10:13,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 59 remaining) [2023-08-30 03:10:13,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 59 remaining) [2023-08-30 03:10:13,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 59 remaining) [2023-08-30 03:10:13,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 59 remaining) [2023-08-30 03:10:13,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 59 remaining) [2023-08-30 03:10:13,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 59 remaining) [2023-08-30 03:10:13,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 59 remaining) [2023-08-30 03:10:13,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 59 remaining) [2023-08-30 03:10:13,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 59 remaining) [2023-08-30 03:10:13,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 59 remaining) [2023-08-30 03:10:13,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 59 remaining) [2023-08-30 03:10:13,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 59 remaining) [2023-08-30 03:10:13,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 59 remaining) [2023-08-30 03:10:13,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 59 remaining) [2023-08-30 03:10:13,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 59 remaining) [2023-08-30 03:10:13,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 59 remaining) [2023-08-30 03:10:13,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 59 remaining) [2023-08-30 03:10:13,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 59 remaining) [2023-08-30 03:10:13,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 59 remaining) [2023-08-30 03:10:13,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 59 remaining) [2023-08-30 03:10:13,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 59 remaining) [2023-08-30 03:10:13,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 59 remaining) [2023-08-30 03:10:13,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-30 03:10:13,103 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:13,107 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:10:13,107 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:10:13,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:10:13 BasicIcfg [2023-08-30 03:10:13,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:10:13,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:10:13,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:10:13,149 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:10:13,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:09:39" (3/4) ... [2023-08-30 03:10:13,151 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:10:13,151 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:10:13,152 INFO L158 Benchmark]: Toolchain (without parser) took 35384.15ms. Allocated memory was 88.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 64.3MB in the beginning and 982.9MB in the end (delta: -918.6MB). Peak memory consumption was 457.7MB. Max. memory is 16.1GB. [2023-08-30 03:10:13,152 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 65.0MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:10:13,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.81ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 62.1MB in the end (delta: 2.0MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2023-08-30 03:10:13,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.51ms. Allocated memory is still 88.1MB. Free memory was 62.1MB in the beginning and 59.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:10:13,153 INFO L158 Benchmark]: Boogie Preprocessor took 45.07ms. Allocated memory is still 88.1MB. Free memory was 59.5MB in the beginning and 57.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:10:13,153 INFO L158 Benchmark]: RCFGBuilder took 900.41ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 57.0MB in the beginning and 44.4MB in the end (delta: 12.5MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2023-08-30 03:10:13,153 INFO L158 Benchmark]: TraceAbstraction took 33949.39ms. Allocated memory was 107.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 43.7MB in the beginning and 982.9MB in the end (delta: -939.2MB). Peak memory consumption was 416.6MB. Max. memory is 16.1GB. [2023-08-30 03:10:13,153 INFO L158 Benchmark]: Witness Printer took 2.33ms. Allocated memory is still 1.5GB. Free memory is still 982.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:10:13,154 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.14ms. Allocated memory is still 65.0MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.81ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 62.1MB in the end (delta: 2.0MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.51ms. Allocated memory is still 88.1MB. Free memory was 62.1MB in the beginning and 59.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.07ms. Allocated memory is still 88.1MB. Free memory was 59.5MB in the beginning and 57.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 900.41ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 57.0MB in the beginning and 44.4MB in the end (delta: 12.5MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * TraceAbstraction took 33949.39ms. Allocated memory was 107.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 43.7MB in the beginning and 982.9MB in the end (delta: -939.2MB). Peak memory consumption was 416.6MB. Max. memory is 16.1GB. * Witness Printer took 2.33ms. Allocated memory is still 1.5GB. Free memory is still 982.9MB. 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: 10.4s, 166 PlacesBefore, 69 PlacesAfterwards, 158 TransitionsBefore, 59 TransitionsAfterwards, 4876 CoEnabledTransitionPairs, 8 FixpointIterations, 64 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 139 TotalNumberOfCompositions, 19800 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6868, independent: 6425, independent conditional: 0, independent unconditional: 6425, dependent: 443, dependent conditional: 0, dependent unconditional: 443, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2168, independent: 2101, independent conditional: 0, independent unconditional: 2101, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6868, independent: 4324, independent conditional: 0, independent unconditional: 4324, dependent: 376, dependent conditional: 0, dependent unconditional: 376, unknown: 2168, unknown conditional: 0, unknown unconditional: 2168] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 259, Positive conditional cache size: 0, Positive unconditional cache size: 259, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L844] 0 pthread_t t2100; [L845] FCALL, FORK 0 pthread_create(&t2100, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2100, ((void *)0), P0, ((void *)0))=-2, t2100={6:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L846] 0 pthread_t t2101; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={6:0}, t2101={7:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L847] FCALL, FORK 0 pthread_create(&t2101, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2101, ((void *)0), P1, ((void *)0))=-1, t2100={6:0}, t2101={7:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, 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={3:0}] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, 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={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L792] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=8, weak$$choice1=1, weak$$choice2=1, x=1, 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={3:0}] [L795] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=8, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] [L848] 0 pthread_t t2102; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t2100={6:0}, t2101={7:0}, t2102={5:0}, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] [L849] FCALL, FORK 0 pthread_create(&t2102, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, pthread_create(&t2102, ((void *)0), P2, ((void *)0))=0, t2100={6:0}, t2101={7:0}, t2102={5:0}, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=8, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L810] 3 y$w_buff1 = y$w_buff0 [L811] 3 y$w_buff0 = 1 [L812] 3 y$w_buff1_used = y$w_buff0_used [L813] 3 y$w_buff0_used = (_Bool)1 [L814] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L814] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L815] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L816] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L817] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L818] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L819] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=8, weak$$choice1=1, weak$$choice2=1, x=2, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=8, weak$$choice1=1, weak$$choice2=1, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 \read(y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100={6:0}, t2101={7:0}, t2102={5:0}, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 206 locations, 59 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: 33.8s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2270 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1708 mSDsluCounter, 1023 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 791 mSDsCounter, 297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4930 IncrementalHoareTripleChecker+Invalid, 5227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 297 mSolverCounterUnsat, 232 mSDtfsCounter, 4930 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1426occurred in iteration=19, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 2662 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:10:13,175 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/safe014_power.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 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:10:15,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:10:15,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:10:15,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:10:15,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:10:15,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:10:15,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:10:15,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:10:15,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:10:15,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:10:15,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:10:15,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:10:15,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:10:15,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:10:15,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:10:15,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:10:15,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:10:15,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:10:15,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:10:15,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:10:15,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:10:15,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:10:15,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:10:15,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:10:15,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:10:15,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:10:15,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:10:15,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:10:15,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:10:15,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:10:15,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:10:15,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:10:15,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:10:15,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:10:15,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:10:15,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:10:15,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:10:15,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:10:15,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:10:15,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:10:15,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:10:15,261 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 03:10:15,297 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:10:15,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:10:15,298 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:10:15,298 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:10:15,299 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:10:15,299 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:10:15,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:10:15,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:10:15,300 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:10:15,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:10:15,301 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:10:15,301 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:10:15,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:10:15,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:10:15,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:10:15,302 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:10:15,302 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:10:15,302 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:10:15,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:10:15,302 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:10:15,302 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 03:10:15,303 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 03:10:15,303 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:10:15,303 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:10:15,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:10:15,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:10:15,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:10:15,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:10:15,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:10:15,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:10:15,304 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 03:10:15,304 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 03:10:15,304 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:10:15,305 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:10:15,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:10:15,305 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 03:10:15,305 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:10:15,305 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 -> 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:10:15,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:10:15,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:10:15,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:10:15,616 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:10:15,616 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:10:15,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2023-08-30 03:10:16,690 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:10:16,890 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:10:16,890 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2023-08-30 03:10:16,905 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8622f94/1f824adf3c884bdf9914d93ab2c41581/FLAG1dae301ff [2023-08-30 03:10:16,917 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8622f94/1f824adf3c884bdf9914d93ab2c41581 [2023-08-30 03:10:16,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:10:16,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:10:16,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:10:16,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:10:16,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:10:16,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:10:16" (1/1) ... [2023-08-30 03:10:16,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ae41f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:16, skipping insertion in model container [2023-08-30 03:10:16,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:10:16" (1/1) ... [2023-08-30 03:10:16,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:10:16,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:10:17,107 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/safe014_power.opt.i[994,1007] [2023-08-30 03:10:17,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:10:17,269 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:10:17,282 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/safe014_power.opt.i[994,1007] [2023-08-30 03:10:17,327 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:10:17,349 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:10:17,349 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:10:17,354 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:10:17,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:17 WrapperNode [2023-08-30 03:10:17,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:10:17,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:10:17,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:10:17,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:10:17,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:17" (1/1) ... [2023-08-30 03:10:17,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:17" (1/1) ... [2023-08-30 03:10:17,402 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 182 [2023-08-30 03:10:17,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:10:17,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:10:17,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:10:17,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:10:17,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:17" (1/1) ... [2023-08-30 03:10:17,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:17" (1/1) ... [2023-08-30 03:10:17,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:17" (1/1) ... [2023-08-30 03:10:17,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:17" (1/1) ... [2023-08-30 03:10:17,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:17" (1/1) ... [2023-08-30 03:10:17,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:17" (1/1) ... [2023-08-30 03:10:17,421 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:17" (1/1) ... [2023-08-30 03:10:17,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:17" (1/1) ... [2023-08-30 03:10:17,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:10:17,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:10:17,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:10:17,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:10:17,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:17" (1/1) ... [2023-08-30 03:10:17,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:10:17,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:10:17,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:10:17,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:10:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 03:10:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:10:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:10:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:10:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:10:17,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 03:10:17,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 03:10:17,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-30 03:10:17,487 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:10:17,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:10:17,487 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:10:17,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:10:17,487 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:10:17,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:10:17,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:10:17,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:10:17,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:10:17,489 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:10:17,685 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:10:17,686 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:10:18,109 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:10:18,484 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:10:18,485 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:10:18,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:10:18 BoogieIcfgContainer [2023-08-30 03:10:18,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:10:18,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:10:18,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:10:18,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:10:18,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:10:16" (1/3) ... [2023-08-30 03:10:18,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d6f53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:10:18, skipping insertion in model container [2023-08-30 03:10:18,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:17" (2/3) ... [2023-08-30 03:10:18,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d6f53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:10:18, skipping insertion in model container [2023-08-30 03:10:18,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:10:18" (3/3) ... [2023-08-30 03:10:18,492 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.opt.i [2023-08-30 03:10:18,506 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:10:18,506 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-08-30 03:10:18,507 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:10:18,605 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:10:18,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 162 transitions, 339 flow [2023-08-30 03:10:18,716 INFO L130 PetriNetUnfolder]: 2/159 cut-off events. [2023-08-30 03:10:18,716 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:10:18,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 159 events. 2/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 211 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2023-08-30 03:10:18,720 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 162 transitions, 339 flow [2023-08-30 03:10:18,727 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 159 transitions, 327 flow [2023-08-30 03:10:18,730 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:10:18,740 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 159 transitions, 327 flow [2023-08-30 03:10:18,743 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 159 transitions, 327 flow [2023-08-30 03:10:18,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 159 transitions, 327 flow [2023-08-30 03:10:18,788 INFO L130 PetriNetUnfolder]: 2/159 cut-off events. [2023-08-30 03:10:18,792 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:10:18,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 159 events. 2/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 209 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2023-08-30 03:10:18,795 INFO L119 LiptonReduction]: Number of co-enabled transitions 4876 [2023-08-30 03:10:36,618 INFO L134 LiptonReduction]: Checked pairs total: 20484 [2023-08-30 03:10:36,619 INFO L136 LiptonReduction]: Total number of compositions: 145 [2023-08-30 03:10:36,635 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:10:36,640 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;@49ee0de7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:10:36,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-08-30 03:10:36,641 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:10:36,641 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:10:36,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:36,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:10:36,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:36,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:36,646 INFO L85 PathProgramCache]: Analyzing trace with hash 961, now seen corresponding path program 1 times [2023-08-30 03:10:36,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:10:36,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128907403] [2023-08-30 03:10:36,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:36,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:36,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:10:36,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:10:36,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 03:10:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:36,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 03:10:36,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:10:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:36,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:10:36,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:10:36,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128907403] [2023-08-30 03:10:36,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128907403] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:36,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:36,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:10:36,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317761016] [2023-08-30 03:10:36,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:36,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:10:36,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:10:36,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:10:36,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:10:36,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 307 [2023-08-30 03:10:36,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 131 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:36,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:36,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 307 [2023-08-30 03:10:36,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:37,845 INFO L130 PetriNetUnfolder]: 5254/7577 cut-off events. [2023-08-30 03:10:37,845 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:10:37,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15189 conditions, 7577 events. 5254/7577 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 43449 event pairs, 5254 based on Foata normal form. 0/4322 useless extension candidates. Maximal degree in co-relation 15178. Up to 7566 conditions per place. [2023-08-30 03:10:37,878 INFO L137 encePairwiseOnDemand]: 286/307 looper letters, 37 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-08-30 03:10:37,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 161 flow [2023-08-30 03:10:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:10:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:10:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 306 transitions. [2023-08-30 03:10:37,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498371335504886 [2023-08-30 03:10:37,887 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 306 transitions. [2023-08-30 03:10:37,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 306 transitions. [2023-08-30 03:10:37,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:37,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 306 transitions. [2023-08-30 03:10:37,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.0) internal successors, (306), 2 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-30 03:10:37,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:37,894 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:37,895 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 131 flow. Second operand 2 states and 306 transitions. [2023-08-30 03:10:37,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 161 flow [2023-08-30 03:10:37,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:10:37,899 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 84 flow [2023-08-30 03:10:37,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-30 03:10:37,902 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2023-08-30 03:10:37,902 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 84 flow [2023-08-30 03:10:37,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:37,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:37,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:10:37,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 03:10:38,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:38,110 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:38,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:38,111 INFO L85 PathProgramCache]: Analyzing trace with hash 949565, now seen corresponding path program 1 times [2023-08-30 03:10:38,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:10:38,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810345425] [2023-08-30 03:10:38,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:38,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:38,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:10:38,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:10:38,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 03:10:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:38,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:10:38,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:10:38,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 03:10:38,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 03:10:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:38,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:10:38,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:10:38,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810345425] [2023-08-30 03:10:38,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810345425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:38,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:38,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:10:38,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642128089] [2023-08-30 03:10:38,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:38,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:10:38,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:10:38,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:10:38,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:10:38,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 307 [2023-08-30 03:10:38,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:38,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:38,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 307 [2023-08-30 03:10:38,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:38,866 INFO L130 PetriNetUnfolder]: 2825/4132 cut-off events. [2023-08-30 03:10:38,866 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:10:38,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8291 conditions, 4132 events. 2825/4132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 21995 event pairs, 2825 based on Foata normal form. 0/2759 useless extension candidates. Maximal degree in co-relation 8288. Up to 4122 conditions per place. [2023-08-30 03:10:38,883 INFO L137 encePairwiseOnDemand]: 301/307 looper letters, 31 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-30 03:10:38,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 138 flow [2023-08-30 03:10:38,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:10:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:10:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-08-30 03:10:38,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44408251900108575 [2023-08-30 03:10:38,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-08-30 03:10:38,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-08-30 03:10:38,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:38,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-08-30 03:10:38,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:38,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:38,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:38,891 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 84 flow. Second operand 3 states and 409 transitions. [2023-08-30 03:10:38,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 138 flow [2023-08-30 03:10:38,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:10:38,892 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-08-30 03:10:38,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-30 03:10:38,892 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -26 predicate places. [2023-08-30 03:10:38,892 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-08-30 03:10:38,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:38,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:38,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:10:38,902 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 (3)] Forceful destruction successful, exit code 0 [2023-08-30 03:10:39,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:39,101 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:39,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:39,101 INFO L85 PathProgramCache]: Analyzing trace with hash 949564, now seen corresponding path program 1 times [2023-08-30 03:10:39,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:10:39,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837139096] [2023-08-30 03:10:39,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:39,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:39,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:10:39,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:10:39,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 03:10:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:39,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:10:39,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:10:39,230 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-30 03:10:39,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-30 03:10:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:39,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:10:39,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:10:39,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837139096] [2023-08-30 03:10:39,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837139096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:39,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:39,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:10:39,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553298063] [2023-08-30 03:10:39,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:39,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:10:39,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:10:39,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:10:39,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:10:39,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 307 [2023-08-30 03:10:39,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:39,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:39,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 307 [2023-08-30 03:10:39,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:39,763 INFO L130 PetriNetUnfolder]: 1646/2453 cut-off events. [2023-08-30 03:10:39,763 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:10:39,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4929 conditions, 2453 events. 1646/2453 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 12254 event pairs, 958 based on Foata normal form. 0/1888 useless extension candidates. Maximal degree in co-relation 4925. Up to 1223 conditions per place. [2023-08-30 03:10:39,774 INFO L137 encePairwiseOnDemand]: 300/307 looper letters, 37 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-08-30 03:10:39,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 168 flow [2023-08-30 03:10:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:10:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:10:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-30 03:10:39,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44191096634093374 [2023-08-30 03:10:39,776 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-30 03:10:39,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-30 03:10:39,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:39,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-30 03:10:39,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:39,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:39,779 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:39,779 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 407 transitions. [2023-08-30 03:10:39,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 168 flow [2023-08-30 03:10:39,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:10:39,780 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 83 flow [2023-08-30 03:10:39,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-08-30 03:10:39,781 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -26 predicate places. [2023-08-30 03:10:39,781 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 83 flow [2023-08-30 03:10:39,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:39,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:39,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:39,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-08-30 03:10:39,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:39,989 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:39,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:39,989 INFO L85 PathProgramCache]: Analyzing trace with hash -846165645, now seen corresponding path program 1 times [2023-08-30 03:10:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:10:39,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136889156] [2023-08-30 03:10:39,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:39,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:39,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:10:39,991 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:10:39,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 03:10:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:40,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:10:40,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:10:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:40,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:10:40,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:10:40,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136889156] [2023-08-30 03:10:40,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136889156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:40,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:40,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:10:40,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636506631] [2023-08-30 03:10:40,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:40,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:10:40,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:10:40,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:10:40,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:10:40,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 307 [2023-08-30 03:10:40,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:40,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:40,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 307 [2023-08-30 03:10:40,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:40,492 INFO L130 PetriNetUnfolder]: 1395/2091 cut-off events. [2023-08-30 03:10:40,492 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2023-08-30 03:10:40,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4477 conditions, 2091 events. 1395/2091 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10619 event pairs, 434 based on Foata normal form. 0/1820 useless extension candidates. Maximal degree in co-relation 4472. Up to 1391 conditions per place. [2023-08-30 03:10:40,499 INFO L137 encePairwiseOnDemand]: 304/307 looper letters, 42 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-30 03:10:40,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 204 flow [2023-08-30 03:10:40,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:10:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:10:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-30 03:10:40,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4495114006514658 [2023-08-30 03:10:40,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-30 03:10:40,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-30 03:10:40,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:40,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-30 03:10:40,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 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-30 03:10:40,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:40,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:40,503 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 83 flow. Second operand 3 states and 414 transitions. [2023-08-30 03:10:40,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 204 flow [2023-08-30 03:10:40,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:10:40,505 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 81 flow [2023-08-30 03:10:40,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-08-30 03:10:40,505 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -27 predicate places. [2023-08-30 03:10:40,506 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 81 flow [2023-08-30 03:10:40,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:40,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:40,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:40,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 03:10:40,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:40,714 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:40,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:40,714 INFO L85 PathProgramCache]: Analyzing trace with hash -461241166, now seen corresponding path program 1 times [2023-08-30 03:10:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:10:40,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787865451] [2023-08-30 03:10:40,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:40,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:40,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:10:40,716 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:10:40,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 03:10:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:40,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:10:40,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:10:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:40,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:10:40,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:10:40,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787865451] [2023-08-30 03:10:40,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787865451] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:40,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:40,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:10:40,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436466390] [2023-08-30 03:10:40,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:40,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:10:40,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:10:40,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:10:40,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:10:40,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 307 [2023-08-30 03:10:40,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:40,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:40,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 307 [2023-08-30 03:10:40,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:41,033 INFO L130 PetriNetUnfolder]: 695/1149 cut-off events. [2023-08-30 03:10:41,033 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2023-08-30 03:10:41,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2501 conditions, 1149 events. 695/1149 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5289 event pairs, 206 based on Foata normal form. 16/1003 useless extension candidates. Maximal degree in co-relation 2496. Up to 1081 conditions per place. [2023-08-30 03:10:41,038 INFO L137 encePairwiseOnDemand]: 302/307 looper letters, 39 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-30 03:10:41,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 201 flow [2023-08-30 03:10:41,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:10:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:10:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-08-30 03:10:41,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4386536373507057 [2023-08-30 03:10:41,039 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-08-30 03:10:41,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-08-30 03:10:41,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:41,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-08-30 03:10:41,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:41,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:41,042 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:41,042 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 81 flow. Second operand 3 states and 404 transitions. [2023-08-30 03:10:41,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 201 flow [2023-08-30 03:10:41,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:10:41,044 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 103 flow [2023-08-30 03:10:41,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-30 03:10:41,045 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -26 predicate places. [2023-08-30 03:10:41,045 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 103 flow [2023-08-30 03:10:41,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:41,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:41,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:41,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 03:10:41,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:41,253 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:41,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:41,254 INFO L85 PathProgramCache]: Analyzing trace with hash 400094429, now seen corresponding path program 1 times [2023-08-30 03:10:41,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:10:41,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096114523] [2023-08-30 03:10:41,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:41,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:41,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:10:41,257 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:10:41,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 03:10:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:41,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:10:41,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:10:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:41,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:10:41,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:10:41,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096114523] [2023-08-30 03:10:41,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096114523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:41,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:41,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:10:41,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926217168] [2023-08-30 03:10:41,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:41,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:10:41,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:10:41,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:10:41,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:10:41,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 307 [2023-08-30 03:10:41,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:41,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:41,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 307 [2023-08-30 03:10:41,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:41,554 INFO L130 PetriNetUnfolder]: 183/373 cut-off events. [2023-08-30 03:10:41,554 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2023-08-30 03:10:41,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 373 events. 183/373 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1386 event pairs, 47 based on Foata normal form. 20/347 useless extension candidates. Maximal degree in co-relation 923. Up to 225 conditions per place. [2023-08-30 03:10:41,555 INFO L137 encePairwiseOnDemand]: 302/307 looper letters, 47 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2023-08-30 03:10:41,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 267 flow [2023-08-30 03:10:41,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:10:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:10:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2023-08-30 03:10:41,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43566775244299677 [2023-08-30 03:10:41,557 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2023-08-30 03:10:41,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2023-08-30 03:10:41,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:41,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2023-08-30 03:10:41,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:41,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:41,560 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:41,560 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 103 flow. Second operand 4 states and 535 transitions. [2023-08-30 03:10:41,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 267 flow [2023-08-30 03:10:41,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:10:41,562 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 139 flow [2023-08-30 03:10:41,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-30 03:10:41,562 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2023-08-30 03:10:41,562 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 139 flow [2023-08-30 03:10:41,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:41,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:41,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:41,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 03:10:41,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:41,771 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:41,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1651118841, now seen corresponding path program 1 times [2023-08-30 03:10:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:10:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176783045] [2023-08-30 03:10:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:41,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:41,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:10:41,773 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:10:41,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 03:10:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:41,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:10:41,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:10:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:41,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:10:41,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:10:41,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176783045] [2023-08-30 03:10:41,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176783045] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:41,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:41,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:10:41,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814162458] [2023-08-30 03:10:41,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:41,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:10:41,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:10:41,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:10:41,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:10:41,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 307 [2023-08-30 03:10:41,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:41,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:41,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 307 [2023-08-30 03:10:41,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:42,190 INFO L130 PetriNetUnfolder]: 94/192 cut-off events. [2023-08-30 03:10:42,191 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-08-30 03:10:42,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 192 events. 94/192 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 580 event pairs, 28 based on Foata normal form. 8/193 useless extension candidates. Maximal degree in co-relation 552. Up to 80 conditions per place. [2023-08-30 03:10:42,191 INFO L137 encePairwiseOnDemand]: 302/307 looper letters, 40 selfloop transitions, 10 changer transitions 1/53 dead transitions. [2023-08-30 03:10:42,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 273 flow [2023-08-30 03:10:42,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:10:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:10:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-08-30 03:10:42,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4247557003257329 [2023-08-30 03:10:42,194 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-08-30 03:10:42,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-08-30 03:10:42,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:42,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-08-30 03:10:42,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:42,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 307.0) internal successors, (1842), 6 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:42,198 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 307.0) internal successors, (1842), 6 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:42,198 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 139 flow. Second operand 5 states and 652 transitions. [2023-08-30 03:10:42,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 273 flow [2023-08-30 03:10:42,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 257 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 03:10:42,200 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-08-30 03:10:42,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-30 03:10:42,200 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -24 predicate places. [2023-08-30 03:10:42,201 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-08-30 03:10:42,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:42,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:42,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:42,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 03:10:42,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:42,411 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:42,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:42,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1024070399, now seen corresponding path program 1 times [2023-08-30 03:10:42,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:10:42,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909600635] [2023-08-30 03:10:42,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:10:42,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:42,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:10:42,414 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:10:42,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 03:10:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:10:42,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:10:42,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:10:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:10:42,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:10:42,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:10:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909600635] [2023-08-30 03:10:42,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909600635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:10:42,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:10:42,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:10:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134809601] [2023-08-30 03:10:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:10:42,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:10:42,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:10:42,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:10:42,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:10:42,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 307 [2023-08-30 03:10:42,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:42,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:10:42,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 307 [2023-08-30 03:10:42,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:10:42,797 INFO L130 PetriNetUnfolder]: 170/331 cut-off events. [2023-08-30 03:10:42,797 INFO L131 PetriNetUnfolder]: For 442/442 co-relation queries the response was YES. [2023-08-30 03:10:42,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 331 events. 170/331 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1297 event pairs, 81 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 981. Up to 186 conditions per place. [2023-08-30 03:10:42,799 INFO L137 encePairwiseOnDemand]: 303/307 looper letters, 67 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2023-08-30 03:10:42,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 463 flow [2023-08-30 03:10:42,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:10:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:10:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-30 03:10:42,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4241042345276873 [2023-08-30 03:10:42,801 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-30 03:10:42,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-30 03:10:42,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:10:42,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-30 03:10:42,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:42,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 307.0) internal successors, (1842), 6 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:42,805 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 307.0) internal successors, (1842), 6 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:42,805 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 5 states and 651 transitions. [2023-08-30 03:10:42,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 463 flow [2023-08-30 03:10:42,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 401 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 03:10:42,807 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 131 flow [2023-08-30 03:10:42,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-30 03:10:42,808 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -22 predicate places. [2023-08-30 03:10:42,808 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 131 flow [2023-08-30 03:10:42,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:10:42,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:10:42,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:42,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 03:10:43,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:43,020 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-08-30 03:10:43,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:10:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1348664643, now seen corresponding path program 2 times [2023-08-30 03:10:43,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:10:43,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113319821] [2023-08-30 03:10:43,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 03:10:43,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:43,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:10:43,022 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:10:43,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 03:10:43,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:10:43,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 03:10:43,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:10:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:10:43,341 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 03:10:43,341 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:10:43,342 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (58 of 59 remaining) [2023-08-30 03:10:43,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2023-08-30 03:10:43,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2023-08-30 03:10:43,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2023-08-30 03:10:43,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2023-08-30 03:10:43,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2023-08-30 03:10:43,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2023-08-30 03:10:43,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 59 remaining) [2023-08-30 03:10:43,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 59 remaining) [2023-08-30 03:10:43,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2023-08-30 03:10:43,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2023-08-30 03:10:43,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2023-08-30 03:10:43,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2023-08-30 03:10:43,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2023-08-30 03:10:43,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2023-08-30 03:10:43,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2023-08-30 03:10:43,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2023-08-30 03:10:43,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (41 of 59 remaining) [2023-08-30 03:10:43,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 59 remaining) [2023-08-30 03:10:43,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 59 remaining) [2023-08-30 03:10:43,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 59 remaining) [2023-08-30 03:10:43,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 59 remaining) [2023-08-30 03:10:43,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 59 remaining) [2023-08-30 03:10:43,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 59 remaining) [2023-08-30 03:10:43,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 59 remaining) [2023-08-30 03:10:43,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 59 remaining) [2023-08-30 03:10:43,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 59 remaining) [2023-08-30 03:10:43,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 59 remaining) [2023-08-30 03:10:43,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 59 remaining) [2023-08-30 03:10:43,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 59 remaining) [2023-08-30 03:10:43,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 59 remaining) [2023-08-30 03:10:43,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 59 remaining) [2023-08-30 03:10:43,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 59 remaining) [2023-08-30 03:10:43,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 59 remaining) [2023-08-30 03:10:43,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (24 of 59 remaining) [2023-08-30 03:10:43,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 59 remaining) [2023-08-30 03:10:43,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 59 remaining) [2023-08-30 03:10:43,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 59 remaining) [2023-08-30 03:10:43,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 59 remaining) [2023-08-30 03:10:43,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 59 remaining) [2023-08-30 03:10:43,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 59 remaining) [2023-08-30 03:10:43,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 59 remaining) [2023-08-30 03:10:43,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 59 remaining) [2023-08-30 03:10:43,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 59 remaining) [2023-08-30 03:10:43,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 59 remaining) [2023-08-30 03:10:43,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 59 remaining) [2023-08-30 03:10:43,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 59 remaining) [2023-08-30 03:10:43,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 59 remaining) [2023-08-30 03:10:43,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 59 remaining) [2023-08-30 03:10:43,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 59 remaining) [2023-08-30 03:10:43,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 59 remaining) [2023-08-30 03:10:43,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 59 remaining) [2023-08-30 03:10:43,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 59 remaining) [2023-08-30 03:10:43,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 59 remaining) [2023-08-30 03:10:43,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 59 remaining) [2023-08-30 03:10:43,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 59 remaining) [2023-08-30 03:10:43,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 59 remaining) [2023-08-30 03:10:43,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 59 remaining) [2023-08-30 03:10:43,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 59 remaining) [2023-08-30 03:10:43,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-30 03:10:43,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:10:43,560 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:10:43,566 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:10:43,566 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:10:43,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:10:43 BasicIcfg [2023-08-30 03:10:43,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:10:43,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:10:43,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:10:43,689 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:10:43,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:10:18" (3/4) ... [2023-08-30 03:10:43,691 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:10:43,691 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:10:43,692 INFO L158 Benchmark]: Toolchain (without parser) took 26767.99ms. Allocated memory was 65.0MB in the beginning and 960.5MB in the end (delta: 895.5MB). Free memory was 34.2MB in the beginning and 720.7MB in the end (delta: -686.5MB). Peak memory consumption was 208.1MB. Max. memory is 16.1GB. [2023-08-30 03:10:43,692 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory was 30.8MB in the beginning and 30.8MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:10:43,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.59ms. Allocated memory is still 65.0MB. Free memory was 34.1MB in the beginning and 37.5MB in the end (delta: -3.5MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2023-08-30 03:10:43,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.10ms. Allocated memory is still 65.0MB. Free memory was 37.3MB in the beginning and 34.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:10:43,693 INFO L158 Benchmark]: Boogie Preprocessor took 22.32ms. Allocated memory is still 65.0MB. Free memory was 34.8MB in the beginning and 32.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:10:43,693 INFO L158 Benchmark]: RCFGBuilder took 1060.76ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 32.2MB in the beginning and 66.8MB in the end (delta: -34.6MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2023-08-30 03:10:43,693 INFO L158 Benchmark]: TraceAbstraction took 25200.10ms. Allocated memory was 96.5MB in the beginning and 960.5MB in the end (delta: 864.0MB). Free memory was 66.5MB in the beginning and 721.7MB in the end (delta: -655.3MB). Peak memory consumption was 209.8MB. Max. memory is 16.1GB. [2023-08-30 03:10:43,694 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 960.5MB. Free memory is still 720.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:10:43,695 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.15ms. Allocated memory is still 52.4MB. Free memory was 30.8MB in the beginning and 30.8MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.59ms. Allocated memory is still 65.0MB. Free memory was 34.1MB in the beginning and 37.5MB in the end (delta: -3.5MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.10ms. Allocated memory is still 65.0MB. Free memory was 37.3MB in the beginning and 34.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.32ms. Allocated memory is still 65.0MB. Free memory was 34.8MB in the beginning and 32.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1060.76ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 32.2MB in the beginning and 66.8MB in the end (delta: -34.6MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25200.10ms. Allocated memory was 96.5MB in the beginning and 960.5MB in the end (delta: 864.0MB). Free memory was 66.5MB in the beginning and 721.7MB in the end (delta: -655.3MB). Peak memory consumption was 209.8MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 960.5MB. Free memory is still 720.7MB. 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: 17.9s, 167 PlacesBefore, 70 PlacesAfterwards, 159 TransitionsBefore, 61 TransitionsAfterwards, 4876 CoEnabledTransitionPairs, 8 FixpointIterations, 69 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 145 TotalNumberOfCompositions, 20484 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7077, independent: 6624, independent conditional: 0, independent unconditional: 6624, dependent: 453, dependent conditional: 0, dependent unconditional: 453, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2156, independent: 2092, independent conditional: 0, independent unconditional: 2092, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7077, independent: 4532, independent conditional: 0, independent unconditional: 4532, dependent: 389, dependent conditional: 0, dependent unconditional: 389, unknown: 2156, unknown conditional: 0, unknown unconditional: 2156] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 271, Positive conditional cache size: 0, Positive unconditional cache size: 271, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L844] 0 pthread_t t2100; [L845] FCALL, FORK 0 pthread_create(&t2100, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2100, ((void *)0), P0, ((void *)0))=0, t2100={7:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L846] 0 pthread_t t2101; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={7:0}, t2101={14:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 \read(y) [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=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={3:0}] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=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={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L847] FCALL, FORK 0 pthread_create(&t2101, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2101, ((void *)0), P1, ((void *)0))=1, t2100={7:0}, t2101={14:0}, weak$$choice0=2, weak$$choice1=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={3:0}] [L848] 0 pthread_t t2102; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={7:0}, t2101={14:0}, t2102={15:0}, weak$$choice0=2, weak$$choice1=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={3:0}] [L792] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=2, weak$$choice1=0, weak$$choice2=0, x=1, 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={3:0}] [L795] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=2, weak$$choice1=0, weak$$choice2=0, x=2, 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={3:0}] [L849] FCALL, FORK 0 pthread_create(&t2102, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, pthread_create(&t2102, ((void *)0), P2, ((void *)0))=2, t2100={7:0}, t2101={14:0}, t2102={15:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, 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={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=2, weak$$choice1=0, weak$$choice2=0, x=2, 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={3:0}] [L810] 3 y$w_buff1 = y$w_buff0 [L811] 3 y$w_buff0 = 1 [L812] 3 y$w_buff1_used = y$w_buff0_used [L813] 3 y$w_buff0_used = (_Bool)1 [L814] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L814] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L815] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L816] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L817] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L818] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L819] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=2, weak$$choice1=0, weak$$choice2=0, x=2, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=2, weak$$choice1=0, weak$$choice2=0, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 \read(y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100={7:0}, t2101={14:0}, t2102={15:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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$$choice0=2, weak$$choice1=2, weak$$choice2=0, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 207 locations, 59 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: 24.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 237 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 720 IncrementalHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 5 mSDtfsCounter, 720 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=6, InterpolantAutomatonStates: 28, 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.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 224 SizeOfPredicates, 3 NumberOfNonLiveVariables, 933 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:10:43,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample