./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/safe002_rmo.oepc.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 303fb09b32b7ab2953a798b1c14f8a25fd3d0e1788678487baddbc8a976b0d5f --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:35:23,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:35:23,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:35:23,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:35:23,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:35:23,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:35:23,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:35:23,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:35:23,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:35:23,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:35:23,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:35:23,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:35:23,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:35:23,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:35:23,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:35:23,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:35:23,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:35:23,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:35:23,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:35:23,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:35:23,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:35:23,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:35:23,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:35:23,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:35:23,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:35:23,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:35:23,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:35:23,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:35:23,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:35:23,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:35:23,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:35:23,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:35:23,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:35:23,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:35:23,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:35:23,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:35:23,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:35:23,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:35:23,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:35:23,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:35:23,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:35:23,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:35:23,788 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:35:23,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:35:23,789 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:35:23,789 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:35:23,790 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:35:23,790 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:35:23,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:35:23,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:35:23,792 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:35:23,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:35:23,792 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:35:23,792 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:35:23,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:35:23,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:35:23,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:35:23,793 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:35:23,794 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:35:23,794 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:35:23,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:35:23,794 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:35:23,794 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:35:23,795 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:35:23,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:35:23,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:35:23,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:35:23,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:35:23,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:35:23,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:35:23,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:35:23,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:35:23,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:35:23,797 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:35:23,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:35:23,798 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:35:23,798 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 -> 303fb09b32b7ab2953a798b1c14f8a25fd3d0e1788678487baddbc8a976b0d5f 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 -> AFTER [2023-08-29 20:35:24,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:35:24,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:35:24,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:35:24,152 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:35:24,152 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:35:24,153 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2023-08-29 20:35:25,427 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:35:25,678 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:35:25,679 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2023-08-29 20:35:25,705 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/481a212e6/2085761acc0e4cf5a19ed8ba2898d1ad/FLAG17680d02d [2023-08-29 20:35:25,716 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/481a212e6/2085761acc0e4cf5a19ed8ba2898d1ad [2023-08-29 20:35:25,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:35:25,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:35:25,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:35:25,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:35:25,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:35:25,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:35:25" (1/1) ... [2023-08-29 20:35:25,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60221fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:25, skipping insertion in model container [2023-08-29 20:35:25,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:35:25" (1/1) ... [2023-08-29 20:35:25,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:35:25,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:35:25,940 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/safe002_rmo.oepc.i[993,1006] [2023-08-29 20:35:26,183 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:35:26,197 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:35:26,209 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/safe002_rmo.oepc.i[993,1006] [2023-08-29 20:35:26,270 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:35:26,309 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:35:26,309 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:35:26,315 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:35:26,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:26 WrapperNode [2023-08-29 20:35:26,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:35:26,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:35:26,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:35:26,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:35:26,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:26" (1/1) ... [2023-08-29 20:35:26,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:26" (1/1) ... [2023-08-29 20:35:26,387 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2023-08-29 20:35:26,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:35:26,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:35:26,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:35:26,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:35:26,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:26" (1/1) ... [2023-08-29 20:35:26,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:26" (1/1) ... [2023-08-29 20:35:26,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:26" (1/1) ... [2023-08-29 20:35:26,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:26" (1/1) ... [2023-08-29 20:35:26,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:26" (1/1) ... [2023-08-29 20:35:26,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:26" (1/1) ... [2023-08-29 20:35:26,413 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:26" (1/1) ... [2023-08-29 20:35:26,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:26" (1/1) ... [2023-08-29 20:35:26,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:35:26,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:35:26,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:35:26,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:35:26,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:26" (1/1) ... [2023-08-29 20:35:26,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:35:26,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:35:26,462 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-29 20:35:26,488 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-29 20:35:26,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 20:35:26,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:35:26,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:35:26,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:35:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:35:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:35:26,502 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:35:26,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:35:26,502 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:35:26,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:35:26,502 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:35:26,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:35:26,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:35:26,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:35:26,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:35:26,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:35:26,504 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:35:26,633 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:35:26,635 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:35:27,174 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:35:27,785 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:35:27,785 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:35:27,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:35:27 BoogieIcfgContainer [2023-08-29 20:35:27,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:35:27,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:35:27,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:35:27,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:35:27,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:35:25" (1/3) ... [2023-08-29 20:35:27,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d9b7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:35:27, skipping insertion in model container [2023-08-29 20:35:27,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:26" (2/3) ... [2023-08-29 20:35:27,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d9b7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:35:27, skipping insertion in model container [2023-08-29 20:35:27,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:35:27" (3/3) ... [2023-08-29 20:35:27,794 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_rmo.oepc.i [2023-08-29 20:35:27,809 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:35:27,810 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-08-29 20:35:27,810 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:35:27,946 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:35:27,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 189 transitions, 393 flow [2023-08-29 20:35:28,082 INFO L130 PetriNetUnfolder]: 2/186 cut-off events. [2023-08-29 20:35:28,082 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:35:28,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 2/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 355 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2023-08-29 20:35:28,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 189 transitions, 393 flow [2023-08-29 20:35:28,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 186 transitions, 381 flow [2023-08-29 20:35:28,103 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:35:28,120 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 186 transitions, 381 flow [2023-08-29 20:35:28,124 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 186 transitions, 381 flow [2023-08-29 20:35:28,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 186 transitions, 381 flow [2023-08-29 20:35:28,206 INFO L130 PetriNetUnfolder]: 2/186 cut-off events. [2023-08-29 20:35:28,207 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:35:28,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 2/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2023-08-29 20:35:28,213 INFO L119 LiptonReduction]: Number of co-enabled transitions 8500 [2023-08-29 20:35:48,190 INFO L134 LiptonReduction]: Checked pairs total: 43557 [2023-08-29 20:35:48,191 INFO L136 LiptonReduction]: Total number of compositions: 158 [2023-08-29 20:35:48,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:35:48,220 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;@d428e07, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:35:48,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2023-08-29 20:35:48,224 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:35:48,224 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:35:48,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:48,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:35:48,226 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:35:48,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:48,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1200, now seen corresponding path program 1 times [2023-08-29 20:35:48,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:35:48,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399195853] [2023-08-29 20:35:48,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:48,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:35:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:48,326 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-29 20:35:48,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:35:48,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399195853] [2023-08-29 20:35:48,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399195853] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:48,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:48,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:35:48,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019443008] [2023-08-29 20:35:48,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:48,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:35:48,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:35:48,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:35:48,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:35:48,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 347 [2023-08-29 20:35:48,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 187 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:48,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:48,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 347 [2023-08-29 20:35:48,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:52,845 INFO L130 PetriNetUnfolder]: 18354/25862 cut-off events. [2023-08-29 20:35:52,845 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:35:52,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51649 conditions, 25862 events. 18354/25862 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2326. Compared 180991 event pairs, 18354 based on Foata normal form. 400/10667 useless extension candidates. Maximal degree in co-relation 51638. Up to 25691 conditions per place. [2023-08-29 20:35:52,999 INFO L137 encePairwiseOnDemand]: 309/347 looper letters, 45 selfloop transitions, 0 changer transitions 0/51 dead transitions. [2023-08-29 20:35:52,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 201 flow [2023-08-29 20:35:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:35:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:35:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2023-08-29 20:35:53,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48559077809798273 [2023-08-29 20:35:53,016 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2023-08-29 20:35:53,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2023-08-29 20:35:53,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:53,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2023-08-29 20:35:53,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:53,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 347.0) internal successors, (1041), 3 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:53,030 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 347.0) internal successors, (1041), 3 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:53,031 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 187 flow. Second operand 2 states and 337 transitions. [2023-08-29 20:35:53,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 201 flow [2023-08-29 20:35:53,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:35:53,039 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 108 flow [2023-08-29 20:35:53,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-29 20:35:53,045 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2023-08-29 20:35:53,045 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 108 flow [2023-08-29 20:35:53,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:53,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:53,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:35:53,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:35:53,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:35:53,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:53,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1184636, now seen corresponding path program 1 times [2023-08-29 20:35:53,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:35:53,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816754178] [2023-08-29 20:35:53,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:53,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:35:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:53,352 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-29 20:35:53,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:35:53,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816754178] [2023-08-29 20:35:53,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816754178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:53,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:53,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:35:53,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167491040] [2023-08-29 20:35:53,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:53,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:35:53,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:35:53,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:35:53,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:35:53,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 347 [2023-08-29 20:35:53,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 108 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-29 20:35:53,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:53,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 347 [2023-08-29 20:35:53,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:55,036 INFO L130 PetriNetUnfolder]: 6106/8809 cut-off events. [2023-08-29 20:35:55,036 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:35:55,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17581 conditions, 8809 events. 6106/8809 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 54662 event pairs, 6106 based on Foata normal form. 432/5181 useless extension candidates. Maximal degree in co-relation 17578. Up to 8711 conditions per place. [2023-08-29 20:35:55,086 INFO L137 encePairwiseOnDemand]: 336/347 looper letters, 35 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-29 20:35:55,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 160 flow [2023-08-29 20:35:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:35:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:35:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-29 20:35:55,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015369836695485 [2023-08-29 20:35:55,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-29 20:35:55,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-29 20:35:55,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:55,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-29 20:35:55,092 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-29 20:35:55,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:55,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:55,096 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 108 flow. Second operand 3 states and 418 transitions. [2023-08-29 20:35:55,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 160 flow [2023-08-29 20:35:55,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:35:55,099 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 90 flow [2023-08-29 20:35:55,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-29 20:35:55,100 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -47 predicate places. [2023-08-29 20:35:55,100 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 90 flow [2023-08-29 20:35:55,100 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-29 20:35:55,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:55,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:35:55,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:35:55,101 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:35:55,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:55,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1184635, now seen corresponding path program 1 times [2023-08-29 20:35:55,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:35:55,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180226428] [2023-08-29 20:35:55,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:55,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:35:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:55,185 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-29 20:35:55,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:35:55,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180226428] [2023-08-29 20:35:55,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180226428] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:55,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:55,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:35:55,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524993589] [2023-08-29 20:35:55,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:55,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:35:55,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:35:55,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:35:55,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:35:55,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 347 [2023-08-29 20:35:55,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 90 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-29 20:35:55,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:55,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 347 [2023-08-29 20:35:55,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:56,263 INFO L130 PetriNetUnfolder]: 5247/8108 cut-off events. [2023-08-29 20:35:56,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:35:56,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16157 conditions, 8108 events. 5247/8108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 51190 event pairs, 3049 based on Foata normal form. 0/6049 useless extension candidates. Maximal degree in co-relation 16153. Up to 4417 conditions per place. [2023-08-29 20:35:56,302 INFO L137 encePairwiseOnDemand]: 325/347 looper letters, 38 selfloop transitions, 11 changer transitions 1/51 dead transitions. [2023-08-29 20:35:56,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 210 flow [2023-08-29 20:35:56,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:35:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:35:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-29 20:35:56,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015369836695485 [2023-08-29 20:35:56,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-29 20:35:56,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-29 20:35:56,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:56,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-29 20:35:56,306 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-29 20:35:56,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:56,308 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:56,309 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 90 flow. Second operand 3 states and 418 transitions. [2023-08-29 20:35:56,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 210 flow [2023-08-29 20:35:56,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 209 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:35:56,310 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 177 flow [2023-08-29 20:35:56,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-29 20:35:56,311 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -47 predicate places. [2023-08-29 20:35:56,311 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 177 flow [2023-08-29 20:35:56,312 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-29 20:35:56,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:56,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:35:56,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:35:56,312 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:35:56,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:56,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2053717382, now seen corresponding path program 1 times [2023-08-29 20:35:56,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:35:56,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381134063] [2023-08-29 20:35:56,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:56,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:35:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:57,638 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-29 20:35:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:35:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381134063] [2023-08-29 20:35:57,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381134063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:57,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:57,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:35:57,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102114040] [2023-08-29 20:35:57,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:57,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:35:57,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:35:57,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:35:57,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:35:57,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 347 [2023-08-29 20:35:57,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:57,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:57,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 347 [2023-08-29 20:35:57,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:59,030 INFO L130 PetriNetUnfolder]: 4670/7473 cut-off events. [2023-08-29 20:35:59,030 INFO L131 PetriNetUnfolder]: For 2378/2452 co-relation queries the response was YES. [2023-08-29 20:35:59,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20955 conditions, 7473 events. 4670/7473 cut-off events. For 2378/2452 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 49465 event pairs, 1915 based on Foata normal form. 0/6467 useless extension candidates. Maximal degree in co-relation 20950. Up to 6032 conditions per place. [2023-08-29 20:35:59,071 INFO L137 encePairwiseOnDemand]: 341/347 looper letters, 62 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-29 20:35:59,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 74 transitions, 419 flow [2023-08-29 20:35:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:35:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:35:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-29 20:35:59,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092219020172911 [2023-08-29 20:35:59,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-29 20:35:59,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-29 20:35:59,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:59,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-29 20:35:59,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:59,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:59,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:59,079 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 177 flow. Second operand 3 states and 426 transitions. [2023-08-29 20:35:59,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 74 transitions, 419 flow [2023-08-29 20:35:59,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:35:59,107 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 200 flow [2023-08-29 20:35:59,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2023-08-29 20:35:59,109 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -47 predicate places. [2023-08-29 20:35:59,109 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 200 flow [2023-08-29 20:35:59,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:59,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:59,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:35:59,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:35:59,110 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:35:59,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:59,111 INFO L85 PathProgramCache]: Analyzing trace with hash -759272171, now seen corresponding path program 1 times [2023-08-29 20:35:59,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:35:59,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483975117] [2023-08-29 20:35:59,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:59,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:35:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:00,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:00,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483975117] [2023-08-29 20:36:00,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483975117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:00,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:00,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:36:00,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059238035] [2023-08-29 20:36:00,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:00,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:36:00,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:00,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:36:00,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:36:00,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 347 [2023-08-29 20:36:00,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:00,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:00,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 347 [2023-08-29 20:36:00,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:01,089 INFO L130 PetriNetUnfolder]: 4651/7399 cut-off events. [2023-08-29 20:36:01,089 INFO L131 PetriNetUnfolder]: For 2162/2225 co-relation queries the response was YES. [2023-08-29 20:36:01,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20460 conditions, 7399 events. 4651/7399 cut-off events. For 2162/2225 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 48569 event pairs, 1646 based on Foata normal form. 0/5907 useless extension candidates. Maximal degree in co-relation 20454. Up to 5157 conditions per place. [2023-08-29 20:36:01,126 INFO L137 encePairwiseOnDemand]: 344/347 looper letters, 58 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2023-08-29 20:36:01,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 394 flow [2023-08-29 20:36:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:36:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:36:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-29 20:36:01,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4140249759846302 [2023-08-29 20:36:01,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-29 20:36:01,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-29 20:36:01,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:01,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-29 20:36:01,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:01,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:01,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:01,132 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 200 flow. Second operand 3 states and 431 transitions. [2023-08-29 20:36:01,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 394 flow [2023-08-29 20:36:01,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:36:01,138 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 212 flow [2023-08-29 20:36:01,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2023-08-29 20:36:01,140 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -45 predicate places. [2023-08-29 20:36:01,141 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 212 flow [2023-08-29 20:36:01,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:01,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:01,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:01,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:36:01,142 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:01,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1685308130, now seen corresponding path program 1 times [2023-08-29 20:36:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:01,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832773790] [2023-08-29 20:36:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:01,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:01,251 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-29 20:36:01,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:01,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832773790] [2023-08-29 20:36:01,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832773790] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:01,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:01,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:36:01,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226560628] [2023-08-29 20:36:01,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:01,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:36:01,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:01,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:36:01,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:36:01,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 347 [2023-08-29 20:36:01,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:01,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:01,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 347 [2023-08-29 20:36:01,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:02,180 INFO L130 PetriNetUnfolder]: 4949/7780 cut-off events. [2023-08-29 20:36:02,180 INFO L131 PetriNetUnfolder]: For 2528/2528 co-relation queries the response was YES. [2023-08-29 20:36:02,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22446 conditions, 7780 events. 4949/7780 cut-off events. For 2528/2528 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 50211 event pairs, 1955 based on Foata normal form. 0/6418 useless extension candidates. Maximal degree in co-relation 22439. Up to 2888 conditions per place. [2023-08-29 20:36:02,220 INFO L137 encePairwiseOnDemand]: 336/347 looper letters, 76 selfloop transitions, 13 changer transitions 0/90 dead transitions. [2023-08-29 20:36:02,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 90 transitions, 524 flow [2023-08-29 20:36:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:36:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:36:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2023-08-29 20:36:02,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.388328530259366 [2023-08-29 20:36:02,227 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2023-08-29 20:36:02,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2023-08-29 20:36:02,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:02,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2023-08-29 20:36:02,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:02,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:02,232 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:02,232 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 212 flow. Second operand 4 states and 539 transitions. [2023-08-29 20:36:02,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 90 transitions, 524 flow [2023-08-29 20:36:02,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 90 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:36:02,237 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 300 flow [2023-08-29 20:36:02,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2023-08-29 20:36:02,240 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -42 predicate places. [2023-08-29 20:36:02,240 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 300 flow [2023-08-29 20:36:02,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:02,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:02,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:02,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:36:02,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:02,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:02,242 INFO L85 PathProgramCache]: Analyzing trace with hash -759272527, now seen corresponding path program 1 times [2023-08-29 20:36:02,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:02,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214743892] [2023-08-29 20:36:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:02,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:02,422 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-29 20:36:02,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:02,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214743892] [2023-08-29 20:36:02,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214743892] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:02,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:02,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:36:02,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451001546] [2023-08-29 20:36:02,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:02,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:36:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:02,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:36:02,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:36:02,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 347 [2023-08-29 20:36:02,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 300 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:02,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:02,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 347 [2023-08-29 20:36:02,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:04,047 INFO L130 PetriNetUnfolder]: 7128/11242 cut-off events. [2023-08-29 20:36:04,047 INFO L131 PetriNetUnfolder]: For 10068/10068 co-relation queries the response was YES. [2023-08-29 20:36:04,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35354 conditions, 11242 events. 7128/11242 cut-off events. For 10068/10068 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 78419 event pairs, 3342 based on Foata normal form. 50/10115 useless extension candidates. Maximal degree in co-relation 35345. Up to 6181 conditions per place. [2023-08-29 20:36:04,120 INFO L137 encePairwiseOnDemand]: 342/347 looper letters, 84 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2023-08-29 20:36:04,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 94 transitions, 648 flow [2023-08-29 20:36:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:36:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:36:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2023-08-29 20:36:04,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854466858789625 [2023-08-29 20:36:04,123 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2023-08-29 20:36:04,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2023-08-29 20:36:04,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:04,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2023-08-29 20:36:04,125 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-29 20:36:04,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:04,127 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:04,127 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 300 flow. Second operand 4 states and 535 transitions. [2023-08-29 20:36:04,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 94 transitions, 648 flow [2023-08-29 20:36:04,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 94 transitions, 640 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-29 20:36:04,229 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 324 flow [2023-08-29 20:36:04,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2023-08-29 20:36:04,230 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2023-08-29 20:36:04,230 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 324 flow [2023-08-29 20:36:04,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:04,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:04,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:04,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:36:04,231 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:04,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:04,231 INFO L85 PathProgramCache]: Analyzing trace with hash -454086675, now seen corresponding path program 2 times [2023-08-29 20:36:04,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:04,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890582928] [2023-08-29 20:36:04,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:04,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:04,474 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-29 20:36:04,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:04,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890582928] [2023-08-29 20:36:04,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890582928] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:04,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:04,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:36:04,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738994361] [2023-08-29 20:36:04,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:04,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:36:04,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:04,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:36:04,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:36:04,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 347 [2023-08-29 20:36:04,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:04,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:04,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 347 [2023-08-29 20:36:04,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:06,052 INFO L130 PetriNetUnfolder]: 7023/11085 cut-off events. [2023-08-29 20:36:06,052 INFO L131 PetriNetUnfolder]: For 12423/12423 co-relation queries the response was YES. [2023-08-29 20:36:06,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35508 conditions, 11085 events. 7023/11085 cut-off events. For 12423/12423 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 77213 event pairs, 3379 based on Foata normal form. 50/9956 useless extension candidates. Maximal degree in co-relation 35498. Up to 7741 conditions per place. [2023-08-29 20:36:06,106 INFO L137 encePairwiseOnDemand]: 344/347 looper letters, 76 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2023-08-29 20:36:06,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 568 flow [2023-08-29 20:36:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:36:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:36:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-29 20:36:06,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38472622478386165 [2023-08-29 20:36:06,109 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-29 20:36:06,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-29 20:36:06,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:06,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-29 20:36:06,111 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-29 20:36:06,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:06,113 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:06,113 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 324 flow. Second operand 4 states and 534 transitions. [2023-08-29 20:36:06,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 568 flow [2023-08-29 20:36:06,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 84 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:36:06,192 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 332 flow [2023-08-29 20:36:06,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-08-29 20:36:06,193 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -37 predicate places. [2023-08-29 20:36:06,193 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 332 flow [2023-08-29 20:36:06,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:06,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:06,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:06,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:36:06,194 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:06,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:06,194 INFO L85 PathProgramCache]: Analyzing trace with hash -759339147, now seen corresponding path program 1 times [2023-08-29 20:36:06,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:06,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712607486] [2023-08-29 20:36:06,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:06,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:06,330 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-29 20:36:06,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:06,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712607486] [2023-08-29 20:36:06,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712607486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:06,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:06,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:36:06,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042452626] [2023-08-29 20:36:06,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:06,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:36:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:36:06,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:36:06,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 347 [2023-08-29 20:36:06,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:06,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:06,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 347 [2023-08-29 20:36:06,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:07,543 INFO L130 PetriNetUnfolder]: 6411/10258 cut-off events. [2023-08-29 20:36:07,543 INFO L131 PetriNetUnfolder]: For 15846/15972 co-relation queries the response was YES. [2023-08-29 20:36:07,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33245 conditions, 10258 events. 6411/10258 cut-off events. For 15846/15972 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 72586 event pairs, 3175 based on Foata normal form. 34/9009 useless extension candidates. Maximal degree in co-relation 33234. Up to 6570 conditions per place. [2023-08-29 20:36:07,595 INFO L137 encePairwiseOnDemand]: 343/347 looper letters, 66 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2023-08-29 20:36:07,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 534 flow [2023-08-29 20:36:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:36:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:36:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-29 20:36:07,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41786743515850144 [2023-08-29 20:36:07,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-29 20:36:07,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-29 20:36:07,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:07,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-29 20:36:07,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:07,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:07,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:07,600 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 332 flow. Second operand 3 states and 435 transitions. [2023-08-29 20:36:07,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 534 flow [2023-08-29 20:36:07,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 524 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:36:07,658 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 318 flow [2023-08-29 20:36:07,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2023-08-29 20:36:07,658 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -40 predicate places. [2023-08-29 20:36:07,659 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 58 transitions, 318 flow [2023-08-29 20:36:07,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:07,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:07,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:07,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:36:07,660 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:07,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:07,660 INFO L85 PathProgramCache]: Analyzing trace with hash -759338790, now seen corresponding path program 1 times [2023-08-29 20:36:07,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:07,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516859854] [2023-08-29 20:36:07,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:07,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:08,630 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-29 20:36:08,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:08,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516859854] [2023-08-29 20:36:08,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516859854] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:08,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:08,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:36:08,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751447153] [2023-08-29 20:36:08,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:08,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:36:08,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:08,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:36:08,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:36:08,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 347 [2023-08-29 20:36:08,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 318 flow. Second operand has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:08,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:08,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 347 [2023-08-29 20:36:08,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:09,967 INFO L130 PetriNetUnfolder]: 6353/10174 cut-off events. [2023-08-29 20:36:09,968 INFO L131 PetriNetUnfolder]: For 12223/12337 co-relation queries the response was YES. [2023-08-29 20:36:09,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33505 conditions, 10174 events. 6353/10174 cut-off events. For 12223/12337 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 71971 event pairs, 3147 based on Foata normal form. 17/8918 useless extension candidates. Maximal degree in co-relation 33495. Up to 6533 conditions per place. [2023-08-29 20:36:10,004 INFO L137 encePairwiseOnDemand]: 344/347 looper letters, 65 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2023-08-29 20:36:10,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 526 flow [2023-08-29 20:36:10,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:36:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:36:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-29 20:36:10,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39865513928914503 [2023-08-29 20:36:10,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-29 20:36:10,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-29 20:36:10,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:10,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-29 20:36:10,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:10,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:10,009 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:10,010 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 318 flow. Second operand 3 states and 415 transitions. [2023-08-29 20:36:10,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 526 flow [2023-08-29 20:36:10,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:36:10,053 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 325 flow [2023-08-29 20:36:10,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2023-08-29 20:36:10,054 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2023-08-29 20:36:10,054 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 325 flow [2023-08-29 20:36:10,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:10,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:10,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:10,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:36:10,055 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:10,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:10,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2062602053, now seen corresponding path program 1 times [2023-08-29 20:36:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:10,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85552760] [2023-08-29 20:36:10,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:10,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:11,477 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-29 20:36:11,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:11,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85552760] [2023-08-29 20:36:11,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85552760] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:11,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:11,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:36:11,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616076225] [2023-08-29 20:36:11,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:11,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:36:11,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:11,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:36:11,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:36:11,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 347 [2023-08-29 20:36:11,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 325 flow. Second operand has 10 states, 10 states have (on average 106.3) internal successors, (1063), 10 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:11,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:11,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 347 [2023-08-29 20:36:11,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:14,115 INFO L130 PetriNetUnfolder]: 10488/16418 cut-off events. [2023-08-29 20:36:14,115 INFO L131 PetriNetUnfolder]: For 14326/14326 co-relation queries the response was YES. [2023-08-29 20:36:14,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53586 conditions, 16418 events. 10488/16418 cut-off events. For 14326/14326 co-relation queries the response was YES. Maximal size of possible extension queue 1334. Compared 122352 event pairs, 2861 based on Foata normal form. 108/14716 useless extension candidates. Maximal degree in co-relation 53575. Up to 8360 conditions per place. [2023-08-29 20:36:14,234 INFO L137 encePairwiseOnDemand]: 333/347 looper letters, 174 selfloop transitions, 76 changer transitions 0/251 dead transitions. [2023-08-29 20:36:14,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 251 transitions, 1789 flow [2023-08-29 20:36:14,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-29 20:36:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-29 20:36:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2078 transitions. [2023-08-29 20:36:14,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3326929234710215 [2023-08-29 20:36:14,241 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2078 transitions. [2023-08-29 20:36:14,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2078 transitions. [2023-08-29 20:36:14,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:14,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2078 transitions. [2023-08-29 20:36:14,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 115.44444444444444) internal successors, (2078), 18 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:14,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 347.0) internal successors, (6593), 19 states have internal predecessors, (6593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:14,256 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 347.0) internal successors, (6593), 19 states have internal predecessors, (6593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:14,256 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 325 flow. Second operand 18 states and 2078 transitions. [2023-08-29 20:36:14,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 251 transitions, 1789 flow [2023-08-29 20:36:14,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 251 transitions, 1759 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:36:14,390 INFO L231 Difference]: Finished difference. Result has 84 places, 135 transitions, 1125 flow [2023-08-29 20:36:14,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1125, PETRI_PLACES=84, PETRI_TRANSITIONS=135} [2023-08-29 20:36:14,391 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -14 predicate places. [2023-08-29 20:36:14,391 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 135 transitions, 1125 flow [2023-08-29 20:36:14,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.3) internal successors, (1063), 10 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:14,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:14,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:14,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:36:14,392 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:14,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:14,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2062544097, now seen corresponding path program 1 times [2023-08-29 20:36:14,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:14,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978636024] [2023-08-29 20:36:14,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:14,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:14,538 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-29 20:36:14,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:14,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978636024] [2023-08-29 20:36:14,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978636024] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:14,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:14,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:36:14,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124246581] [2023-08-29 20:36:14,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:14,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:36:14,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:14,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:36:14,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:36:14,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 347 [2023-08-29 20:36:14,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 135 transitions, 1125 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-29 20:36:14,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:14,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 347 [2023-08-29 20:36:14,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:16,215 INFO L130 PetriNetUnfolder]: 9015/14180 cut-off events. [2023-08-29 20:36:16,215 INFO L131 PetriNetUnfolder]: For 25244/25244 co-relation queries the response was YES. [2023-08-29 20:36:16,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56259 conditions, 14180 events. 9015/14180 cut-off events. For 25244/25244 co-relation queries the response was YES. Maximal size of possible extension queue 1135. Compared 103914 event pairs, 3397 based on Foata normal form. 277/13024 useless extension candidates. Maximal degree in co-relation 56238. Up to 6268 conditions per place. [2023-08-29 20:36:16,317 INFO L137 encePairwiseOnDemand]: 329/347 looper letters, 139 selfloop transitions, 48 changer transitions 0/188 dead transitions. [2023-08-29 20:36:16,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 188 transitions, 1941 flow [2023-08-29 20:36:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:36:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:36:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-08-29 20:36:16,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37752161383285304 [2023-08-29 20:36:16,319 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-08-29 20:36:16,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-08-29 20:36:16,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:16,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-08-29 20:36:16,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:16,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:16,323 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:16,323 INFO L175 Difference]: Start difference. First operand has 84 places, 135 transitions, 1125 flow. Second operand 4 states and 524 transitions. [2023-08-29 20:36:16,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 188 transitions, 1941 flow [2023-08-29 20:36:16,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 188 transitions, 1897 flow, removed 22 selfloop flow, removed 0 redundant places. [2023-08-29 20:36:16,719 INFO L231 Difference]: Finished difference. Result has 89 places, 160 transitions, 1560 flow [2023-08-29 20:36:16,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1560, PETRI_PLACES=89, PETRI_TRANSITIONS=160} [2023-08-29 20:36:16,720 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -9 predicate places. [2023-08-29 20:36:16,720 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 160 transitions, 1560 flow [2023-08-29 20:36:16,720 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-29 20:36:16,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:16,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:16,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:36:16,721 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:16,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash 419743602, now seen corresponding path program 1 times [2023-08-29 20:36:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:16,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922744557] [2023-08-29 20:36:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:16,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:17,568 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-29 20:36:17,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:17,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922744557] [2023-08-29 20:36:17,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922744557] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:17,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:17,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:36:17,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609006038] [2023-08-29 20:36:17,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:17,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:36:17,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:17,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:36:17,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:36:17,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 347 [2023-08-29 20:36:17,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 160 transitions, 1560 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-29 20:36:17,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:17,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 347 [2023-08-29 20:36:17,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:20,497 INFO L130 PetriNetUnfolder]: 15056/23875 cut-off events. [2023-08-29 20:36:20,497 INFO L131 PetriNetUnfolder]: For 59028/59028 co-relation queries the response was YES. [2023-08-29 20:36:20,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105738 conditions, 23875 events. 15056/23875 cut-off events. For 59028/59028 co-relation queries the response was YES. Maximal size of possible extension queue 2018. Compared 192225 event pairs, 4170 based on Foata normal form. 48/21433 useless extension candidates. Maximal degree in co-relation 105715. Up to 11580 conditions per place. [2023-08-29 20:36:20,676 INFO L137 encePairwiseOnDemand]: 337/347 looper letters, 273 selfloop transitions, 57 changer transitions 0/331 dead transitions. [2023-08-29 20:36:20,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 331 transitions, 3590 flow [2023-08-29 20:36:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 20:36:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 20:36:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1410 transitions. [2023-08-29 20:36:20,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33861671469740634 [2023-08-29 20:36:20,680 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1410 transitions. [2023-08-29 20:36:20,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1410 transitions. [2023-08-29 20:36:20,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:20,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1410 transitions. [2023-08-29 20:36:20,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 117.5) internal successors, (1410), 12 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:20,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 347.0) internal successors, (4511), 13 states have internal predecessors, (4511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:20,689 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 347.0) internal successors, (4511), 13 states have internal predecessors, (4511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:20,689 INFO L175 Difference]: Start difference. First operand has 89 places, 160 transitions, 1560 flow. Second operand 12 states and 1410 transitions. [2023-08-29 20:36:20,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 331 transitions, 3590 flow [2023-08-29 20:36:21,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 331 transitions, 3582 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:36:21,736 INFO L231 Difference]: Finished difference. Result has 105 places, 192 transitions, 2107 flow [2023-08-29 20:36:21,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2107, PETRI_PLACES=105, PETRI_TRANSITIONS=192} [2023-08-29 20:36:21,737 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2023-08-29 20:36:21,737 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 192 transitions, 2107 flow [2023-08-29 20:36:21,738 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-29 20:36:21,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:21,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:21,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:36:21,738 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:21,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:21,739 INFO L85 PathProgramCache]: Analyzing trace with hash 484092162, now seen corresponding path program 2 times [2023-08-29 20:36:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014972084] [2023-08-29 20:36:21,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:23,382 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-29 20:36:23,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:23,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014972084] [2023-08-29 20:36:23,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014972084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:23,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:23,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:36:23,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524830720] [2023-08-29 20:36:23,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:23,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:36:23,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:23,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:36:23,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:36:23,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 347 [2023-08-29 20:36:23,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 192 transitions, 2107 flow. Second operand has 10 states, 10 states have (on average 108.4) internal successors, (1084), 10 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:23,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:23,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 347 [2023-08-29 20:36:23,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:26,999 INFO L130 PetriNetUnfolder]: 16552/26344 cut-off events. [2023-08-29 20:36:26,999 INFO L131 PetriNetUnfolder]: For 77327/77327 co-relation queries the response was YES. [2023-08-29 20:36:27,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122874 conditions, 26344 events. 16552/26344 cut-off events. For 77327/77327 co-relation queries the response was YES. Maximal size of possible extension queue 2262. Compared 215562 event pairs, 4261 based on Foata normal form. 48/23560 useless extension candidates. Maximal degree in co-relation 122844. Up to 19591 conditions per place. [2023-08-29 20:36:27,270 INFO L137 encePairwiseOnDemand]: 337/347 looper letters, 188 selfloop transitions, 71 changer transitions 0/260 dead transitions. [2023-08-29 20:36:27,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 260 transitions, 3146 flow [2023-08-29 20:36:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:36:27,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:36:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 953 transitions. [2023-08-29 20:36:27,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34329971181556196 [2023-08-29 20:36:27,273 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 953 transitions. [2023-08-29 20:36:27,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 953 transitions. [2023-08-29 20:36:27,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:27,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 953 transitions. [2023-08-29 20:36:27,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:27,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 347.0) internal successors, (3123), 9 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:27,280 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 347.0) internal successors, (3123), 9 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:27,280 INFO L175 Difference]: Start difference. First operand has 105 places, 192 transitions, 2107 flow. Second operand 8 states and 953 transitions. [2023-08-29 20:36:27,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 260 transitions, 3146 flow [2023-08-29 20:36:29,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 260 transitions, 3098 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-29 20:36:29,335 INFO L231 Difference]: Finished difference. Result has 109 places, 195 transitions, 2294 flow [2023-08-29 20:36:29,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=2059, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2294, PETRI_PLACES=109, PETRI_TRANSITIONS=195} [2023-08-29 20:36:29,336 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 11 predicate places. [2023-08-29 20:36:29,336 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 195 transitions, 2294 flow [2023-08-29 20:36:29,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.4) internal successors, (1084), 10 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:29,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:29,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:29,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:36:29,337 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:29,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:29,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2124972057, now seen corresponding path program 1 times [2023-08-29 20:36:29,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:29,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254161681] [2023-08-29 20:36:29,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:29,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:29,964 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-29 20:36:29,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:29,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254161681] [2023-08-29 20:36:29,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254161681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:29,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:29,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:36:29,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604729280] [2023-08-29 20:36:29,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:29,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:36:29,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:29,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:36:29,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:36:30,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 347 [2023-08-29 20:36:30,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 195 transitions, 2294 flow. Second operand has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:30,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:30,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 347 [2023-08-29 20:36:30,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:33,115 INFO L130 PetriNetUnfolder]: 11877/19670 cut-off events. [2023-08-29 20:36:33,115 INFO L131 PetriNetUnfolder]: For 73855/74246 co-relation queries the response was YES. [2023-08-29 20:36:33,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90181 conditions, 19670 events. 11877/19670 cut-off events. For 73855/74246 co-relation queries the response was YES. Maximal size of possible extension queue 1716. Compared 164515 event pairs, 3811 based on Foata normal form. 212/18745 useless extension candidates. Maximal degree in co-relation 90149. Up to 10392 conditions per place. [2023-08-29 20:36:33,239 INFO L137 encePairwiseOnDemand]: 339/347 looper letters, 177 selfloop transitions, 44 changer transitions 0/294 dead transitions. [2023-08-29 20:36:33,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 294 transitions, 3601 flow [2023-08-29 20:36:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:36:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:36:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1088 transitions. [2023-08-29 20:36:33,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3483829650976625 [2023-08-29 20:36:33,243 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1088 transitions. [2023-08-29 20:36:33,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1088 transitions. [2023-08-29 20:36:33,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:33,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1088 transitions. [2023-08-29 20:36:33,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:33,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 347.0) internal successors, (3470), 10 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:33,262 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 347.0) internal successors, (3470), 10 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:33,262 INFO L175 Difference]: Start difference. First operand has 109 places, 195 transitions, 2294 flow. Second operand 9 states and 1088 transitions. [2023-08-29 20:36:33,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 294 transitions, 3601 flow [2023-08-29 20:36:34,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 294 transitions, 3471 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-29 20:36:34,089 INFO L231 Difference]: Finished difference. Result has 116 places, 212 transitions, 2622 flow [2023-08-29 20:36:34,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2622, PETRI_PLACES=116, PETRI_TRANSITIONS=212} [2023-08-29 20:36:34,089 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 18 predicate places. [2023-08-29 20:36:34,090 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 212 transitions, 2622 flow [2023-08-29 20:36:34,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:34,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:34,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:34,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:36:34,091 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:34,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:34,091 INFO L85 PathProgramCache]: Analyzing trace with hash 485641807, now seen corresponding path program 1 times [2023-08-29 20:36:34,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:34,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292225516] [2023-08-29 20:36:34,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:34,486 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-29 20:36:34,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:34,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292225516] [2023-08-29 20:36:34,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292225516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:34,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:34,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:36:34,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407195744] [2023-08-29 20:36:34,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:34,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:36:34,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:34,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:36:34,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:36:34,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 347 [2023-08-29 20:36:34,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 212 transitions, 2622 flow. Second operand has 9 states, 9 states have (on average 112.55555555555556) internal successors, (1013), 9 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:34,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:34,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 347 [2023-08-29 20:36:34,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:37,541 INFO L130 PetriNetUnfolder]: 13080/20740 cut-off events. [2023-08-29 20:36:37,541 INFO L131 PetriNetUnfolder]: For 81653/81653 co-relation queries the response was YES. [2023-08-29 20:36:37,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99707 conditions, 20740 events. 13080/20740 cut-off events. For 81653/81653 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 162887 event pairs, 3244 based on Foata normal form. 539/20149 useless extension candidates. Maximal degree in co-relation 99670. Up to 6409 conditions per place. [2023-08-29 20:36:37,708 INFO L137 encePairwiseOnDemand]: 327/347 looper letters, 238 selfloop transitions, 101 changer transitions 1/341 dead transitions. [2023-08-29 20:36:37,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 341 transitions, 4526 flow [2023-08-29 20:36:37,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:36:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:36:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 885 transitions. [2023-08-29 20:36:37,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3643474680938658 [2023-08-29 20:36:37,711 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 885 transitions. [2023-08-29 20:36:37,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 885 transitions. [2023-08-29 20:36:37,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:37,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 885 transitions. [2023-08-29 20:36:37,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.42857142857143) internal successors, (885), 7 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:37,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 347.0) internal successors, (2776), 8 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:37,716 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 347.0) internal successors, (2776), 8 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:37,716 INFO L175 Difference]: Start difference. First operand has 116 places, 212 transitions, 2622 flow. Second operand 7 states and 885 transitions. [2023-08-29 20:36:37,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 341 transitions, 4526 flow [2023-08-29 20:36:39,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 341 transitions, 4517 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-29 20:36:39,223 INFO L231 Difference]: Finished difference. Result has 124 places, 260 transitions, 3703 flow [2023-08-29 20:36:39,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=2613, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3703, PETRI_PLACES=124, PETRI_TRANSITIONS=260} [2023-08-29 20:36:39,224 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 26 predicate places. [2023-08-29 20:36:39,224 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 260 transitions, 3703 flow [2023-08-29 20:36:39,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.55555555555556) internal successors, (1013), 9 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:39,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:39,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:39,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:36:39,225 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:39,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:39,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1164071024, now seen corresponding path program 1 times [2023-08-29 20:36:39,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:39,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043175613] [2023-08-29 20:36:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:39,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:39,624 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-29 20:36:39,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:39,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043175613] [2023-08-29 20:36:39,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043175613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:39,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:39,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:36:39,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581485651] [2023-08-29 20:36:39,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:39,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:36:39,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:39,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:36:39,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:36:39,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 347 [2023-08-29 20:36:39,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 260 transitions, 3703 flow. Second operand has 9 states, 9 states have (on average 107.66666666666667) internal successors, (969), 9 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:39,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:39,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 347 [2023-08-29 20:36:39,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:43,162 INFO L130 PetriNetUnfolder]: 11606/18595 cut-off events. [2023-08-29 20:36:43,163 INFO L131 PetriNetUnfolder]: For 99708/99708 co-relation queries the response was YES. [2023-08-29 20:36:43,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97694 conditions, 18595 events. 11606/18595 cut-off events. For 99708/99708 co-relation queries the response was YES. Maximal size of possible extension queue 1433. Compared 146807 event pairs, 2226 based on Foata normal form. 0/18382 useless extension candidates. Maximal degree in co-relation 97654. Up to 6149 conditions per place. [2023-08-29 20:36:43,474 INFO L137 encePairwiseOnDemand]: 340/347 looper letters, 267 selfloop transitions, 47 changer transitions 5/320 dead transitions. [2023-08-29 20:36:43,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 320 transitions, 4750 flow [2023-08-29 20:36:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:36:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:36:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2023-08-29 20:36:43,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3379991766158913 [2023-08-29 20:36:43,477 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2023-08-29 20:36:43,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2023-08-29 20:36:43,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:43,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2023-08-29 20:36:43,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:43,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 347.0) internal successors, (2776), 8 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:43,482 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 347.0) internal successors, (2776), 8 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:43,482 INFO L175 Difference]: Start difference. First operand has 124 places, 260 transitions, 3703 flow. Second operand 7 states and 821 transitions. [2023-08-29 20:36:43,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 320 transitions, 4750 flow [2023-08-29 20:36:44,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 320 transitions, 4707 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-29 20:36:44,902 INFO L231 Difference]: Finished difference. Result has 127 places, 249 transitions, 3588 flow [2023-08-29 20:36:44,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=3502, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3588, PETRI_PLACES=127, PETRI_TRANSITIONS=249} [2023-08-29 20:36:44,903 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 29 predicate places. [2023-08-29 20:36:44,903 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 249 transitions, 3588 flow [2023-08-29 20:36:44,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.66666666666667) internal successors, (969), 9 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:44,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:44,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:44,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:36:44,904 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:44,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:44,904 INFO L85 PathProgramCache]: Analyzing trace with hash 536884854, now seen corresponding path program 1 times [2023-08-29 20:36:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:44,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970075810] [2023-08-29 20:36:44,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:44,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:46,298 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-29 20:36:46,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970075810] [2023-08-29 20:36:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970075810] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:46,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:46,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:36:46,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753466181] [2023-08-29 20:36:46,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:46,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:36:46,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:46,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:36:46,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:36:46,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 347 [2023-08-29 20:36:46,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 249 transitions, 3588 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:46,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:46,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 347 [2023-08-29 20:36:46,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:50,368 INFO L130 PetriNetUnfolder]: 15560/25202 cut-off events. [2023-08-29 20:36:50,368 INFO L131 PetriNetUnfolder]: For 148817/148817 co-relation queries the response was YES. [2023-08-29 20:36:50,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132762 conditions, 25202 events. 15560/25202 cut-off events. For 148817/148817 co-relation queries the response was YES. Maximal size of possible extension queue 1994. Compared 212803 event pairs, 4985 based on Foata normal form. 18/24864 useless extension candidates. Maximal degree in co-relation 132721. Up to 14341 conditions per place. [2023-08-29 20:36:50,571 INFO L137 encePairwiseOnDemand]: 338/347 looper letters, 248 selfloop transitions, 116 changer transitions 5/372 dead transitions. [2023-08-29 20:36:50,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 372 transitions, 5780 flow [2023-08-29 20:36:50,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:36:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:36:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 812 transitions. [2023-08-29 20:36:50,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3900096061479347 [2023-08-29 20:36:50,574 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 812 transitions. [2023-08-29 20:36:50,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 812 transitions. [2023-08-29 20:36:50,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:50,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 812 transitions. [2023-08-29 20:36:50,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.33333333333334) internal successors, (812), 6 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:50,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 347.0) internal successors, (2429), 7 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:50,578 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 347.0) internal successors, (2429), 7 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:50,579 INFO L175 Difference]: Start difference. First operand has 127 places, 249 transitions, 3588 flow. Second operand 6 states and 812 transitions. [2023-08-29 20:36:50,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 372 transitions, 5780 flow [2023-08-29 20:36:53,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 372 transitions, 5608 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-08-29 20:36:53,409 INFO L231 Difference]: Finished difference. Result has 129 places, 281 transitions, 4369 flow [2023-08-29 20:36:53,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=3488, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4369, PETRI_PLACES=129, PETRI_TRANSITIONS=281} [2023-08-29 20:36:53,410 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 31 predicate places. [2023-08-29 20:36:53,410 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 281 transitions, 4369 flow [2023-08-29 20:36:53,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:53,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:53,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:53,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:36:53,411 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:36:53,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:53,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1525685636, now seen corresponding path program 2 times [2023-08-29 20:36:53,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:53,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865406288] [2023-08-29 20:36:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:55,052 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-29 20:36:55,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:55,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865406288] [2023-08-29 20:36:55,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865406288] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:55,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:55,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:36:55,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586492501] [2023-08-29 20:36:55,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:55,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:36:55,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:55,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:36:55,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:36:55,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 347 [2023-08-29 20:36:55,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 281 transitions, 4369 flow. Second operand has 10 states, 10 states have (on average 108.5) internal successors, (1085), 10 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:55,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:55,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 347 [2023-08-29 20:36:55,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:37:00,666 INFO L130 PetriNetUnfolder]: 17826/29309 cut-off events. [2023-08-29 20:37:00,667 INFO L131 PetriNetUnfolder]: For 193697/193697 co-relation queries the response was YES. [2023-08-29 20:37:00,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159075 conditions, 29309 events. 17826/29309 cut-off events. For 193697/193697 co-relation queries the response was YES. Maximal size of possible extension queue 2519. Compared 259912 event pairs, 3071 based on Foata normal form. 568/29485 useless extension candidates. Maximal degree in co-relation 159031. Up to 10422 conditions per place. [2023-08-29 20:37:00,901 INFO L137 encePairwiseOnDemand]: 326/347 looper letters, 343 selfloop transitions, 240 changer transitions 66/650 dead transitions. [2023-08-29 20:37:00,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 650 transitions, 10007 flow [2023-08-29 20:37:00,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-29 20:37:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-29 20:37:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2413 transitions. [2023-08-29 20:37:00,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3476945244956772 [2023-08-29 20:37:00,905 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2413 transitions. [2023-08-29 20:37:00,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2413 transitions. [2023-08-29 20:37:00,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:37:00,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2413 transitions. [2023-08-29 20:37:00,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 120.65) internal successors, (2413), 20 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:00,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 347.0) internal successors, (7287), 21 states have internal predecessors, (7287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:00,916 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 347.0) internal successors, (7287), 21 states have internal predecessors, (7287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:00,916 INFO L175 Difference]: Start difference. First operand has 129 places, 281 transitions, 4369 flow. Second operand 20 states and 2413 transitions. [2023-08-29 20:37:00,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 650 transitions, 10007 flow [2023-08-29 20:37:04,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 650 transitions, 9949 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-29 20:37:04,359 INFO L231 Difference]: Finished difference. Result has 157 places, 416 transitions, 7411 flow [2023-08-29 20:37:04,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=4311, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=7411, PETRI_PLACES=157, PETRI_TRANSITIONS=416} [2023-08-29 20:37:04,360 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 59 predicate places. [2023-08-29 20:37:04,360 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 416 transitions, 7411 flow [2023-08-29 20:37:04,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.5) internal successors, (1085), 10 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:04,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:37:04,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:37:04,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:37:04,361 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:37:04,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:37:04,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1164070962, now seen corresponding path program 1 times [2023-08-29 20:37:04,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:37:04,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790492593] [2023-08-29 20:37:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:37:04,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:37:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:37:04,565 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-29 20:37:04,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:37:04,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790492593] [2023-08-29 20:37:04,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790492593] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:37:04,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:37:04,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:37:04,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219079245] [2023-08-29 20:37:04,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:37:04,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:37:04,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:37:04,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:37:04,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:37:04,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 347 [2023-08-29 20:37:04,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 416 transitions, 7411 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:04,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:37:04,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 347 [2023-08-29 20:37:04,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:37:09,869 INFO L130 PetriNetUnfolder]: 16176/26836 cut-off events. [2023-08-29 20:37:09,870 INFO L131 PetriNetUnfolder]: For 239104/239104 co-relation queries the response was YES. [2023-08-29 20:37:10,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162012 conditions, 26836 events. 16176/26836 cut-off events. For 239104/239104 co-relation queries the response was YES. Maximal size of possible extension queue 2254. Compared 236122 event pairs, 5269 based on Foata normal form. 174/26690 useless extension candidates. Maximal degree in co-relation 161956. Up to 11886 conditions per place. [2023-08-29 20:37:10,183 INFO L137 encePairwiseOnDemand]: 331/347 looper letters, 372 selfloop transitions, 83 changer transitions 49/505 dead transitions. [2023-08-29 20:37:10,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 505 transitions, 9463 flow [2023-08-29 20:37:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:37:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:37:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2023-08-29 20:37:10,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.356388088376561 [2023-08-29 20:37:10,185 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2023-08-29 20:37:10,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2023-08-29 20:37:10,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:37:10,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2023-08-29 20:37:10,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:10,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 347.0) internal successors, (2429), 7 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:10,189 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 347.0) internal successors, (2429), 7 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:10,189 INFO L175 Difference]: Start difference. First operand has 157 places, 416 transitions, 7411 flow. Second operand 6 states and 742 transitions. [2023-08-29 20:37:10,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 505 transitions, 9463 flow [2023-08-29 20:37:15,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 505 transitions, 9212 flow, removed 72 selfloop flow, removed 6 redundant places. [2023-08-29 20:37:15,612 INFO L231 Difference]: Finished difference. Result has 157 places, 393 transitions, 6861 flow [2023-08-29 20:37:15,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=7162, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6861, PETRI_PLACES=157, PETRI_TRANSITIONS=393} [2023-08-29 20:37:15,612 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 59 predicate places. [2023-08-29 20:37:15,613 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 393 transitions, 6861 flow [2023-08-29 20:37:15,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:15,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:37:15,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:37:15,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:37:15,613 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:37:15,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:37:15,614 INFO L85 PathProgramCache]: Analyzing trace with hash 783448556, now seen corresponding path program 3 times [2023-08-29 20:37:15,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:37:15,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763690903] [2023-08-29 20:37:15,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:37:15,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:37:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:37:16,873 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-29 20:37:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:37:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763690903] [2023-08-29 20:37:16,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763690903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:37:16,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:37:16,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:37:16,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316702940] [2023-08-29 20:37:16,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:37:16,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:37:16,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:37:16,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:37:16,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:37:17,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 347 [2023-08-29 20:37:17,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 393 transitions, 6861 flow. Second operand has 11 states, 11 states have (on average 107.36363636363636) internal successors, (1181), 11 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:17,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:37:17,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 347 [2023-08-29 20:37:17,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:37:24,118 INFO L130 PetriNetUnfolder]: 17778/30175 cut-off events. [2023-08-29 20:37:24,118 INFO L131 PetriNetUnfolder]: For 257488/257488 co-relation queries the response was YES. [2023-08-29 20:37:24,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184335 conditions, 30175 events. 17778/30175 cut-off events. For 257488/257488 co-relation queries the response was YES. Maximal size of possible extension queue 2637. Compared 278333 event pairs, 2053 based on Foata normal form. 534/30309 useless extension candidates. Maximal degree in co-relation 184283. Up to 9122 conditions per place. [2023-08-29 20:37:24,468 INFO L137 encePairwiseOnDemand]: 326/347 looper letters, 322 selfloop transitions, 268 changer transitions 209/800 dead transitions. [2023-08-29 20:37:24,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 800 transitions, 14083 flow [2023-08-29 20:37:24,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-29 20:37:24,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-29 20:37:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3474 transitions. [2023-08-29 20:37:24,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3337175792507205 [2023-08-29 20:37:24,471 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3474 transitions. [2023-08-29 20:37:24,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3474 transitions. [2023-08-29 20:37:24,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:37:24,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3474 transitions. [2023-08-29 20:37:24,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 115.8) internal successors, (3474), 30 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:24,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 347.0) internal successors, (10757), 31 states have internal predecessors, (10757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:24,483 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 347.0) internal successors, (10757), 31 states have internal predecessors, (10757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:24,483 INFO L175 Difference]: Start difference. First operand has 157 places, 393 transitions, 6861 flow. Second operand 30 states and 3474 transitions. [2023-08-29 20:37:24,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 800 transitions, 14083 flow [2023-08-29 20:37:32,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 800 transitions, 13844 flow, removed 72 selfloop flow, removed 3 redundant places. [2023-08-29 20:37:32,608 INFO L231 Difference]: Finished difference. Result has 199 places, 431 transitions, 8080 flow [2023-08-29 20:37:32,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=6761, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=8080, PETRI_PLACES=199, PETRI_TRANSITIONS=431} [2023-08-29 20:37:32,609 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 101 predicate places. [2023-08-29 20:37:32,609 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 431 transitions, 8080 flow [2023-08-29 20:37:32,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 107.36363636363636) internal successors, (1181), 11 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:32,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:37:32,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:37:32,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:37:32,610 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:37:32,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:37:32,610 INFO L85 PathProgramCache]: Analyzing trace with hash -161114368, now seen corresponding path program 4 times [2023-08-29 20:37:32,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:37:32,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298787673] [2023-08-29 20:37:32,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:37:32,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:37:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:37:33,990 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-29 20:37:33,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:37:33,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298787673] [2023-08-29 20:37:33,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298787673] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:37:33,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:37:33,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:37:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531833579] [2023-08-29 20:37:33,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:37:33,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:37:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:37:33,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:37:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:37:34,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 347 [2023-08-29 20:37:34,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 431 transitions, 8080 flow. Second operand has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:34,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:37:34,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 347 [2023-08-29 20:37:34,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:37:39,955 INFO L130 PetriNetUnfolder]: 14835/25990 cut-off events. [2023-08-29 20:37:39,956 INFO L131 PetriNetUnfolder]: For 281079/281079 co-relation queries the response was YES. [2023-08-29 20:37:40,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170612 conditions, 25990 events. 14835/25990 cut-off events. For 281079/281079 co-relation queries the response was YES. Maximal size of possible extension queue 2279. Compared 245700 event pairs, 8343 based on Foata normal form. 4/25541 useless extension candidates. Maximal degree in co-relation 170543. Up to 19961 conditions per place. [2023-08-29 20:37:40,320 INFO L137 encePairwiseOnDemand]: 339/347 looper letters, 355 selfloop transitions, 186 changer transitions 1/545 dead transitions. [2023-08-29 20:37:40,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 545 transitions, 11116 flow [2023-08-29 20:37:40,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:37:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:37:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 773 transitions. [2023-08-29 20:37:40,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3712776176753122 [2023-08-29 20:37:40,322 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 773 transitions. [2023-08-29 20:37:40,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 773 transitions. [2023-08-29 20:37:40,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:37:40,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 773 transitions. [2023-08-29 20:37:40,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:40,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 347.0) internal successors, (2429), 7 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:40,324 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 347.0) internal successors, (2429), 7 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:40,324 INFO L175 Difference]: Start difference. First operand has 199 places, 431 transitions, 8080 flow. Second operand 6 states and 773 transitions. [2023-08-29 20:37:40,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 545 transitions, 11116 flow [2023-08-29 20:37:52,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 545 transitions, 9898 flow, removed 255 selfloop flow, removed 9 redundant places. [2023-08-29 20:37:52,945 INFO L231 Difference]: Finished difference. Result has 198 places, 476 transitions, 8697 flow [2023-08-29 20:37:52,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=7158, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8697, PETRI_PLACES=198, PETRI_TRANSITIONS=476} [2023-08-29 20:37:52,946 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 100 predicate places. [2023-08-29 20:37:52,946 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 476 transitions, 8697 flow [2023-08-29 20:37:52,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:52,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:37:52,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:37:52,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 20:37:52,947 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:37:52,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:37:52,948 INFO L85 PathProgramCache]: Analyzing trace with hash 391906412, now seen corresponding path program 5 times [2023-08-29 20:37:52,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:37:52,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567817229] [2023-08-29 20:37:52,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:37:52,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:37:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:37:54,375 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-29 20:37:54,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:37:54,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567817229] [2023-08-29 20:37:54,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567817229] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:37:54,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:37:54,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:37:54,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279677005] [2023-08-29 20:37:54,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:37:54,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:37:54,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:37:54,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:37:54,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:37:54,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 347 [2023-08-29 20:37:54,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 476 transitions, 8697 flow. Second operand has 11 states, 11 states have (on average 107.36363636363636) internal successors, (1181), 11 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:54,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:37:54,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 347 [2023-08-29 20:37:54,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:03,188 INFO L130 PetriNetUnfolder]: 17626/31472 cut-off events. [2023-08-29 20:38:03,188 INFO L131 PetriNetUnfolder]: For 322901/322901 co-relation queries the response was YES. [2023-08-29 20:38:03,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192810 conditions, 31472 events. 17626/31472 cut-off events. For 322901/322901 co-relation queries the response was YES. Maximal size of possible extension queue 2993. Compared 312711 event pairs, 1960 based on Foata normal form. 24/30924 useless extension candidates. Maximal degree in co-relation 192743. Up to 8812 conditions per place. [2023-08-29 20:38:03,550 INFO L137 encePairwiseOnDemand]: 332/347 looper letters, 349 selfloop transitions, 548 changer transitions 25/923 dead transitions. [2023-08-29 20:38:03,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 923 transitions, 17051 flow [2023-08-29 20:38:03,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-08-29 20:38:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-08-29 20:38:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 4685 transitions. [2023-08-29 20:38:03,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32930343712659027 [2023-08-29 20:38:03,555 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 4685 transitions. [2023-08-29 20:38:03,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 4685 transitions. [2023-08-29 20:38:03,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:03,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 4685 transitions. [2023-08-29 20:38:03,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 114.26829268292683) internal successors, (4685), 41 states have internal predecessors, (4685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:03,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 347.0) internal successors, (14574), 42 states have internal predecessors, (14574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:03,568 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 347.0) internal successors, (14574), 42 states have internal predecessors, (14574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:03,568 INFO L175 Difference]: Start difference. First operand has 198 places, 476 transitions, 8697 flow. Second operand 41 states and 4685 transitions. [2023-08-29 20:38:03,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 923 transitions, 17051 flow [2023-08-29 20:38:15,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 923 transitions, 16424 flow, removed 313 selfloop flow, removed 1 redundant places. [2023-08-29 20:38:15,645 INFO L231 Difference]: Finished difference. Result has 257 places, 707 transitions, 14496 flow [2023-08-29 20:38:15,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=8602, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=336, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=14496, PETRI_PLACES=257, PETRI_TRANSITIONS=707} [2023-08-29 20:38:15,646 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 159 predicate places. [2023-08-29 20:38:15,646 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 707 transitions, 14496 flow [2023-08-29 20:38:15,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 107.36363636363636) internal successors, (1181), 11 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:15,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:15,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:15,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 20:38:15,647 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:38:15,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:15,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2124970221, now seen corresponding path program 1 times [2023-08-29 20:38:15,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:15,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117475497] [2023-08-29 20:38:15,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:15,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:15,725 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-29 20:38:15,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:15,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117475497] [2023-08-29 20:38:15,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117475497] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:15,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:15,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:38:15,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228321887] [2023-08-29 20:38:15,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:15,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:38:15,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:15,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:38:15,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:38:15,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 347 [2023-08-29 20:38:15,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 707 transitions, 14496 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:15,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:15,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 347 [2023-08-29 20:38:15,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:22,236 INFO L130 PetriNetUnfolder]: 14594/24535 cut-off events. [2023-08-29 20:38:22,236 INFO L131 PetriNetUnfolder]: For 324942/324942 co-relation queries the response was YES. [2023-08-29 20:38:22,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164574 conditions, 24535 events. 14594/24535 cut-off events. For 324942/324942 co-relation queries the response was YES. Maximal size of possible extension queue 1950. Compared 217327 event pairs, 6970 based on Foata normal form. 1008/25543 useless extension candidates. Maximal degree in co-relation 164487. Up to 18572 conditions per place. [2023-08-29 20:38:22,520 INFO L137 encePairwiseOnDemand]: 330/347 looper letters, 154 selfloop transitions, 1 changer transitions 548/704 dead transitions. [2023-08-29 20:38:22,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 704 transitions, 15842 flow [2023-08-29 20:38:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:38:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:38:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2023-08-29 20:38:22,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36527377521613835 [2023-08-29 20:38:22,521 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2023-08-29 20:38:22,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2023-08-29 20:38:22,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:22,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2023-08-29 20:38:22,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:22,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:22,523 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:22,523 INFO L175 Difference]: Start difference. First operand has 257 places, 707 transitions, 14496 flow. Second operand 4 states and 507 transitions. [2023-08-29 20:38:22,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 704 transitions, 15842 flow [2023-08-29 20:38:32,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 704 transitions, 15014 flow, removed 357 selfloop flow, removed 4 redundant places. [2023-08-29 20:38:32,895 INFO L231 Difference]: Finished difference. Result has 248 places, 156 transitions, 2455 flow [2023-08-29 20:38:32,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=13600, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2455, PETRI_PLACES=248, PETRI_TRANSITIONS=156} [2023-08-29 20:38:32,896 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 150 predicate places. [2023-08-29 20:38:32,896 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 156 transitions, 2455 flow [2023-08-29 20:38:32,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:32,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:32,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:32,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 20:38:32,897 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:38:32,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash -536442515, now seen corresponding path program 1 times [2023-08-29 20:38:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:32,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412473029] [2023-08-29 20:38:32,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:32,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:33,126 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-29 20:38:33,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:33,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412473029] [2023-08-29 20:38:33,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412473029] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:33,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:33,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:38:33,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619188228] [2023-08-29 20:38:33,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:33,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:38:33,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:33,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:38:33,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:38:33,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 347 [2023-08-29 20:38:33,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 156 transitions, 2455 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-29 20:38:33,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:33,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 347 [2023-08-29 20:38:33,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:33,539 INFO L130 PetriNetUnfolder]: 1038/1881 cut-off events. [2023-08-29 20:38:33,539 INFO L131 PetriNetUnfolder]: For 38279/38634 co-relation queries the response was YES. [2023-08-29 20:38:33,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11847 conditions, 1881 events. 1038/1881 cut-off events. For 38279/38634 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 11874 event pairs, 139 based on Foata normal form. 473/2351 useless extension candidates. Maximal degree in co-relation 11763. Up to 1178 conditions per place. [2023-08-29 20:38:33,556 INFO L137 encePairwiseOnDemand]: 341/347 looper letters, 202 selfloop transitions, 7 changer transitions 26/278 dead transitions. [2023-08-29 20:38:33,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 278 transitions, 4805 flow [2023-08-29 20:38:33,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:38:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:38:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2023-08-29 20:38:33,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3729106628242075 [2023-08-29 20:38:33,558 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2023-08-29 20:38:33,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2023-08-29 20:38:33,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:33,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2023-08-29 20:38:33,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:33,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:33,559 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:33,559 INFO L175 Difference]: Start difference. First operand has 248 places, 156 transitions, 2455 flow. Second operand 5 states and 647 transitions. [2023-08-29 20:38:33,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 278 transitions, 4805 flow [2023-08-29 20:38:33,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 278 transitions, 3966 flow, removed 156 selfloop flow, removed 40 redundant places. [2023-08-29 20:38:33,616 INFO L231 Difference]: Finished difference. Result has 140 places, 154 transitions, 1948 flow [2023-08-29 20:38:33,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1948, PETRI_PLACES=140, PETRI_TRANSITIONS=154} [2023-08-29 20:38:33,616 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 42 predicate places. [2023-08-29 20:38:33,616 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 154 transitions, 1948 flow [2023-08-29 20:38:33,617 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-29 20:38:33,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:33,617 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-29 20:38:33,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 20:38:33,617 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:38:33,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash 715889195, now seen corresponding path program 1 times [2023-08-29 20:38:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:33,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828643592] [2023-08-29 20:38:33,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:33,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:34,006 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-29 20:38:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:34,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828643592] [2023-08-29 20:38:34,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828643592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:34,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:34,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:38:34,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567354866] [2023-08-29 20:38:34,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:34,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:38:34,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:34,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:38:34,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:38:34,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 347 [2023-08-29 20:38:34,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 154 transitions, 1948 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:34,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:34,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 347 [2023-08-29 20:38:34,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:34,968 INFO L130 PetriNetUnfolder]: 2880/5083 cut-off events. [2023-08-29 20:38:34,969 INFO L131 PetriNetUnfolder]: For 57002/57378 co-relation queries the response was YES. [2023-08-29 20:38:34,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30395 conditions, 5083 events. 2880/5083 cut-off events. For 57002/57378 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 35403 event pairs, 767 based on Foata normal form. 356/5409 useless extension candidates. Maximal degree in co-relation 30342. Up to 1744 conditions per place. [2023-08-29 20:38:35,006 INFO L137 encePairwiseOnDemand]: 343/347 looper letters, 194 selfloop transitions, 15 changer transitions 29/280 dead transitions. [2023-08-29 20:38:35,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 280 transitions, 3843 flow [2023-08-29 20:38:35,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:38:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:38:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-29 20:38:35,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3855907780979827 [2023-08-29 20:38:35,008 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-29 20:38:35,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-29 20:38:35,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:35,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-29 20:38:35,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:35,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:35,010 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:35,010 INFO L175 Difference]: Start difference. First operand has 140 places, 154 transitions, 1948 flow. Second operand 5 states and 669 transitions. [2023-08-29 20:38:35,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 280 transitions, 3843 flow [2023-08-29 20:38:35,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 280 transitions, 3763 flow, removed 34 selfloop flow, removed 1 redundant places. [2023-08-29 20:38:35,177 INFO L231 Difference]: Finished difference. Result has 146 places, 154 transitions, 1933 flow [2023-08-29 20:38:35,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1888, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1933, PETRI_PLACES=146, PETRI_TRANSITIONS=154} [2023-08-29 20:38:35,178 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 48 predicate places. [2023-08-29 20:38:35,178 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 154 transitions, 1933 flow [2023-08-29 20:38:35,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:35,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:35,178 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-29 20:38:35,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 20:38:35,178 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:38:35,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:35,179 INFO L85 PathProgramCache]: Analyzing trace with hash -650587765, now seen corresponding path program 2 times [2023-08-29 20:38:35,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:35,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390589136] [2023-08-29 20:38:35,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:35,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:35,449 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-29 20:38:35,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:35,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390589136] [2023-08-29 20:38:35,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390589136] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:35,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:35,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:38:35,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151129272] [2023-08-29 20:38:35,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:35,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:38:35,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:35,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:38:35,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:38:35,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 347 [2023-08-29 20:38:35,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 154 transitions, 1933 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:35,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:35,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 347 [2023-08-29 20:38:35,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:36,101 INFO L130 PetriNetUnfolder]: 1301/2577 cut-off events. [2023-08-29 20:38:36,102 INFO L131 PetriNetUnfolder]: For 32416/32932 co-relation queries the response was YES. [2023-08-29 20:38:36,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15080 conditions, 2577 events. 1301/2577 cut-off events. For 32416/32932 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 18892 event pairs, 61 based on Foata normal form. 715/3267 useless extension candidates. Maximal degree in co-relation 15024. Up to 1134 conditions per place. [2023-08-29 20:38:36,117 INFO L137 encePairwiseOnDemand]: 341/347 looper letters, 194 selfloop transitions, 11 changer transitions 32/270 dead transitions. [2023-08-29 20:38:36,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 270 transitions, 3934 flow [2023-08-29 20:38:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:38:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:38:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 900 transitions. [2023-08-29 20:38:36,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37052284890901604 [2023-08-29 20:38:36,119 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 900 transitions. [2023-08-29 20:38:36,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 900 transitions. [2023-08-29 20:38:36,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:36,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 900 transitions. [2023-08-29 20:38:36,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.57142857142858) internal successors, (900), 7 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-29 20:38:36,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 347.0) internal successors, (2776), 8 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,121 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 347.0) internal successors, (2776), 8 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,121 INFO L175 Difference]: Start difference. First operand has 146 places, 154 transitions, 1933 flow. Second operand 7 states and 900 transitions. [2023-08-29 20:38:36,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 270 transitions, 3934 flow [2023-08-29 20:38:36,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 270 transitions, 3699 flow, removed 53 selfloop flow, removed 8 redundant places. [2023-08-29 20:38:36,164 INFO L231 Difference]: Finished difference. Result has 146 places, 126 transitions, 1491 flow [2023-08-29 20:38:36,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1491, PETRI_PLACES=146, PETRI_TRANSITIONS=126} [2023-08-29 20:38:36,165 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 48 predicate places. [2023-08-29 20:38:36,165 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 126 transitions, 1491 flow [2023-08-29 20:38:36,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:36,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:36,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 20:38:36,166 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:38:36,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1242315291, now seen corresponding path program 1 times [2023-08-29 20:38:36,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:36,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875040351] [2023-08-29 20:38:36,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:36,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:36,471 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-29 20:38:36,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:36,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875040351] [2023-08-29 20:38:36,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875040351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:36,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:36,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:38:36,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548720737] [2023-08-29 20:38:36,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:36,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:38:36,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:36,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:38:36,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:38:36,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 347 [2023-08-29 20:38:36,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 126 transitions, 1491 flow. Second operand has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:36,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 347 [2023-08-29 20:38:36,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:36,936 INFO L130 PetriNetUnfolder]: 1140/2307 cut-off events. [2023-08-29 20:38:36,936 INFO L131 PetriNetUnfolder]: For 24830/25209 co-relation queries the response was YES. [2023-08-29 20:38:36,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14455 conditions, 2307 events. 1140/2307 cut-off events. For 24830/25209 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 17174 event pairs, 40 based on Foata normal form. 394/2676 useless extension candidates. Maximal degree in co-relation 14401. Up to 1051 conditions per place. [2023-08-29 20:38:36,952 INFO L137 encePairwiseOnDemand]: 341/347 looper letters, 187 selfloop transitions, 15 changer transitions 32/266 dead transitions. [2023-08-29 20:38:36,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 266 transitions, 3711 flow [2023-08-29 20:38:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:38:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:38:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1138 transitions. [2023-08-29 20:38:36,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3643932116554595 [2023-08-29 20:38:36,954 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1138 transitions. [2023-08-29 20:38:36,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1138 transitions. [2023-08-29 20:38:36,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:36,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1138 transitions. [2023-08-29 20:38:36,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.44444444444444) internal successors, (1138), 9 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 347.0) internal successors, (3470), 10 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,958 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 347.0) internal successors, (3470), 10 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,959 INFO L175 Difference]: Start difference. First operand has 146 places, 126 transitions, 1491 flow. Second operand 9 states and 1138 transitions. [2023-08-29 20:38:36,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 266 transitions, 3711 flow [2023-08-29 20:38:37,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 266 transitions, 3455 flow, removed 40 selfloop flow, removed 8 redundant places. [2023-08-29 20:38:37,037 INFO L231 Difference]: Finished difference. Result has 149 places, 122 transitions, 1375 flow [2023-08-29 20:38:37,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1375, PETRI_PLACES=149, PETRI_TRANSITIONS=122} [2023-08-29 20:38:37,038 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 51 predicate places. [2023-08-29 20:38:37,038 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 122 transitions, 1375 flow [2023-08-29 20:38:37,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:37,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:37,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:37,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-29 20:38:37,039 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:38:37,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:37,039 INFO L85 PathProgramCache]: Analyzing trace with hash 656334673, now seen corresponding path program 1 times [2023-08-29 20:38:37,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:37,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100932772] [2023-08-29 20:38:37,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:37,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:38:37,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:38:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:38:37,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:38:37,245 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:38:37,245 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (100 of 101 remaining) [2023-08-29 20:38:37,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 101 remaining) [2023-08-29 20:38:37,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 101 remaining) [2023-08-29 20:38:37,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 101 remaining) [2023-08-29 20:38:37,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 101 remaining) [2023-08-29 20:38:37,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 101 remaining) [2023-08-29 20:38:37,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 101 remaining) [2023-08-29 20:38:37,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 101 remaining) [2023-08-29 20:38:37,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 101 remaining) [2023-08-29 20:38:37,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 101 remaining) [2023-08-29 20:38:37,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 101 remaining) [2023-08-29 20:38:37,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 101 remaining) [2023-08-29 20:38:37,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 101 remaining) [2023-08-29 20:38:37,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 101 remaining) [2023-08-29 20:38:37,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 101 remaining) [2023-08-29 20:38:37,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 101 remaining) [2023-08-29 20:38:37,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 101 remaining) [2023-08-29 20:38:37,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 101 remaining) [2023-08-29 20:38:37,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 101 remaining) [2023-08-29 20:38:37,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 101 remaining) [2023-08-29 20:38:37,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 101 remaining) [2023-08-29 20:38:37,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 101 remaining) [2023-08-29 20:38:37,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 101 remaining) [2023-08-29 20:38:37,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 101 remaining) [2023-08-29 20:38:37,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 101 remaining) [2023-08-29 20:38:37,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 101 remaining) [2023-08-29 20:38:37,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 101 remaining) [2023-08-29 20:38:37,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 101 remaining) [2023-08-29 20:38:37,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 101 remaining) [2023-08-29 20:38:37,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 101 remaining) [2023-08-29 20:38:37,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 101 remaining) [2023-08-29 20:38:37,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 101 remaining) [2023-08-29 20:38:37,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 101 remaining) [2023-08-29 20:38:37,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 101 remaining) [2023-08-29 20:38:37,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 101 remaining) [2023-08-29 20:38:37,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 101 remaining) [2023-08-29 20:38:37,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 101 remaining) [2023-08-29 20:38:37,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 101 remaining) [2023-08-29 20:38:37,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 101 remaining) [2023-08-29 20:38:37,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 101 remaining) [2023-08-29 20:38:37,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 101 remaining) [2023-08-29 20:38:37,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 101 remaining) [2023-08-29 20:38:37,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 101 remaining) [2023-08-29 20:38:37,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 101 remaining) [2023-08-29 20:38:37,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 101 remaining) [2023-08-29 20:38:37,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 101 remaining) [2023-08-29 20:38:37,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 101 remaining) [2023-08-29 20:38:37,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 101 remaining) [2023-08-29 20:38:37,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 101 remaining) [2023-08-29 20:38:37,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 101 remaining) [2023-08-29 20:38:37,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 101 remaining) [2023-08-29 20:38:37,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 101 remaining) [2023-08-29 20:38:37,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 101 remaining) [2023-08-29 20:38:37,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 101 remaining) [2023-08-29 20:38:37,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 101 remaining) [2023-08-29 20:38:37,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 101 remaining) [2023-08-29 20:38:37,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 101 remaining) [2023-08-29 20:38:37,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 101 remaining) [2023-08-29 20:38:37,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 101 remaining) [2023-08-29 20:38:37,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 101 remaining) [2023-08-29 20:38:37,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 101 remaining) [2023-08-29 20:38:37,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (39 of 101 remaining) [2023-08-29 20:38:37,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 101 remaining) [2023-08-29 20:38:37,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 101 remaining) [2023-08-29 20:38:37,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 101 remaining) [2023-08-29 20:38:37,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 101 remaining) [2023-08-29 20:38:37,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 101 remaining) [2023-08-29 20:38:37,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 101 remaining) [2023-08-29 20:38:37,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 101 remaining) [2023-08-29 20:38:37,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 101 remaining) [2023-08-29 20:38:37,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 101 remaining) [2023-08-29 20:38:37,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 101 remaining) [2023-08-29 20:38:37,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 101 remaining) [2023-08-29 20:38:37,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 101 remaining) [2023-08-29 20:38:37,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 101 remaining) [2023-08-29 20:38:37,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 101 remaining) [2023-08-29 20:38:37,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 101 remaining) [2023-08-29 20:38:37,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 101 remaining) [2023-08-29 20:38:37,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 101 remaining) [2023-08-29 20:38:37,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 101 remaining) [2023-08-29 20:38:37,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 101 remaining) [2023-08-29 20:38:37,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 101 remaining) [2023-08-29 20:38:37,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 101 remaining) [2023-08-29 20:38:37,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 101 remaining) [2023-08-29 20:38:37,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 101 remaining) [2023-08-29 20:38:37,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 101 remaining) [2023-08-29 20:38:37,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 101 remaining) [2023-08-29 20:38:37,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 101 remaining) [2023-08-29 20:38:37,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 101 remaining) [2023-08-29 20:38:37,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 101 remaining) [2023-08-29 20:38:37,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 101 remaining) [2023-08-29 20:38:37,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 101 remaining) [2023-08-29 20:38:37,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 101 remaining) [2023-08-29 20:38:37,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 101 remaining) [2023-08-29 20:38:37,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 101 remaining) [2023-08-29 20:38:37,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 101 remaining) [2023-08-29 20:38:37,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 101 remaining) [2023-08-29 20:38:37,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 101 remaining) [2023-08-29 20:38:37,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 101 remaining) [2023-08-29 20:38:37,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 101 remaining) [2023-08-29 20:38:37,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 101 remaining) [2023-08-29 20:38:37,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-29 20:38:37,266 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:37,272 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:38:37,272 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:38:37,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:38:37 BasicIcfg [2023-08-29 20:38:37,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:38:37,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:38:37,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:38:37,359 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:38:37,359 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:35:27" (3/4) ... [2023-08-29 20:38:37,361 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:38:37,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:38:37,362 INFO L158 Benchmark]: Toolchain (without parser) took 191642.78ms. Allocated memory was 65.0MB in the beginning and 9.8GB in the end (delta: 9.8GB). Free memory was 28.6MB in the beginning and 5.5GB in the end (delta: -5.5GB). Peak memory consumption was 4.3GB. Max. memory is 16.1GB. [2023-08-29 20:38:37,362 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 65.0MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:38:37,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.40ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 28.4MB in the beginning and 45.2MB in the end (delta: -16.9MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2023-08-29 20:38:37,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.97ms. Allocated memory is still 88.1MB. Free memory was 45.2MB in the beginning and 65.6MB in the end (delta: -20.3MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2023-08-29 20:38:37,363 INFO L158 Benchmark]: Boogie Preprocessor took 30.27ms. Allocated memory is still 88.1MB. Free memory was 65.6MB in the beginning and 63.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:38:37,363 INFO L158 Benchmark]: RCFGBuilder took 1367.88ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 63.1MB in the beginning and 50.9MB in the end (delta: 12.2MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. [2023-08-29 20:38:37,363 INFO L158 Benchmark]: TraceAbstraction took 189569.39ms. Allocated memory was 107.0MB in the beginning and 9.8GB in the end (delta: 9.7GB). Free memory was 50.4MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 4.3GB. Max. memory is 16.1GB. [2023-08-29 20:38:37,364 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 9.8GB. Free memory was 5.5GB in the beginning and 5.5GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:38:37,371 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 65.0MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.40ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 28.4MB in the beginning and 45.2MB in the end (delta: -16.9MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.97ms. Allocated memory is still 88.1MB. Free memory was 45.2MB in the beginning and 65.6MB in the end (delta: -20.3MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.27ms. Allocated memory is still 88.1MB. Free memory was 65.6MB in the beginning and 63.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1367.88ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 63.1MB in the beginning and 50.9MB in the end (delta: 12.2MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. * TraceAbstraction took 189569.39ms. Allocated memory was 107.0MB in the beginning and 9.8GB in the end (delta: 9.7GB). Free memory was 50.4MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 4.3GB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 9.8GB. Free memory was 5.5GB in the beginning and 5.5GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.1s, 194 PlacesBefore, 98 PlacesAfterwards, 186 TransitionsBefore, 89 TransitionsAfterwards, 8500 CoEnabledTransitionPairs, 7 FixpointIterations, 72 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 158 TotalNumberOfCompositions, 43557 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9980, independent: 9287, independent conditional: 0, independent unconditional: 9287, dependent: 693, dependent conditional: 0, dependent unconditional: 693, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3009, independent: 2915, independent conditional: 0, independent unconditional: 2915, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9980, independent: 6372, independent conditional: 0, independent unconditional: 6372, dependent: 599, dependent conditional: 0, dependent unconditional: 599, unknown: 3009, unknown conditional: 0, unknown unconditional: 3009] , Statistics on independence cache: Total cache size (in pairs): 458, Positive cache size: 397, Positive conditional cache size: 0, Positive unconditional cache size: 397, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, 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; [L852] 0 pthread_t t1837; [L853] FCALL, FORK 0 pthread_create(&t1837, ((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(&t1837, ((void *)0), P0, ((void *)0))=-2, t1837={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}] [L854] 0 pthread_t t1838; 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, t1837={7:0}, t1838={5: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] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 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$$choice1=0, 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}] [L855] FCALL, FORK 0 pthread_create(&t1838, ((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=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(&t1838, ((void *)0), P1, ((void *)0))=-1, t1837={7:0}, t1838={5:0}, weak$$choice1=0, 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}] [L779] 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$$choice1=0, 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}] [L791] 2 x = 1 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, 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}] [L856] 0 pthread_t t1839; 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1837={7:0}, t1838={5:0}, t1839={6:0}, weak$$choice1=0, 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}] [L794] 2 y = 1 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, 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}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_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$$choice1=0, 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}] [L857] FCALL, FORK 0 pthread_create(&t1839, ((void *)0), P2, ((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=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1839, ((void *)0), P2, ((void *)0))=0, t1837={7:0}, t1838={5:0}, t1839={6:0}, weak$$choice1=0, 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}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 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=1, 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$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L827] 3 y = 2 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=1, 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$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L830] 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) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] 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) [L830] 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) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_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=1, 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$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] 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) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] 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) [L863] 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) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 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 [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 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}, \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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1837={7:0}, t1838={5:0}, t1839={6:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=255, x=1, y$flush_delayed=0, y$mem_tmp=2, 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}] - 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: -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: -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: -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: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 857]: 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: 855]: 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, 250 locations, 101 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: 189.3s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 150.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4723 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3774 mSDsluCounter, 1892 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1691 mSDsCounter, 1108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11646 IncrementalHoareTripleChecker+Invalid, 12754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1108 mSolverCounterUnsat, 201 mSDtfsCounter, 11646 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14496occurred in iteration=23, InterpolantAutomatonStates: 236, 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, 1.1s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 337 ConstructedInterpolants, 0 QuantifiedInterpolants, 5389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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-29 20:38:37,417 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/safe002_rmo.oepc.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 303fb09b32b7ab2953a798b1c14f8a25fd3d0e1788678487baddbc8a976b0d5f --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:38:39,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:38:39,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:38:39,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:38:39,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:38:39,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:38:39,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:38:39,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:38:39,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:38:39,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:38:39,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:38:40,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:38:40,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:38:40,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:38:40,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:38:40,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:38:40,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:38:40,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:38:40,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:38:40,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:38:40,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:38:40,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:38:40,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:38:40,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:38:40,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:38:40,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:38:40,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:38:40,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:38:40,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:38:40,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:38:40,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:38:40,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:38:40,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:38:40,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:38:40,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:38:40,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:38:40,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:38:40,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:38:40,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:38:40,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:38:40,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:38:40,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:38:40,086 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:38:40,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:38:40,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:38:40,087 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:38:40,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:38:40,088 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:38:40,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:38:40,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:38:40,089 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:38:40,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:38:40,090 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:38:40,090 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:38:40,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:38:40,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:38:40,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:38:40,091 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:38:40,091 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:38:40,091 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:38:40,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:38:40,092 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:38:40,092 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:38:40,092 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:38:40,092 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:38:40,092 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:38:40,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:38:40,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:38:40,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:38:40,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:38:40,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:38:40,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:38:40,094 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:38:40,094 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:38:40,094 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:38:40,094 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:38:40,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:38:40,095 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:38:40,095 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:38:40,095 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 -> 303fb09b32b7ab2953a798b1c14f8a25fd3d0e1788678487baddbc8a976b0d5f 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 -> AFTER [2023-08-29 20:38:40,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:38:40,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:38:40,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:38:40,415 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:38:40,415 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:38:40,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2023-08-29 20:38:41,522 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:38:41,780 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:38:41,781 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2023-08-29 20:38:41,808 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a194d2b/2a0d9a304dec4cff84719356bda1e2c1/FLAG645ca012f [2023-08-29 20:38:41,819 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a194d2b/2a0d9a304dec4cff84719356bda1e2c1 [2023-08-29 20:38:41,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:38:41,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:38:41,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:38:41,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:38:41,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:38:41,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:38:41" (1/1) ... [2023-08-29 20:38:41,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41503c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:41, skipping insertion in model container [2023-08-29 20:38:41,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:38:41" (1/1) ... [2023-08-29 20:38:41,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:38:41,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:38:42,090 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/safe002_rmo.oepc.i[993,1006] [2023-08-29 20:38:42,316 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:38:42,333 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:38:42,345 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/safe002_rmo.oepc.i[993,1006] [2023-08-29 20:38:42,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:38:42,438 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:38:42,439 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:38:42,444 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:38:42,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:42 WrapperNode [2023-08-29 20:38:42,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:38:42,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:38:42,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:38:42,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:38:42,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:42" (1/1) ... [2023-08-29 20:38:42,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:42" (1/1) ... [2023-08-29 20:38:42,523 INFO L138 Inliner]: procedures = 180, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 171 [2023-08-29 20:38:42,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:38:42,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:38:42,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:38:42,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:38:42,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:42" (1/1) ... [2023-08-29 20:38:42,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:42" (1/1) ... [2023-08-29 20:38:42,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:42" (1/1) ... [2023-08-29 20:38:42,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:42" (1/1) ... [2023-08-29 20:38:42,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:42" (1/1) ... [2023-08-29 20:38:42,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:42" (1/1) ... [2023-08-29 20:38:42,581 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:42" (1/1) ... [2023-08-29 20:38:42,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:42" (1/1) ... [2023-08-29 20:38:42,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:38:42,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:38:42,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:38:42,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:38:42,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:42" (1/1) ... [2023-08-29 20:38:42,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:38:42,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:38:42,628 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-29 20:38:42,629 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-29 20:38:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 20:38:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:38:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:38:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:38:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:38:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:38:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:38:42,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-29 20:38:42,663 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:38:42,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:38:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:38:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:38:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:38:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:38:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:38:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:38:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:38:42,666 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:38:42,815 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:38:42,817 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:38:43,557 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:38:44,227 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:38:44,227 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:38:44,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:38:44 BoogieIcfgContainer [2023-08-29 20:38:44,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:38:44,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:38:44,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:38:44,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:38:44,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:38:41" (1/3) ... [2023-08-29 20:38:44,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ab139e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:38:44, skipping insertion in model container [2023-08-29 20:38:44,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:42" (2/3) ... [2023-08-29 20:38:44,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ab139e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:38:44, skipping insertion in model container [2023-08-29 20:38:44,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:38:44" (3/3) ... [2023-08-29 20:38:44,237 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_rmo.oepc.i [2023-08-29 20:38:44,255 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:38:44,255 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-08-29 20:38:44,256 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:38:44,415 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:38:44,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 190 transitions, 395 flow [2023-08-29 20:38:44,548 INFO L130 PetriNetUnfolder]: 2/187 cut-off events. [2023-08-29 20:38:44,548 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:38:44,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 187 events. 2/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 355 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2023-08-29 20:38:44,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 190 transitions, 395 flow [2023-08-29 20:38:44,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 187 transitions, 383 flow [2023-08-29 20:38:44,568 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:38:44,579 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 187 transitions, 383 flow [2023-08-29 20:38:44,583 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 187 transitions, 383 flow [2023-08-29 20:38:44,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 187 transitions, 383 flow [2023-08-29 20:38:44,647 INFO L130 PetriNetUnfolder]: 2/187 cut-off events. [2023-08-29 20:38:44,647 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:38:44,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 187 events. 2/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2023-08-29 20:38:44,654 INFO L119 LiptonReduction]: Number of co-enabled transitions 8500 [2023-08-29 20:39:29,729 INFO L134 LiptonReduction]: Checked pairs total: 43248 [2023-08-29 20:39:29,730 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-29 20:39:29,742 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:39:29,747 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;@7ef743df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:39:29,747 INFO L358 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2023-08-29 20:39:29,749 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:39:29,749 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:39:29,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:29,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:39:29,750 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:39:29,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:29,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1194, now seen corresponding path program 1 times [2023-08-29 20:39:29,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:29,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101748071] [2023-08-29 20:39:29,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:29,765 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-29 20:39:29,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:29,767 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-29 20:39:29,769 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-29 20:39:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:29,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:39:29,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:39:29,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:29,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:29,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101748071] [2023-08-29 20:39:29,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101748071] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:29,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:29,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:39:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795540954] [2023-08-29 20:39:29,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:29,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:39:29,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:29,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:39:29,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:39:29,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 341 [2023-08-29 20:39:29,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 187 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:29,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:29,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 341 [2023-08-29 20:39:29,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:34,466 INFO L130 PetriNetUnfolder]: 18354/25862 cut-off events. [2023-08-29 20:39:34,466 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:39:34,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51649 conditions, 25862 events. 18354/25862 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2326. Compared 180997 event pairs, 18354 based on Foata normal form. 400/10667 useless extension candidates. Maximal degree in co-relation 51638. Up to 25691 conditions per place. [2023-08-29 20:39:34,671 INFO L137 encePairwiseOnDemand]: 303/341 looper letters, 45 selfloop transitions, 0 changer transitions 0/51 dead transitions. [2023-08-29 20:39:34,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 201 flow [2023-08-29 20:39:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:39:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:39:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 339 transitions. [2023-08-29 20:39:34,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4970674486803519 [2023-08-29 20:39:34,691 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 339 transitions. [2023-08-29 20:39:34,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 339 transitions. [2023-08-29 20:39:34,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:34,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 339 transitions. [2023-08-29 20:39:34,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 169.5) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:34,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:34,709 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:34,711 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 187 flow. Second operand 2 states and 339 transitions. [2023-08-29 20:39:34,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 201 flow [2023-08-29 20:39:34,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:39:34,721 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 108 flow [2023-08-29 20:39:34,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-29 20:39:34,727 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2023-08-29 20:39:34,727 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 108 flow [2023-08-29 20:39:34,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:34,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:34,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:39:34,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-29 20:39:34,945 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-29 20:39:34,946 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:39:34,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1180855, now seen corresponding path program 1 times [2023-08-29 20:39:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:34,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085085270] [2023-08-29 20:39:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:34,948 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-29 20:39:34,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:34,950 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-29 20:39:34,953 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-29 20:39:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:35,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:39:35,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:35,195 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 20:39:35,197 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-29 20:39:35,234 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-29 20:39:35,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:35,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:35,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085085270] [2023-08-29 20:39:35,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085085270] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:35,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:35,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:39:35,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714222120] [2023-08-29 20:39:35,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:35,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:39:35,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:35,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:39:35,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:39:35,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 341 [2023-08-29 20:39:35,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 108 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-29 20:39:35,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:35,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 341 [2023-08-29 20:39:35,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:37,366 INFO L130 PetriNetUnfolder]: 9283/13254 cut-off events. [2023-08-29 20:39:37,367 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:39:37,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26511 conditions, 13254 events. 9283/13254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1064. Compared 85289 event pairs, 5915 based on Foata normal form. 584/7419 useless extension candidates. Maximal degree in co-relation 26508. Up to 6798 conditions per place. [2023-08-29 20:39:37,456 INFO L137 encePairwiseOnDemand]: 328/341 looper letters, 56 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-29 20:39:37,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 246 flow [2023-08-29 20:39:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:39:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:39:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-08-29 20:39:37,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281524926686217 [2023-08-29 20:39:37,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-08-29 20:39:37,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-08-29 20:39:37,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:37,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-08-29 20:39:37,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:37,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:37,465 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:37,465 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 108 flow. Second operand 3 states and 438 transitions. [2023-08-29 20:39:37,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 246 flow [2023-08-29 20:39:37,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:39:37,467 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 124 flow [2023-08-29 20:39:37,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-08-29 20:39:37,468 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2023-08-29 20:39:37,468 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 124 flow [2023-08-29 20:39:37,469 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-29 20:39:37,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:37,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:39:37,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-29 20:39:37,678 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-29 20:39:37,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:39:37,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1180856, now seen corresponding path program 1 times [2023-08-29 20:39:37,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:37,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162937963] [2023-08-29 20:39:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:37,684 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-29 20:39:37,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:37,686 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-29 20:39:37,689 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-29 20:39:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:37,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:39:37,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:37,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:39:37,836 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-29 20:39:37,864 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-29 20:39:37,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:37,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162937963] [2023-08-29 20:39:37,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162937963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:37,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:37,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:39:37,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650756994] [2023-08-29 20:39:37,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:37,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:39:37,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:37,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:39:37,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:39:37,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 341 [2023-08-29 20:39:37,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:37,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:37,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 341 [2023-08-29 20:39:37,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:38,752 INFO L130 PetriNetUnfolder]: 2535/3803 cut-off events. [2023-08-29 20:39:38,752 INFO L131 PetriNetUnfolder]: For 437/546 co-relation queries the response was YES. [2023-08-29 20:39:38,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8556 conditions, 3803 events. 2535/3803 cut-off events. For 437/546 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 21628 event pairs, 2535 based on Foata normal form. 220/3311 useless extension candidates. Maximal degree in co-relation 8551. Up to 3702 conditions per place. [2023-08-29 20:39:38,775 INFO L137 encePairwiseOnDemand]: 330/341 looper letters, 31 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2023-08-29 20:39:38,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 38 transitions, 170 flow [2023-08-29 20:39:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:39:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:39:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-29 20:39:38,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115347018572825 [2023-08-29 20:39:38,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-29 20:39:38,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-29 20:39:38,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:38,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-29 20:39:38,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:38,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:38,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:38,787 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 124 flow. Second operand 3 states and 421 transitions. [2023-08-29 20:39:38,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 38 transitions, 170 flow [2023-08-29 20:39:38,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:39:38,791 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 100 flow [2023-08-29 20:39:38,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-08-29 20:39:38,792 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -49 predicate places. [2023-08-29 20:39:38,796 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 100 flow [2023-08-29 20:39:38,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:38,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:38,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:38,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:39:39,006 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-29 20:39:39,006 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:39:39,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:39,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1920053031, now seen corresponding path program 1 times [2023-08-29 20:39:39,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:39,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218774523] [2023-08-29 20:39:39,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:39,008 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-29 20:39:39,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:39,009 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-29 20:39:39,012 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-29 20:39:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:39,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:39:39,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:39,167 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-29 20:39:39,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:39,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:39,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218774523] [2023-08-29 20:39:39,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218774523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:39,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:39,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:39:39,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287852608] [2023-08-29 20:39:39,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:39,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:39:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:39:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:39:39,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 341 [2023-08-29 20:39:39,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:39,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:39,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 341 [2023-08-29 20:39:39,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:39,670 INFO L130 PetriNetUnfolder]: 950/1589 cut-off events. [2023-08-29 20:39:39,670 INFO L131 PetriNetUnfolder]: For 121/155 co-relation queries the response was YES. [2023-08-29 20:39:39,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3498 conditions, 1589 events. 950/1589 cut-off events. For 121/155 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 8858 event pairs, 377 based on Foata normal form. 18/1336 useless extension candidates. Maximal degree in co-relation 3493. Up to 1464 conditions per place. [2023-08-29 20:39:39,678 INFO L137 encePairwiseOnDemand]: 336/341 looper letters, 42 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2023-08-29 20:39:39,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 224 flow [2023-08-29 20:39:39,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:39:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:39:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-29 20:39:39,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4095796676441838 [2023-08-29 20:39:39,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-29 20:39:39,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-29 20:39:39,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:39,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-29 20:39:39,682 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-29 20:39:39,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:39,685 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:39,685 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 100 flow. Second operand 3 states and 419 transitions. [2023-08-29 20:39:39,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 224 flow [2023-08-29 20:39:39,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 223 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:39:39,687 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 125 flow [2023-08-29 20:39:39,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-29 20:39:39,688 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -48 predicate places. [2023-08-29 20:39:39,688 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 125 flow [2023-08-29 20:39:39,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:39,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:39,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:39,704 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-29 20:39:39,899 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-29 20:39:39,899 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:39:39,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:39,900 INFO L85 PathProgramCache]: Analyzing trace with hash 137123159, now seen corresponding path program 1 times [2023-08-29 20:39:39,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:39,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971052212] [2023-08-29 20:39:39,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:39,900 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-29 20:39:39,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:39,901 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-29 20:39:39,902 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-29 20:39:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:40,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:39:40,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:40,066 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-29 20:39:40,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:40,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:40,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971052212] [2023-08-29 20:39:40,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971052212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:40,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:40,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:39:40,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974625588] [2023-08-29 20:39:40,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:40,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:39:40,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:40,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:39:40,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:39:40,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 341 [2023-08-29 20:39:40,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:40,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:40,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 341 [2023-08-29 20:39:40,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:40,366 INFO L130 PetriNetUnfolder]: 212/434 cut-off events. [2023-08-29 20:39:40,366 INFO L131 PetriNetUnfolder]: For 68/72 co-relation queries the response was YES. [2023-08-29 20:39:40,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 434 events. 212/434 cut-off events. For 68/72 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1854 event pairs, 68 based on Foata normal form. 21/402 useless extension candidates. Maximal degree in co-relation 1065. Up to 246 conditions per place. [2023-08-29 20:39:40,368 INFO L137 encePairwiseOnDemand]: 336/341 looper letters, 50 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-08-29 20:39:40,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 295 flow [2023-08-29 20:39:40,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:39:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:39:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-29 20:39:40,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40615835777126097 [2023-08-29 20:39:40,370 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-29 20:39:40,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-29 20:39:40,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:40,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-29 20:39:40,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:40,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:40,375 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:40,375 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 125 flow. Second operand 4 states and 554 transitions. [2023-08-29 20:39:40,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 295 flow [2023-08-29 20:39:40,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:39:40,377 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 161 flow [2023-08-29 20:39:40,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-08-29 20:39:40,378 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -45 predicate places. [2023-08-29 20:39:40,378 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 161 flow [2023-08-29 20:39:40,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:40,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:40,379 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-29 20:39:40,391 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-29 20:39:40,588 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-29 20:39:40,589 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:39:40,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:40,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1496010275, now seen corresponding path program 1 times [2023-08-29 20:39:40,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:40,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039659821] [2023-08-29 20:39:40,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:40,591 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-29 20:39:40,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:40,592 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-29 20:39:40,593 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-29 20:39:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:40,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:39:40,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:40,771 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-29 20:39:40,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:40,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:40,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039659821] [2023-08-29 20:39:40,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039659821] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:40,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:40,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:39:40,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659805759] [2023-08-29 20:39:40,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:40,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:39:40,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:40,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:39:40,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:39:40,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 341 [2023-08-29 20:39:40,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:40,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:40,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 341 [2023-08-29 20:39:40,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:41,073 INFO L130 PetriNetUnfolder]: 114/230 cut-off events. [2023-08-29 20:39:41,073 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2023-08-29 20:39:41,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 230 events. 114/230 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 783 event pairs, 40 based on Foata normal form. 8/231 useless extension candidates. Maximal degree in co-relation 636. Up to 92 conditions per place. [2023-08-29 20:39:41,074 INFO L137 encePairwiseOnDemand]: 336/341 looper letters, 40 selfloop transitions, 10 changer transitions 1/54 dead transitions. [2023-08-29 20:39:41,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 275 flow [2023-08-29 20:39:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:39:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:39:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2023-08-29 20:39:41,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39413489736070384 [2023-08-29 20:39:41,077 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2023-08-29 20:39:41,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2023-08-29 20:39:41,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:41,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2023-08-29 20:39:41,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:41,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:41,082 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:41,083 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 161 flow. Second operand 5 states and 672 transitions. [2023-08-29 20:39:41,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 275 flow [2023-08-29 20:39:41,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 259 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:39:41,085 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 139 flow [2023-08-29 20:39:41,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-29 20:39:41,086 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -51 predicate places. [2023-08-29 20:39:41,086 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 139 flow [2023-08-29 20:39:41,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:41,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:41,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:41,103 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-29 20:39:41,297 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-29 20:39:41,297 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:39:41,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:41,298 INFO L85 PathProgramCache]: Analyzing trace with hash 405329702, now seen corresponding path program 1 times [2023-08-29 20:39:41,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:41,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967753228] [2023-08-29 20:39:41,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:41,299 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-29 20:39:41,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:41,300 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-29 20:39:41,301 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-29 20:39:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:41,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 20:39:41,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:41,526 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-29 20:39:41,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:41,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:41,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967753228] [2023-08-29 20:39:41,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967753228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:41,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:41,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:39:41,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622585204] [2023-08-29 20:39:41,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:41,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:39:41,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:41,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:39:41,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:39:41,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 341 [2023-08-29 20:39:41,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:41,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:41,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 341 [2023-08-29 20:39:41,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:41,812 INFO L130 PetriNetUnfolder]: 168/348 cut-off events. [2023-08-29 20:39:41,812 INFO L131 PetriNetUnfolder]: For 390/390 co-relation queries the response was YES. [2023-08-29 20:39:41,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 348 events. 168/348 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1406 event pairs, 27 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 921. Up to 231 conditions per place. [2023-08-29 20:39:41,814 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 46 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-29 20:39:41,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 291 flow [2023-08-29 20:39:41,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:39:41,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:39:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-08-29 20:39:41,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2023-08-29 20:39:41,816 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-08-29 20:39:41,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-08-29 20:39:41,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:41,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-08-29 20:39:41,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:41,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:41,820 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:41,820 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 139 flow. Second operand 4 states and 517 transitions. [2023-08-29 20:39:41,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 291 flow [2023-08-29 20:39:41,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 259 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-29 20:39:41,823 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 115 flow [2023-08-29 20:39:41,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, 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=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-29 20:39:41,824 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -53 predicate places. [2023-08-29 20:39:41,824 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 115 flow [2023-08-29 20:39:41,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:41,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:41,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:41,842 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-29 20:39:42,034 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-29 20:39:42,035 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:39:42,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash 176406831, now seen corresponding path program 1 times [2023-08-29 20:39:42,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:42,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500968561] [2023-08-29 20:39:42,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:42,036 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-29 20:39:42,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:42,040 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-29 20:39:42,043 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-29 20:39:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:42,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:39:42,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:42,319 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-29 20:39:42,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:42,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:42,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500968561] [2023-08-29 20:39:42,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500968561] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:42,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:42,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:39:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412974417] [2023-08-29 20:39:42,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:42,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:39:42,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:42,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:39:42,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:39:42,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 341 [2023-08-29 20:39:42,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:42,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:42,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 341 [2023-08-29 20:39:42,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:42,565 INFO L130 PetriNetUnfolder]: 168/347 cut-off events. [2023-08-29 20:39:42,565 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2023-08-29 20:39:42,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 347 events. 168/347 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1400 event pairs, 27 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 900. Up to 233 conditions per place. [2023-08-29 20:39:42,567 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 45 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-29 20:39:42,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 259 flow [2023-08-29 20:39:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:39:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:39:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-29 20:39:42,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2023-08-29 20:39:42,569 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-29 20:39:42,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-29 20:39:42,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:42,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-29 20:39:42,571 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-29 20:39:42,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:42,575 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:42,575 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 115 flow. Second operand 4 states and 528 transitions. [2023-08-29 20:39:42,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 259 flow [2023-08-29 20:39:42,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:39:42,577 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 114 flow [2023-08-29 20:39:42,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=4, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-29 20:39:42,580 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -53 predicate places. [2023-08-29 20:39:42,580 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 114 flow [2023-08-29 20:39:42,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:42,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:42,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:42,602 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-29 20:39:42,793 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-29 20:39:42,793 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:39:42,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash 176407182, now seen corresponding path program 1 times [2023-08-29 20:39:42,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:42,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399718637] [2023-08-29 20:39:42,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:42,795 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-29 20:39:42,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:42,796 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-29 20:39:42,798 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-29 20:39:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:42,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:39:42,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:43,006 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-29 20:39:43,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:43,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:43,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399718637] [2023-08-29 20:39:43,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399718637] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:43,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:43,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:39:43,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025033970] [2023-08-29 20:39:43,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:43,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:39:43,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:43,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:39:43,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:39:43,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 341 [2023-08-29 20:39:43,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:43,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:43,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 341 [2023-08-29 20:39:43,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:43,301 INFO L130 PetriNetUnfolder]: 237/462 cut-off events. [2023-08-29 20:39:43,301 INFO L131 PetriNetUnfolder]: For 242/242 co-relation queries the response was YES. [2023-08-29 20:39:43,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 462 events. 237/462 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1993 event pairs, 38 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 1248. Up to 205 conditions per place. [2023-08-29 20:39:43,303 INFO L137 encePairwiseOnDemand]: 337/341 looper letters, 70 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-08-29 20:39:43,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 423 flow [2023-08-29 20:39:43,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:39:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:39:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2023-08-29 20:39:43,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3947214076246334 [2023-08-29 20:39:43,306 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2023-08-29 20:39:43,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2023-08-29 20:39:43,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:43,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2023-08-29 20:39:43,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:43,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:43,310 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:43,310 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 114 flow. Second operand 5 states and 673 transitions. [2023-08-29 20:39:43,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 423 flow [2023-08-29 20:39:43,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:39:43,313 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 133 flow [2023-08-29 20:39:43,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2023-08-29 20:39:43,314 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -48 predicate places. [2023-08-29 20:39:43,314 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 133 flow [2023-08-29 20:39:43,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:43,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:43,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:43,324 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-29 20:39:43,520 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-29 20:39:43,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:39:43,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:43,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1079502742, now seen corresponding path program 2 times [2023-08-29 20:39:43,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:43,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779703130] [2023-08-29 20:39:43,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:39:43,522 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-29 20:39:43,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:43,523 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:39:43,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-29 20:39:43,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:39:43,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:39:43,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-29 20:39:43,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:43,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:39:43,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2023-08-29 20:39:43,799 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 20:39:43,801 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-29 20:39:43,927 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-29 20:39:43,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-29 20:39:44,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-29 20:39:44,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2023-08-29 20:39:44,219 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-29 20:39:44,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-08-29 20:39:44,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2023-08-29 20:39:44,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 62 [2023-08-29 20:39:44,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:39:44,785 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-29 20:39:44,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:44,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:44,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779703130] [2023-08-29 20:39:44,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779703130] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:44,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:44,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:39:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649700545] [2023-08-29 20:39:44,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:44,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:39:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:44,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:39:44,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:39:45,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 341 [2023-08-29 20:39:45,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 133 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:45,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:45,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 341 [2023-08-29 20:39:45,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:46,174 INFO L130 PetriNetUnfolder]: 343/650 cut-off events. [2023-08-29 20:39:46,175 INFO L131 PetriNetUnfolder]: For 647/647 co-relation queries the response was YES. [2023-08-29 20:39:46,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1975 conditions, 650 events. 343/650 cut-off events. For 647/647 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3195 event pairs, 102 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 1965. Up to 421 conditions per place. [2023-08-29 20:39:46,178 INFO L137 encePairwiseOnDemand]: 331/341 looper letters, 59 selfloop transitions, 16 changer transitions 0/77 dead transitions. [2023-08-29 20:39:46,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 451 flow [2023-08-29 20:39:46,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:39:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:39:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1025 transitions. [2023-08-29 20:39:46,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33398501140436626 [2023-08-29 20:39:46,182 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1025 transitions. [2023-08-29 20:39:46,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1025 transitions. [2023-08-29 20:39:46,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:46,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1025 transitions. [2023-08-29 20:39:46,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 113.88888888888889) internal successors, (1025), 9 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:46,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:46,190 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:46,190 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 133 flow. Second operand 9 states and 1025 transitions. [2023-08-29 20:39:46,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 451 flow [2023-08-29 20:39:46,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:39:46,194 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 247 flow [2023-08-29 20:39:46,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=247, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2023-08-29 20:39:46,195 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -36 predicate places. [2023-08-29 20:39:46,195 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 247 flow [2023-08-29 20:39:46,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:46,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:46,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:46,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:39:46,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:46,407 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-29 20:39:46,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1857148830, now seen corresponding path program 3 times [2023-08-29 20:39:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:46,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269391750] [2023-08-29 20:39:46,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:39:46,408 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-29 20:39:46,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:46,409 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:39:46,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 20:39:46,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:39:46,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:39:46,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:39:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:39:46,832 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:39:46,832 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:39:46,833 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (100 of 101 remaining) [2023-08-29 20:39:46,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 101 remaining) [2023-08-29 20:39:46,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 101 remaining) [2023-08-29 20:39:46,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 101 remaining) [2023-08-29 20:39:46,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 101 remaining) [2023-08-29 20:39:46,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 101 remaining) [2023-08-29 20:39:46,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 101 remaining) [2023-08-29 20:39:46,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 101 remaining) [2023-08-29 20:39:46,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 101 remaining) [2023-08-29 20:39:46,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 101 remaining) [2023-08-29 20:39:46,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 101 remaining) [2023-08-29 20:39:46,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 101 remaining) [2023-08-29 20:39:46,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 101 remaining) [2023-08-29 20:39:46,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 101 remaining) [2023-08-29 20:39:46,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 101 remaining) [2023-08-29 20:39:46,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 101 remaining) [2023-08-29 20:39:46,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 101 remaining) [2023-08-29 20:39:46,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 101 remaining) [2023-08-29 20:39:46,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 101 remaining) [2023-08-29 20:39:46,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 101 remaining) [2023-08-29 20:39:46,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 101 remaining) [2023-08-29 20:39:46,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 101 remaining) [2023-08-29 20:39:46,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 101 remaining) [2023-08-29 20:39:46,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 101 remaining) [2023-08-29 20:39:46,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 101 remaining) [2023-08-29 20:39:46,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 101 remaining) [2023-08-29 20:39:46,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 101 remaining) [2023-08-29 20:39:46,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 101 remaining) [2023-08-29 20:39:46,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 101 remaining) [2023-08-29 20:39:46,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 101 remaining) [2023-08-29 20:39:46,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 101 remaining) [2023-08-29 20:39:46,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 101 remaining) [2023-08-29 20:39:46,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 101 remaining) [2023-08-29 20:39:46,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 101 remaining) [2023-08-29 20:39:46,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 101 remaining) [2023-08-29 20:39:46,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 101 remaining) [2023-08-29 20:39:46,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 101 remaining) [2023-08-29 20:39:46,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 101 remaining) [2023-08-29 20:39:46,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 101 remaining) [2023-08-29 20:39:46,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 101 remaining) [2023-08-29 20:39:46,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 101 remaining) [2023-08-29 20:39:46,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 101 remaining) [2023-08-29 20:39:46,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 101 remaining) [2023-08-29 20:39:46,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 101 remaining) [2023-08-29 20:39:46,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 101 remaining) [2023-08-29 20:39:46,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 101 remaining) [2023-08-29 20:39:46,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 101 remaining) [2023-08-29 20:39:46,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 101 remaining) [2023-08-29 20:39:46,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 101 remaining) [2023-08-29 20:39:46,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 101 remaining) [2023-08-29 20:39:46,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 101 remaining) [2023-08-29 20:39:46,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 101 remaining) [2023-08-29 20:39:46,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 101 remaining) [2023-08-29 20:39:46,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 101 remaining) [2023-08-29 20:39:46,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 101 remaining) [2023-08-29 20:39:46,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 101 remaining) [2023-08-29 20:39:46,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 101 remaining) [2023-08-29 20:39:46,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 101 remaining) [2023-08-29 20:39:46,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 101 remaining) [2023-08-29 20:39:46,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 101 remaining) [2023-08-29 20:39:46,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 101 remaining) [2023-08-29 20:39:46,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (39 of 101 remaining) [2023-08-29 20:39:46,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 101 remaining) [2023-08-29 20:39:46,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 101 remaining) [2023-08-29 20:39:46,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 101 remaining) [2023-08-29 20:39:46,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 101 remaining) [2023-08-29 20:39:46,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 101 remaining) [2023-08-29 20:39:46,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 101 remaining) [2023-08-29 20:39:46,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 101 remaining) [2023-08-29 20:39:46,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 101 remaining) [2023-08-29 20:39:46,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 101 remaining) [2023-08-29 20:39:46,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 101 remaining) [2023-08-29 20:39:46,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 101 remaining) [2023-08-29 20:39:46,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 101 remaining) [2023-08-29 20:39:46,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 101 remaining) [2023-08-29 20:39:46,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 101 remaining) [2023-08-29 20:39:46,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 101 remaining) [2023-08-29 20:39:46,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 101 remaining) [2023-08-29 20:39:46,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 101 remaining) [2023-08-29 20:39:46,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 101 remaining) [2023-08-29 20:39:46,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 101 remaining) [2023-08-29 20:39:46,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 101 remaining) [2023-08-29 20:39:46,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 101 remaining) [2023-08-29 20:39:46,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 101 remaining) [2023-08-29 20:39:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 101 remaining) [2023-08-29 20:39:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 101 remaining) [2023-08-29 20:39:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 101 remaining) [2023-08-29 20:39:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 101 remaining) [2023-08-29 20:39:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 101 remaining) [2023-08-29 20:39:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 101 remaining) [2023-08-29 20:39:46,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 101 remaining) [2023-08-29 20:39:46,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 101 remaining) [2023-08-29 20:39:46,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 101 remaining) [2023-08-29 20:39:46,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 101 remaining) [2023-08-29 20:39:46,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 101 remaining) [2023-08-29 20:39:46,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 101 remaining) [2023-08-29 20:39:46,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 101 remaining) [2023-08-29 20:39:46,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 101 remaining) [2023-08-29 20:39:46,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 101 remaining) [2023-08-29 20:39:46,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 101 remaining) [2023-08-29 20:39:46,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 101 remaining) [2023-08-29 20:39:46,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-29 20:39:47,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:47,075 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:47,081 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:39:47,081 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:39:47,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:39:47 BasicIcfg [2023-08-29 20:39:47,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:39:47,185 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:39:47,185 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:39:47,185 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:39:47,186 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:38:44" (3/4) ... [2023-08-29 20:39:47,188 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:39:47,188 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:39:47,189 INFO L158 Benchmark]: Toolchain (without parser) took 65367.02ms. Allocated memory was 60.8MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 36.9MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-29 20:39:47,189 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 28.6MB in the beginning and 28.6MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:39:47,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 622.86ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 36.6MB in the beginning and 48.3MB in the end (delta: -11.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2023-08-29 20:39:47,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.29ms. Allocated memory is still 73.4MB. Free memory was 48.3MB in the beginning and 45.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:39:47,190 INFO L158 Benchmark]: Boogie Preprocessor took 63.12ms. Allocated memory is still 73.4MB. Free memory was 45.4MB in the beginning and 42.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:39:47,191 INFO L158 Benchmark]: RCFGBuilder took 1635.60ms. Allocated memory was 73.4MB in the beginning and 121.6MB in the end (delta: 48.2MB). Free memory was 42.7MB in the beginning and 72.0MB in the end (delta: -29.3MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2023-08-29 20:39:47,191 INFO L158 Benchmark]: TraceAbstraction took 62952.86ms. Allocated memory was 121.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 71.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-29 20:39:47,191 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 3.5GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:39:47,195 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.17ms. Allocated memory is still 50.3MB. Free memory was 28.6MB in the beginning and 28.6MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 622.86ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 36.6MB in the beginning and 48.3MB in the end (delta: -11.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.29ms. Allocated memory is still 73.4MB. Free memory was 48.3MB in the beginning and 45.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.12ms. Allocated memory is still 73.4MB. Free memory was 45.4MB in the beginning and 42.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1635.60ms. Allocated memory was 73.4MB in the beginning and 121.6MB in the end (delta: 48.2MB). Free memory was 42.7MB in the beginning and 72.0MB in the end (delta: -29.3MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * TraceAbstraction took 62952.86ms. Allocated memory was 121.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 71.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 3.5GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45.1s, 195 PlacesBefore, 98 PlacesAfterwards, 187 TransitionsBefore, 89 TransitionsAfterwards, 8500 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 151 TotalNumberOfCompositions, 43248 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10176, independent: 9490, independent conditional: 0, independent unconditional: 9490, dependent: 686, dependent conditional: 0, dependent unconditional: 686, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3073, independent: 2979, independent conditional: 0, independent unconditional: 2979, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10176, independent: 6511, independent conditional: 0, independent unconditional: 6511, dependent: 592, dependent conditional: 0, dependent unconditional: 592, unknown: 3073, unknown conditional: 0, unknown unconditional: 3073] , Statistics on independence cache: Total cache size (in pairs): 447, Positive cache size: 386, Positive conditional cache size: 0, Positive unconditional cache size: 386, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, 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; [L852] 0 pthread_t t1837; [L853] FCALL, FORK 0 pthread_create(&t1837, ((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(&t1837, ((void *)0), P0, ((void *)0))=0, t1837={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] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 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$$choice1=0, weak$$choice2=2, 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}] [L779] 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$$choice1=0, weak$$choice2=2, 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}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L854] 0 pthread_t t1838; 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}, main$tmp_guard0=0, main$tmp_guard1=0, t1837={7:0}, t1838={14:0}, weak$$choice1=0, weak$$choice2=2, 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}] [L855] FCALL, FORK 0 pthread_create(&t1838, ((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(&t1838, ((void *)0), P1, ((void *)0))=1, t1837={7:0}, t1838={14:0}, weak$$choice1=0, weak$$choice2=2, 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}] [L791] 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$$choice1=0, weak$$choice2=2, 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}] [L856] 0 pthread_t t1839; 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, t1837={7:0}, t1838={14:0}, t1839={15:0}, weak$$choice1=0, weak$$choice2=2, 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}] [L794] 2 y = 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$$choice1=0, weak$$choice2=2, 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}] [L857] FCALL, FORK 0 pthread_create(&t1839, ((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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1839, ((void *)0), P2, ((void *)0))=2, t1837={7:0}, t1838={14:0}, t1839={15:0}, weak$$choice1=0, weak$$choice2=2, 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}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, 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}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] EXPR 3 \read(y) [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)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=1, 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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L827] 3 y = 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=1, 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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L830] 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) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] 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) [L830] 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) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_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=1, 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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] 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) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] 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) [L863] 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) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 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 [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 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}, \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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1837={7:0}, t1838={14:0}, t1839={15:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] EXPR 0 \read(y) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, 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}] - 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: -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: -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: -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: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 853]: 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: 857]: 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, 251 locations, 101 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: 62.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 45.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 763 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 508 mSDsluCounter, 342 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1705 IncrementalHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 61 mSDtfsCounter, 1705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=10, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 128 ConstructedInterpolants, 2 QuantifiedInterpolants, 966 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1566 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:39:47,231 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