./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe000_power.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/safe000_power.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 e872da92455c9ab0fe125378ae9802f1d4dfc806cea229583fb74f8b758e929f --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:33:19,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:33:19,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:33:19,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:33:19,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:33:19,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:33:19,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:33:19,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:33:19,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:33:19,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:33:19,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:33:19,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:33:19,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:33:19,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:33:19,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:33:19,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:33:19,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:33:19,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:33:19,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:33:19,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:33:19,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:33:19,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:33:19,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:33:19,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:33:19,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:33:19,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:33:19,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:33:19,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:33:19,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:33:19,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:33:19,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:33:19,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:33:19,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:33:19,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:33:19,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:33:19,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:33:19,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:33:19,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:33:19,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:33:19,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:33:19,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:33:19,781 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:33:19,808 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:33:19,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:33:19,809 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:33:19,810 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:33:19,810 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:33:19,810 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:33:19,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:33:19,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:33:19,811 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:33:19,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:33:19,812 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:33:19,812 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:33:19,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:33:19,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:33:19,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:33:19,813 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:33:19,813 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:33:19,813 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:33:19,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:33:19,813 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:33:19,813 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:33:19,813 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:33:19,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:33:19,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:33:19,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:33:19,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:33:19,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:33:19,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:33:19,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:33:19,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:33:19,815 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:33:19,815 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:33:19,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:33:19,815 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:33:19,815 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 -> e872da92455c9ab0fe125378ae9802f1d4dfc806cea229583fb74f8b758e929f 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:33:20,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:33:20,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:33:20,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:33:20,082 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:33:20,083 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:33:20,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.oepc.i [2023-08-29 20:33:20,960 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:33:21,167 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:33:21,168 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.oepc.i [2023-08-29 20:33:21,185 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1937aa2/97dbde10a2bb47beb45c9dc576ecd06d/FLAGf49810ce6 [2023-08-29 20:33:21,193 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1937aa2/97dbde10a2bb47beb45c9dc576ecd06d [2023-08-29 20:33:21,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:33:21,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:33:21,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:33:21,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:33:21,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:33:21,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:33:21" (1/1) ... [2023-08-29 20:33:21,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3212159e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:21, skipping insertion in model container [2023-08-29 20:33:21,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:33:21" (1/1) ... [2023-08-29 20:33:21,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:33:21,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:33:21,385 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/safe000_power.oepc.i[995,1008] [2023-08-29 20:33:21,590 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:33:21,604 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:33:21,613 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/safe000_power.oepc.i[995,1008] [2023-08-29 20:33:21,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:33:21,700 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:33:21,700 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:33:21,705 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:33:21,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:21 WrapperNode [2023-08-29 20:33:21,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:33:21,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:33:21,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:33:21,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:33:21,711 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:33:21" (1/1) ... [2023-08-29 20:33:21,738 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:33:21" (1/1) ... [2023-08-29 20:33:21,759 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2023-08-29 20:33:21,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:33:21,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:33:21,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:33:21,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:33:21,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:21" (1/1) ... [2023-08-29 20:33:21,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:21" (1/1) ... [2023-08-29 20:33:21,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:21" (1/1) ... [2023-08-29 20:33:21,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:21" (1/1) ... [2023-08-29 20:33:21,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:21" (1/1) ... [2023-08-29 20:33:21,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:21" (1/1) ... [2023-08-29 20:33:21,800 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:21" (1/1) ... [2023-08-29 20:33:21,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:21" (1/1) ... [2023-08-29 20:33:21,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:33:21,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:33:21,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:33:21,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:33:21,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:21" (1/1) ... [2023-08-29 20:33:21,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:33:21,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:33:21,833 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:33:21,847 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:33:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 20:33:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:33:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:33:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:33:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:33:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:33:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:33:21,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:33:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:33:21,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:33:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:33:21,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:33:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:33:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:33:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:33:21,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:33:21,873 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:33:22,029 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:33:22,030 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:33:22,460 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:33:22,920 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:33:22,920 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:33:22,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:33:22 BoogieIcfgContainer [2023-08-29 20:33:22,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:33:22,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:33:22,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:33:22,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:33:22,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:33:21" (1/3) ... [2023-08-29 20:33:22,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ab08c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:33:22, skipping insertion in model container [2023-08-29 20:33:22,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:21" (2/3) ... [2023-08-29 20:33:22,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ab08c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:33:22, skipping insertion in model container [2023-08-29 20:33:22,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:33:22" (3/3) ... [2023-08-29 20:33:22,928 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.oepc.i [2023-08-29 20:33:22,939 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:33:22,939 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2023-08-29 20:33:22,940 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:33:23,061 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:33:23,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 193 transitions, 401 flow [2023-08-29 20:33:23,177 INFO L130 PetriNetUnfolder]: 2/190 cut-off events. [2023-08-29 20:33:23,177 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:23,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 2/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 364 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2023-08-29 20:33:23,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 193 transitions, 401 flow [2023-08-29 20:33:23,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 190 transitions, 389 flow [2023-08-29 20:33:23,196 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:33:23,204 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 190 transitions, 389 flow [2023-08-29 20:33:23,206 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 190 transitions, 389 flow [2023-08-29 20:33:23,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 190 transitions, 389 flow [2023-08-29 20:33:23,257 INFO L130 PetriNetUnfolder]: 2/190 cut-off events. [2023-08-29 20:33:23,257 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:23,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 2/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 365 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2023-08-29 20:33:23,262 INFO L119 LiptonReduction]: Number of co-enabled transitions 9348 [2023-08-29 20:33:39,977 INFO L134 LiptonReduction]: Checked pairs total: 53551 [2023-08-29 20:33:39,977 INFO L136 LiptonReduction]: Total number of compositions: 154 [2023-08-29 20:33:39,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:33:39,989 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;@678a64d2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:33:39,990 INFO L358 AbstractCegarLoop]: Starting to check reachability of 109 error locations. [2023-08-29 20:33:39,991 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:33:39,991 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:39,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:39,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:33:39,992 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:33:39,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:39,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2023-08-29 20:33:40,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:40,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966449076] [2023-08-29 20:33:40,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:40,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:40,083 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:33:40,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:40,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966449076] [2023-08-29 20:33:40,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966449076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:40,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:40,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:33:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103392865] [2023-08-29 20:33:40,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:40,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:33:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:40,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:33:40,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:33:40,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 347 [2023-08-29 20:33:40,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 195 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:33:40,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:40,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 347 [2023-08-29 20:33:40,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:43,337 INFO L130 PetriNetUnfolder]: 17324/24432 cut-off events. [2023-08-29 20:33:43,337 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:33:43,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48789 conditions, 24432 events. 17324/24432 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2178. Compared 169849 event pairs, 17324 based on Foata normal form. 0/9837 useless extension candidates. Maximal degree in co-relation 48778. Up to 24261 conditions per place. [2023-08-29 20:33:43,457 INFO L137 encePairwiseOnDemand]: 305/347 looper letters, 44 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2023-08-29 20:33:43,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 197 flow [2023-08-29 20:33:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:33:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:33:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 340 transitions. [2023-08-29 20:33:43,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4899135446685879 [2023-08-29 20:33:43,471 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 340 transitions. [2023-08-29 20:33:43,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 340 transitions. [2023-08-29 20:33:43,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:43,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 340 transitions. [2023-08-29 20:33:43,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 170.0) internal successors, (340), 2 states have internal predecessors, (340), 0 states have call successors, (0), 0 states 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:33:43,481 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:33:43,481 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:33:43,483 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 195 flow. Second operand 2 states and 340 transitions. [2023-08-29 20:33:43,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 197 flow [2023-08-29 20:33:43,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 194 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:33:43,488 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 106 flow [2023-08-29 20:33:43,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-29 20:33:43,492 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -44 predicate places. [2023-08-29 20:33:43,492 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 106 flow [2023-08-29 20:33:43,493 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:33:43,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:43,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:33:43,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:33:43,496 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:33:43,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1270105, now seen corresponding path program 1 times [2023-08-29 20:33:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:43,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835621330] [2023-08-29 20:33:43,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:43,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:43,743 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:33:43,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:43,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835621330] [2023-08-29 20:33:43,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835621330] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:43,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:43,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:33:43,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033809727] [2023-08-29 20:33:43,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:43,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:43,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:43,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:43,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:43,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 347 [2023-08-29 20:33:43,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 106 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:33:43,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:43,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 347 [2023-08-29 20:33:43,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:44,930 INFO L130 PetriNetUnfolder]: 5696/8231 cut-off events. [2023-08-29 20:33:44,930 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:44,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16425 conditions, 8231 events. 5696/8231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 50536 event pairs, 5696 based on Foata normal form. 404/4913 useless extension candidates. Maximal degree in co-relation 16422. Up to 8133 conditions per place. [2023-08-29 20:33:44,953 INFO L137 encePairwiseOnDemand]: 336/347 looper letters, 34 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-29 20:33:44,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 156 flow [2023-08-29 20:33:44,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-29 20:33:44,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40057636887608067 [2023-08-29 20:33:44,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-29 20:33:44,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-29 20:33:44,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:44,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-29 20:33:44,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:44,959 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:33:44,959 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:33:44,959 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 106 flow. Second operand 3 states and 417 transitions. [2023-08-29 20:33:44,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 156 flow [2023-08-29 20:33:44,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:33:44,960 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 88 flow [2023-08-29 20:33:44,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-29 20:33:44,961 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -52 predicate places. [2023-08-29 20:33:44,961 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 88 flow [2023-08-29 20:33:44,962 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:33:44,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:44,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:33:44,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:33:44,962 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:33:44,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1270104, now seen corresponding path program 1 times [2023-08-29 20:33:44,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:44,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344861907] [2023-08-29 20:33:44,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:44,995 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:33:44,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:44,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344861907] [2023-08-29 20:33:44,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344861907] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:44,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:44,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:33:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707414999] [2023-08-29 20:33:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:44,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:44,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:44,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:45,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 347 [2023-08-29 20:33:45,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 88 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:33:45,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:45,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 347 [2023-08-29 20:33:45,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:46,177 INFO L130 PetriNetUnfolder]: 5077/7863 cut-off events. [2023-08-29 20:33:46,178 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:46,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15667 conditions, 7863 events. 5077/7863 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 49806 event pairs, 2879 based on Foata normal form. 0/5879 useless extension candidates. Maximal degree in co-relation 15663. Up to 4172 conditions per place. [2023-08-29 20:33:46,208 INFO L137 encePairwiseOnDemand]: 325/347 looper letters, 38 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2023-08-29 20:33:46,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 206 flow [2023-08-29 20:33:46,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-29 20:33:46,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40057636887608067 [2023-08-29 20:33:46,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-29 20:33:46,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-29 20:33:46,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:46,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-29 20:33:46,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:46,214 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:33:46,214 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:33:46,214 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 88 flow. Second operand 3 states and 417 transitions. [2023-08-29 20:33:46,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 206 flow [2023-08-29 20:33:46,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:33:46,216 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 177 flow [2023-08-29 20:33:46,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-29 20:33:46,217 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -52 predicate places. [2023-08-29 20:33:46,217 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 177 flow [2023-08-29 20:33:46,217 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:33:46,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:46,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:46,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:33:46,218 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:33:46,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1070090346, now seen corresponding path program 1 times [2023-08-29 20:33:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:46,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140259379] [2023-08-29 20:33:46,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:46,320 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:33:46,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:46,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140259379] [2023-08-29 20:33:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140259379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:46,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:46,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:33:46,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062172635] [2023-08-29 20:33:46,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:46,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:46,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:46,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:46,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:46,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 347 [2023-08-29 20:33:46,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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:33:46,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:46,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 347 [2023-08-29 20:33:46,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:47,582 INFO L130 PetriNetUnfolder]: 4658/7627 cut-off events. [2023-08-29 20:33:47,583 INFO L131 PetriNetUnfolder]: For 2687/2823 co-relation queries the response was YES. [2023-08-29 20:33:47,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21065 conditions, 7627 events. 4658/7627 cut-off events. For 2687/2823 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 53274 event pairs, 1875 based on Foata normal form. 0/6582 useless extension candidates. Maximal degree in co-relation 21060. Up to 4131 conditions per place. [2023-08-29 20:33:47,605 INFO L137 encePairwiseOnDemand]: 343/347 looper letters, 67 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2023-08-29 20:33:47,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 433 flow [2023-08-29 20:33:47,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-08-29 20:33:47,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4197886647454371 [2023-08-29 20:33:47,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-08-29 20:33:47,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-08-29 20:33:47,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:47,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-08-29 20:33:47,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states 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:33:47,609 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:33:47,610 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:33:47,610 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 177 flow. Second operand 3 states and 437 transitions. [2023-08-29 20:33:47,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 433 flow [2023-08-29 20:33:47,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 397 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:47,624 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 168 flow [2023-08-29 20:33:47,624 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-29 20:33:47,625 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -51 predicate places. [2023-08-29 20:33:47,625 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 168 flow [2023-08-29 20:33:47,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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:33:47,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:47,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:47,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:33:47,626 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:33:47,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1070090646, now seen corresponding path program 1 times [2023-08-29 20:33:47,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:47,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376975928] [2023-08-29 20:33:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:48,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:33:48,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:48,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376975928] [2023-08-29 20:33:48,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376975928] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:48,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:48,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:33:48,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685429972] [2023-08-29 20:33:48,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:48,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:33:48,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:48,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:33:48,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:33:48,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 347 [2023-08-29 20:33:48,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states 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:33:48,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:48,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 347 [2023-08-29 20:33:48,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:48,874 INFO L130 PetriNetUnfolder]: 4573/7313 cut-off events. [2023-08-29 20:33:48,874 INFO L131 PetriNetUnfolder]: For 2196/2278 co-relation queries the response was YES. [2023-08-29 20:33:48,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20205 conditions, 7313 events. 4573/7313 cut-off events. For 2196/2278 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 49535 event pairs, 1691 based on Foata normal form. 0/5691 useless extension candidates. Maximal degree in co-relation 20199. Up to 6133 conditions per place. [2023-08-29 20:33:48,901 INFO L137 encePairwiseOnDemand]: 343/347 looper letters, 63 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2023-08-29 20:33:48,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 402 flow [2023-08-29 20:33:48,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-08-29 20:33:48,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41306436119116235 [2023-08-29 20:33:48,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-08-29 20:33:48,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-08-29 20:33:48,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:48,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-08-29 20:33:48,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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:33:48,909 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:33:48,910 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:33:48,910 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 168 flow. Second operand 3 states and 430 transitions. [2023-08-29 20:33:48,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 402 flow [2023-08-29 20:33:48,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:48,913 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 194 flow [2023-08-29 20:33:48,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2023-08-29 20:33:48,915 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -50 predicate places. [2023-08-29 20:33:48,915 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 194 flow [2023-08-29 20:33:48,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states 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:33:48,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:48,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:48,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:33:48,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:33:48,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:48,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1186928542, now seen corresponding path program 1 times [2023-08-29 20:33:48,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:48,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417432400] [2023-08-29 20:33:48,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:48,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:49,335 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:33:49,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:49,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417432400] [2023-08-29 20:33:49,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417432400] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:49,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:49,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:33:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408262508] [2023-08-29 20:33:49,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:49,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:33:49,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:49,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:33:49,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:33:49,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 347 [2023-08-29 20:33:49,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states 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:33:49,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:49,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 347 [2023-08-29 20:33:49,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:50,256 INFO L130 PetriNetUnfolder]: 4524/7258 cut-off events. [2023-08-29 20:33:50,256 INFO L131 PetriNetUnfolder]: For 2350/2415 co-relation queries the response was YES. [2023-08-29 20:33:50,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20606 conditions, 7258 events. 4524/7258 cut-off events. For 2350/2415 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 49558 event pairs, 1009 based on Foata normal form. 22/5719 useless extension candidates. Maximal degree in co-relation 20599. Up to 5590 conditions per place. [2023-08-29 20:33:50,279 INFO L137 encePairwiseOnDemand]: 343/347 looper letters, 86 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2023-08-29 20:33:50,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 542 flow [2023-08-29 20:33:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:33:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:33:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2023-08-29 20:33:50,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106628242074928 [2023-08-29 20:33:50,281 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2023-08-29 20:33:50,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2023-08-29 20:33:50,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:50,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2023-08-29 20:33:50,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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:33:50,284 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:33:50,285 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:33:50,285 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 194 flow. Second operand 4 states and 570 transitions. [2023-08-29 20:33:50,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 542 flow [2023-08-29 20:33:50,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 98 transitions, 538 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:33:50,287 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 205 flow [2023-08-29 20:33:50,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2023-08-29 20:33:50,288 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -47 predicate places. [2023-08-29 20:33:50,288 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 205 flow [2023-08-29 20:33:50,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states 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:33:50,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:50,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:50,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:33:50,289 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:33:50,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:50,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1186928842, now seen corresponding path program 1 times [2023-08-29 20:33:50,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:50,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939905172] [2023-08-29 20:33:50,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:50,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:33:50,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:50,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939905172] [2023-08-29 20:33:50,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939905172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:50,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:50,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:33:50,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697623498] [2023-08-29 20:33:50,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:50,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:50,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:50,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:50,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:50,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 347 [2023-08-29 20:33:50,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:50,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:50,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 347 [2023-08-29 20:33:50,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:51,471 INFO L130 PetriNetUnfolder]: 5598/9092 cut-off events. [2023-08-29 20:33:51,471 INFO L131 PetriNetUnfolder]: For 3912/4138 co-relation queries the response was YES. [2023-08-29 20:33:51,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25735 conditions, 9092 events. 5598/9092 cut-off events. For 3912/4138 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 64733 event pairs, 2195 based on Foata normal form. 0/7319 useless extension candidates. Maximal degree in co-relation 25727. Up to 5944 conditions per place. [2023-08-29 20:33:51,495 INFO L137 encePairwiseOnDemand]: 339/347 looper letters, 54 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2023-08-29 20:33:51,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 406 flow [2023-08-29 20:33:51,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-29 20:33:51,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3957732949087416 [2023-08-29 20:33:51,497 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-29 20:33:51,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-29 20:33:51,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:51,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-29 20:33:51,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:51,499 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:33:51,499 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:33:51,499 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 205 flow. Second operand 3 states and 412 transitions. [2023-08-29 20:33:51,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 406 flow [2023-08-29 20:33:51,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 394 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:51,502 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 260 flow [2023-08-29 20:33:51,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2023-08-29 20:33:51,502 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -46 predicate places. [2023-08-29 20:33:51,503 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 260 flow [2023-08-29 20:33:51,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:51,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:51,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:51,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:33:51,503 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:33:51,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1186928841, now seen corresponding path program 1 times [2023-08-29 20:33:51,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:51,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102559871] [2023-08-29 20:33:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:51,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:51,668 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:33:51,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:51,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102559871] [2023-08-29 20:33:51,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102559871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:51,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:51,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:33:51,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802548636] [2023-08-29 20:33:51,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:51,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:33:51,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:51,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:33:51,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:33:51,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 347 [2023-08-29 20:33:51,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:51,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:51,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 347 [2023-08-29 20:33:51,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:52,910 INFO L130 PetriNetUnfolder]: 7565/12036 cut-off events. [2023-08-29 20:33:52,910 INFO L131 PetriNetUnfolder]: For 7860/7860 co-relation queries the response was YES. [2023-08-29 20:33:52,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36059 conditions, 12036 events. 7565/12036 cut-off events. For 7860/7860 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 86912 event pairs, 4130 based on Foata normal form. 50/10220 useless extension candidates. Maximal degree in co-relation 36050. Up to 6234 conditions per place. [2023-08-29 20:33:52,957 INFO L137 encePairwiseOnDemand]: 342/347 looper letters, 78 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2023-08-29 20:33:52,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 88 transitions, 554 flow [2023-08-29 20:33:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:33:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:33:52,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2023-08-29 20:33:52,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39121037463976943 [2023-08-29 20:33:52,959 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2023-08-29 20:33:52,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2023-08-29 20:33:52,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:52,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2023-08-29 20:33:52,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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:33:52,961 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:33:52,962 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:33:52,962 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 260 flow. Second operand 4 states and 543 transitions. [2023-08-29 20:33:52,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 88 transitions, 554 flow [2023-08-29 20:33:53,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:33:53,055 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 272 flow [2023-08-29 20:33:53,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=272, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2023-08-29 20:33:53,056 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -43 predicate places. [2023-08-29 20:33:53,056 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 272 flow [2023-08-29 20:33:53,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:53,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:53,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:53,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:33:53,057 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:33:53,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:53,057 INFO L85 PathProgramCache]: Analyzing trace with hash -556418185, now seen corresponding path program 2 times [2023-08-29 20:33:53,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:53,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458083450] [2023-08-29 20:33:53,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:53,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:53,230 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:33:53,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:53,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458083450] [2023-08-29 20:33:53,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458083450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:53,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:53,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:33:53,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17024118] [2023-08-29 20:33:53,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:53,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:33:53,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:53,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:33:53,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:33:53,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 347 [2023-08-29 20:33:53,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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:33:53,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:53,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 347 [2023-08-29 20:33:53,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:54,471 INFO L130 PetriNetUnfolder]: 7355/11726 cut-off events. [2023-08-29 20:33:54,471 INFO L131 PetriNetUnfolder]: For 10447/10447 co-relation queries the response was YES. [2023-08-29 20:33:54,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35315 conditions, 11726 events. 7355/11726 cut-off events. For 10447/10447 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 84564 event pairs, 4093 based on Foata normal form. 100/9959 useless extension candidates. Maximal degree in co-relation 35305. Up to 8431 conditions per place. [2023-08-29 20:33:54,520 INFO L137 encePairwiseOnDemand]: 343/347 looper letters, 78 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2023-08-29 20:33:54,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 554 flow [2023-08-29 20:33:54,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:33:54,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:33:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-29 20:33:54,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38976945244956773 [2023-08-29 20:33:54,522 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-29 20:33:54,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-29 20:33:54,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:54,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-29 20:33:54,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:54,525 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:33:54,525 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:33:54,525 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 272 flow. Second operand 4 states and 541 transitions. [2023-08-29 20:33:54,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 554 flow [2023-08-29 20:33:54,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 529 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 20:33:54,549 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 245 flow [2023-08-29 20:33:54,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-08-29 20:33:54,550 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -47 predicate places. [2023-08-29 20:33:54,550 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 245 flow [2023-08-29 20:33:54,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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:33:54,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:54,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:54,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:33:54,551 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:33:54,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1736754183, now seen corresponding path program 1 times [2023-08-29 20:33:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:54,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871611544] [2023-08-29 20:33:54,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:54,767 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:33:54,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:54,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871611544] [2023-08-29 20:33:54,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871611544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:54,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:54,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:33:54,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047250572] [2023-08-29 20:33:54,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:54,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:33:54,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:54,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:33:54,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:33:54,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 347 [2023-08-29 20:33:54,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 245 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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:33:54,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:54,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 347 [2023-08-29 20:33:54,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:55,928 INFO L130 PetriNetUnfolder]: 7245/11357 cut-off events. [2023-08-29 20:33:55,928 INFO L131 PetriNetUnfolder]: For 8638/8836 co-relation queries the response was YES. [2023-08-29 20:33:55,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33139 conditions, 11357 events. 7245/11357 cut-off events. For 8638/8836 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 75788 event pairs, 3785 based on Foata normal form. 17/9203 useless extension candidates. Maximal degree in co-relation 33131. Up to 7923 conditions per place. [2023-08-29 20:33:55,968 INFO L137 encePairwiseOnDemand]: 344/347 looper letters, 70 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2023-08-29 20:33:55,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 501 flow [2023-08-29 20:33:55,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-29 20:33:55,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40826128722382327 [2023-08-29 20:33:55,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-29 20:33:55,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-29 20:33:55,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:55,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-29 20:33:55,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states 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:33:55,971 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:33:55,972 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:33:55,972 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 245 flow. Second operand 3 states and 425 transitions. [2023-08-29 20:33:55,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 501 flow [2023-08-29 20:33:55,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 81 transitions, 495 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:55,989 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 256 flow [2023-08-29 20:33:55,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2023-08-29 20:33:55,990 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -46 predicate places. [2023-08-29 20:33:55,990 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 256 flow [2023-08-29 20:33:55,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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:33:55,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:55,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:55,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:33:55,991 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:33:55,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:55,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1859919391, now seen corresponding path program 1 times [2023-08-29 20:33:55,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:55,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782450241] [2023-08-29 20:33:55,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:55,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:56,226 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:33:56,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:56,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782450241] [2023-08-29 20:33:56,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782450241] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:56,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:56,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:33:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592849876] [2023-08-29 20:33:56,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:56,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:33:56,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:56,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:33:56,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:33:56,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 347 [2023-08-29 20:33:56,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 256 flow. Second operand has 4 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:33:56,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:56,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 347 [2023-08-29 20:33:56,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:57,182 INFO L130 PetriNetUnfolder]: 5212/8494 cut-off events. [2023-08-29 20:33:57,183 INFO L131 PetriNetUnfolder]: For 7190/7234 co-relation queries the response was YES. [2023-08-29 20:33:57,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26388 conditions, 8494 events. 5212/8494 cut-off events. For 7190/7234 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 59261 event pairs, 1637 based on Foata normal form. 14/6900 useless extension candidates. Maximal degree in co-relation 26379. Up to 5880 conditions per place. [2023-08-29 20:33:57,208 INFO L137 encePairwiseOnDemand]: 344/347 looper letters, 70 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2023-08-29 20:33:57,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 80 transitions, 552 flow [2023-08-29 20:33:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-29 20:33:57,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40730067243035545 [2023-08-29 20:33:57,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-29 20:33:57,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-29 20:33:57,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:57,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-29 20:33:57,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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:33:57,212 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:33:57,212 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:33:57,212 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 256 flow. Second operand 3 states and 424 transitions. [2023-08-29 20:33:57,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 80 transitions, 552 flow [2023-08-29 20:33:57,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 80 transitions, 532 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:57,223 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 255 flow [2023-08-29 20:33:57,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-08-29 20:33:57,224 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -45 predicate places. [2023-08-29 20:33:57,224 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 255 flow [2023-08-29 20:33:57,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:33:57,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:57,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:57,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:33:57,224 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:33:57,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:57,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1859964017, now seen corresponding path program 1 times [2023-08-29 20:33:57,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:57,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806803957] [2023-08-29 20:33:57,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:57,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:57,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:33:57,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:57,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806803957] [2023-08-29 20:33:57,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806803957] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:57,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:57,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:33:57,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680149570] [2023-08-29 20:33:57,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:57,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:33:57,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:57,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:33:57,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:33:57,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 347 [2023-08-29 20:33:57,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 255 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:33:57,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:57,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 347 [2023-08-29 20:33:57,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:58,300 INFO L130 PetriNetUnfolder]: 4865/7816 cut-off events. [2023-08-29 20:33:58,300 INFO L131 PetriNetUnfolder]: For 4672/4672 co-relation queries the response was YES. [2023-08-29 20:33:58,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24679 conditions, 7816 events. 4865/7816 cut-off events. For 4672/4672 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 51778 event pairs, 1826 based on Foata normal form. 40/6622 useless extension candidates. Maximal degree in co-relation 24669. Up to 2887 conditions per place. [2023-08-29 20:33:58,328 INFO L137 encePairwiseOnDemand]: 328/347 looper letters, 59 selfloop transitions, 17 changer transitions 0/77 dead transitions. [2023-08-29 20:33:58,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 525 flow [2023-08-29 20:33:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:33:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:33:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-08-29 20:33:58,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37752161383285304 [2023-08-29 20:33:58,330 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-08-29 20:33:58,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-08-29 20:33:58,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:58,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-08-29 20:33:58,331 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:33:58,332 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:33:58,333 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:33:58,333 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 255 flow. Second operand 4 states and 524 transitions. [2023-08-29 20:33:58,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 525 flow [2023-08-29 20:33:58,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 515 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:58,351 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 387 flow [2023-08-29 20:33:58,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=387, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2023-08-29 20:33:58,351 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -42 predicate places. [2023-08-29 20:33:58,352 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 387 flow [2023-08-29 20:33:58,352 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:33:58,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:58,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:58,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:33:58,352 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:33:58,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash 296331521, now seen corresponding path program 1 times [2023-08-29 20:33:58,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:58,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443643597] [2023-08-29 20:33:58,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:58,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:58,686 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:33:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:58,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443643597] [2023-08-29 20:33:58,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443643597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:58,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:58,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:33:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112349740] [2023-08-29 20:33:58,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:58,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:33:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:58,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:33:58,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:33:58,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 347 [2023-08-29 20:33:58,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states 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:33:58,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:58,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 347 [2023-08-29 20:33:58,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:00,035 INFO L130 PetriNetUnfolder]: 8147/12873 cut-off events. [2023-08-29 20:34:00,035 INFO L131 PetriNetUnfolder]: For 18705/19352 co-relation queries the response was YES. [2023-08-29 20:34:00,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45248 conditions, 12873 events. 8147/12873 cut-off events. For 18705/19352 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 92263 event pairs, 1837 based on Foata normal form. 214/11315 useless extension candidates. Maximal degree in co-relation 45237. Up to 4754 conditions per place. [2023-08-29 20:34:00,089 INFO L137 encePairwiseOnDemand]: 343/347 looper letters, 122 selfloop transitions, 3 changer transitions 0/133 dead transitions. [2023-08-29 20:34:00,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 133 transitions, 1063 flow [2023-08-29 20:34:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:34:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:34:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2023-08-29 20:34:00,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106628242074928 [2023-08-29 20:34:00,090 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2023-08-29 20:34:00,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2023-08-29 20:34:00,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:00,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2023-08-29 20:34:00,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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:34:00,093 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:34:00,093 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:34:00,093 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 387 flow. Second operand 4 states and 570 transitions. [2023-08-29 20:34:00,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 133 transitions, 1063 flow [2023-08-29 20:34:00,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 133 transitions, 1056 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:00,131 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 404 flow [2023-08-29 20:34:00,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=404, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2023-08-29 20:34:00,131 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -38 predicate places. [2023-08-29 20:34:00,131 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 404 flow [2023-08-29 20:34:00,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states 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:34:00,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:00,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:00,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:34:00,132 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:34:00,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash 719047090, now seen corresponding path program 1 times [2023-08-29 20:34:00,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:00,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915199811] [2023-08-29 20:34:00,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:00,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:00,461 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:34:00,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:00,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915199811] [2023-08-29 20:34:00,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915199811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:00,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:00,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:34:00,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722427143] [2023-08-29 20:34:00,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:00,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:34:00,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:00,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:34:00,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:34:00,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 347 [2023-08-29 20:34:00,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 404 flow. Second operand has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 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:34:00,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:00,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 347 [2023-08-29 20:34:00,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:01,873 INFO L130 PetriNetUnfolder]: 4777/8017 cut-off events. [2023-08-29 20:34:01,873 INFO L131 PetriNetUnfolder]: For 10905/11029 co-relation queries the response was YES. [2023-08-29 20:34:01,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28380 conditions, 8017 events. 4777/8017 cut-off events. For 10905/11029 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 57068 event pairs, 726 based on Foata normal form. 22/7753 useless extension candidates. Maximal degree in co-relation 28366. Up to 2669 conditions per place. [2023-08-29 20:34:01,904 INFO L137 encePairwiseOnDemand]: 339/347 looper letters, 99 selfloop transitions, 16 changer transitions 1/125 dead transitions. [2023-08-29 20:34:01,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 125 transitions, 1007 flow [2023-08-29 20:34:01,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:34:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:34:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 972 transitions. [2023-08-29 20:34:01,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35014409221902015 [2023-08-29 20:34:01,906 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 972 transitions. [2023-08-29 20:34:01,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 972 transitions. [2023-08-29 20:34:01,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:01,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 972 transitions. [2023-08-29 20:34:01,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.5) internal successors, (972), 8 states have internal predecessors, (972), 0 states have call successors, (0), 0 states 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:34:01,910 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:34:01,911 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:34:01,911 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 404 flow. Second operand 8 states and 972 transitions. [2023-08-29 20:34:01,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 125 transitions, 1007 flow [2023-08-29 20:34:01,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 125 transitions, 976 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 20:34:01,946 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 427 flow [2023-08-29 20:34:01,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=427, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2023-08-29 20:34:01,946 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -34 predicate places. [2023-08-29 20:34:01,947 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 427 flow [2023-08-29 20:34:01,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 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:34:01,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:01,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:01,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:34:01,947 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:34:01,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1824310300, now seen corresponding path program 1 times [2023-08-29 20:34:01,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:01,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305047069] [2023-08-29 20:34:01,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:01,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:02,086 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:34:02,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:02,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305047069] [2023-08-29 20:34:02,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305047069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:02,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:02,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:34:02,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928268375] [2023-08-29 20:34:02,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:02,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:34:02,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:02,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:34:02,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:34:02,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 347 [2023-08-29 20:34:02,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 427 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:02,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:02,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 347 [2023-08-29 20:34:02,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:03,114 INFO L130 PetriNetUnfolder]: 4368/7046 cut-off events. [2023-08-29 20:34:03,114 INFO L131 PetriNetUnfolder]: For 10350/10382 co-relation queries the response was YES. [2023-08-29 20:34:03,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25121 conditions, 7046 events. 4368/7046 cut-off events. For 10350/10382 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 44789 event pairs, 1851 based on Foata normal form. 176/7122 useless extension candidates. Maximal degree in co-relation 25107. Up to 2916 conditions per place. [2023-08-29 20:34:03,140 INFO L137 encePairwiseOnDemand]: 328/347 looper letters, 80 selfloop transitions, 20 changer transitions 0/101 dead transitions. [2023-08-29 20:34:03,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 101 transitions, 854 flow [2023-08-29 20:34:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:34:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:34:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-08-29 20:34:03,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35782901056676275 [2023-08-29 20:34:03,142 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-08-29 20:34:03,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-08-29 20:34:03,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:03,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-08-29 20:34:03,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states 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:34:03,145 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:34:03,145 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:34:03,145 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 427 flow. Second operand 6 states and 745 transitions. [2023-08-29 20:34:03,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 101 transitions, 854 flow [2023-08-29 20:34:03,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 101 transitions, 830 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 20:34:03,171 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 566 flow [2023-08-29 20:34:03,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=566, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2023-08-29 20:34:03,171 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -32 predicate places. [2023-08-29 20:34:03,171 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 566 flow [2023-08-29 20:34:03,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:03,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:03,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:03,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:34:03,172 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:34:03,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash -871831920, now seen corresponding path program 1 times [2023-08-29 20:34:03,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:03,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791088076] [2023-08-29 20:34:03,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:03,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:34:04,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:04,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791088076] [2023-08-29 20:34:04,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791088076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:04,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:04,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:34:04,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429300841] [2023-08-29 20:34:04,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:04,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:34:04,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:04,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:34:04,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:34:04,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 347 [2023-08-29 20:34:04,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 566 flow. Second operand has 9 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states 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:34:04,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:04,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 347 [2023-08-29 20:34:04,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:06,481 INFO L130 PetriNetUnfolder]: 7578/12097 cut-off events. [2023-08-29 20:34:06,481 INFO L131 PetriNetUnfolder]: For 20789/20843 co-relation queries the response was YES. [2023-08-29 20:34:06,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45632 conditions, 12097 events. 7578/12097 cut-off events. For 20789/20843 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 84532 event pairs, 1759 based on Foata normal form. 178/12135 useless extension candidates. Maximal degree in co-relation 45617. Up to 4286 conditions per place. [2023-08-29 20:34:06,520 INFO L137 encePairwiseOnDemand]: 327/347 looper letters, 176 selfloop transitions, 71 changer transitions 18/266 dead transitions. [2023-08-29 20:34:06,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 266 transitions, 2345 flow [2023-08-29 20:34:06,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-29 20:34:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-29 20:34:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1686 transitions. [2023-08-29 20:34:06,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34705640181144504 [2023-08-29 20:34:06,524 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1686 transitions. [2023-08-29 20:34:06,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1686 transitions. [2023-08-29 20:34:06,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:06,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1686 transitions. [2023-08-29 20:34:06,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 120.42857142857143) internal successors, (1686), 14 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states 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:34:06,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 347.0) internal successors, (5205), 15 states have internal predecessors, (5205), 0 states have call successors, (0), 0 states 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:34:06,531 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 347.0) internal successors, (5205), 15 states have internal predecessors, (5205), 0 states have call successors, (0), 0 states 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:34:06,531 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 566 flow. Second operand 14 states and 1686 transitions. [2023-08-29 20:34:06,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 266 transitions, 2345 flow [2023-08-29 20:34:06,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 266 transitions, 2262 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:34:06,722 INFO L231 Difference]: Finished difference. Result has 88 places, 132 transitions, 1401 flow [2023-08-29 20:34:06,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1401, PETRI_PLACES=88, PETRI_TRANSITIONS=132} [2023-08-29 20:34:06,723 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -14 predicate places. [2023-08-29 20:34:06,723 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 132 transitions, 1401 flow [2023-08-29 20:34:06,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states 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:34:06,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:06,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:06,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:34:06,724 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:34:06,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:06,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1438413798, now seen corresponding path program 2 times [2023-08-29 20:34:06,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:06,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349163492] [2023-08-29 20:34:06,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:06,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:07,220 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:34:07,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:07,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349163492] [2023-08-29 20:34:07,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349163492] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:07,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:07,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:34:07,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353279790] [2023-08-29 20:34:07,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:07,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:34:07,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:07,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:34:07,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:34:07,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 347 [2023-08-29 20:34:07,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 132 transitions, 1401 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states 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:34:07,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:07,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 347 [2023-08-29 20:34:07,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:09,664 INFO L130 PetriNetUnfolder]: 11501/18547 cut-off events. [2023-08-29 20:34:09,664 INFO L131 PetriNetUnfolder]: For 60215/60306 co-relation queries the response was YES. [2023-08-29 20:34:09,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83098 conditions, 18547 events. 11501/18547 cut-off events. For 60215/60306 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 141609 event pairs, 2471 based on Foata normal form. 183/18569 useless extension candidates. Maximal degree in co-relation 83073. Up to 9098 conditions per place. [2023-08-29 20:34:09,765 INFO L137 encePairwiseOnDemand]: 338/347 looper letters, 232 selfloop transitions, 33 changer transitions 0/266 dead transitions. [2023-08-29 20:34:09,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 266 transitions, 3226 flow [2023-08-29 20:34:09,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:34:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:34:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2023-08-29 20:34:09,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3441745574310416 [2023-08-29 20:34:09,767 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2023-08-29 20:34:09,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2023-08-29 20:34:09,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:09,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2023-08-29 20:34:09,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states 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:34:09,771 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:34:09,771 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:34:09,771 INFO L175 Difference]: Start difference. First operand has 88 places, 132 transitions, 1401 flow. Second operand 7 states and 836 transitions. [2023-08-29 20:34:09,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 266 transitions, 3226 flow [2023-08-29 20:34:11,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 266 transitions, 3038 flow, removed 59 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:11,421 INFO L231 Difference]: Finished difference. Result has 97 places, 153 transitions, 1613 flow [2023-08-29 20:34:11,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1613, PETRI_PLACES=97, PETRI_TRANSITIONS=153} [2023-08-29 20:34:11,421 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -5 predicate places. [2023-08-29 20:34:11,421 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 153 transitions, 1613 flow [2023-08-29 20:34:11,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states 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:34:11,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:11,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:11,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:34:11,423 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:34:11,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:11,423 INFO L85 PathProgramCache]: Analyzing trace with hash 690162544, now seen corresponding path program 3 times [2023-08-29 20:34:11,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:11,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57482500] [2023-08-29 20:34:11,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:11,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:12,381 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:34:12,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:12,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57482500] [2023-08-29 20:34:12,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57482500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:12,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:12,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:34:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979048017] [2023-08-29 20:34:12,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:12,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:34:12,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:12,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:34:12,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:34:12,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 347 [2023-08-29 20:34:12,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 153 transitions, 1613 flow. Second operand has 8 states, 8 states have (on average 109.75) internal successors, (878), 8 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:12,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:12,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 347 [2023-08-29 20:34:12,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:15,649 INFO L130 PetriNetUnfolder]: 15231/24772 cut-off events. [2023-08-29 20:34:15,649 INFO L131 PetriNetUnfolder]: For 83059/83119 co-relation queries the response was YES. [2023-08-29 20:34:15,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112981 conditions, 24772 events. 15231/24772 cut-off events. For 83059/83119 co-relation queries the response was YES. Maximal size of possible extension queue 1671. Compared 201766 event pairs, 5052 based on Foata normal form. 92/24613 useless extension candidates. Maximal degree in co-relation 112952. Up to 12943 conditions per place. [2023-08-29 20:34:15,806 INFO L137 encePairwiseOnDemand]: 337/347 looper letters, 219 selfloop transitions, 54 changer transitions 1/275 dead transitions. [2023-08-29 20:34:15,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 275 transitions, 3434 flow [2023-08-29 20:34:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:34:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:34:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 955 transitions. [2023-08-29 20:34:15,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34402017291066284 [2023-08-29 20:34:15,808 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 955 transitions. [2023-08-29 20:34:15,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 955 transitions. [2023-08-29 20:34:15,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:15,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 955 transitions. [2023-08-29 20:34:15,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.375) internal successors, (955), 8 states have internal predecessors, (955), 0 states have call successors, (0), 0 states 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:34:15,812 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:34:15,812 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:34:15,813 INFO L175 Difference]: Start difference. First operand has 97 places, 153 transitions, 1613 flow. Second operand 8 states and 955 transitions. [2023-08-29 20:34:15,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 275 transitions, 3434 flow [2023-08-29 20:34:18,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 275 transitions, 3407 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:18,205 INFO L231 Difference]: Finished difference. Result has 108 places, 193 transitions, 2377 flow [2023-08-29 20:34:18,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2377, PETRI_PLACES=108, PETRI_TRANSITIONS=193} [2023-08-29 20:34:18,206 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 6 predicate places. [2023-08-29 20:34:18,206 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 193 transitions, 2377 flow [2023-08-29 20:34:18,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.75) internal successors, (878), 8 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:18,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:18,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:18,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:34:18,207 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:34:18,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:18,207 INFO L85 PathProgramCache]: Analyzing trace with hash 719047989, now seen corresponding path program 1 times [2023-08-29 20:34:18,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:18,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803198945] [2023-08-29 20:34:18,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:18,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:18,263 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:34:18,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:18,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803198945] [2023-08-29 20:34:18,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803198945] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:18,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:18,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:34:18,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728753195] [2023-08-29 20:34:18,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:18,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:34:18,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:18,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:34:18,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:34:18,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 347 [2023-08-29 20:34:18,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 193 transitions, 2377 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:34:18,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:18,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 347 [2023-08-29 20:34:18,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:20,997 INFO L130 PetriNetUnfolder]: 13286/20539 cut-off events. [2023-08-29 20:34:20,997 INFO L131 PetriNetUnfolder]: For 95947/95992 co-relation queries the response was YES. [2023-08-29 20:34:21,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99045 conditions, 20539 events. 13286/20539 cut-off events. For 95947/95992 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 150178 event pairs, 6853 based on Foata normal form. 766/21304 useless extension candidates. Maximal degree in co-relation 99010. Up to 16936 conditions per place. [2023-08-29 20:34:21,089 INFO L137 encePairwiseOnDemand]: 329/347 looper letters, 42 selfloop transitions, 1 changer transitions 147/191 dead transitions. [2023-08-29 20:34:21,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 191 transitions, 2713 flow [2023-08-29 20:34:21,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:34:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:34:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-08-29 20:34:21,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36671469740634005 [2023-08-29 20:34:21,091 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-08-29 20:34:21,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-08-29 20:34:21,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:21,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-08-29 20:34:21,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:34:21,093 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:34:21,093 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:34:21,093 INFO L175 Difference]: Start difference. First operand has 108 places, 193 transitions, 2377 flow. Second operand 4 states and 509 transitions. [2023-08-29 20:34:21,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 191 transitions, 2713 flow [2023-08-29 20:34:23,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 191 transitions, 2524 flow, removed 44 selfloop flow, removed 2 redundant places. [2023-08-29 20:34:23,491 INFO L231 Difference]: Finished difference. Result has 101 places, 44 transitions, 399 flow [2023-08-29 20:34:23,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=101, PETRI_TRANSITIONS=44} [2023-08-29 20:34:23,492 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -1 predicate places. [2023-08-29 20:34:23,492 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 44 transitions, 399 flow [2023-08-29 20:34:23,492 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:34:23,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:23,492 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:34:23,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:34:23,492 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:34:23,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:23,493 INFO L85 PathProgramCache]: Analyzing trace with hash -49769380, now seen corresponding path program 1 times [2023-08-29 20:34:23,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:23,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424101058] [2023-08-29 20:34:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:23,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:25,079 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:34:25,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:25,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424101058] [2023-08-29 20:34:25,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424101058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:25,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:25,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:34:25,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965430290] [2023-08-29 20:34:25,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:25,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:34:25,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:25,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:34:25,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:34:25,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 347 [2023-08-29 20:34:25,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 44 transitions, 399 flow. Second operand has 10 states, 10 states have (on average 107.5) internal successors, (1075), 10 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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:34:25,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:25,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 347 [2023-08-29 20:34:25,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:25,762 INFO L130 PetriNetUnfolder]: 922/1553 cut-off events. [2023-08-29 20:34:25,762 INFO L131 PetriNetUnfolder]: For 10127/10127 co-relation queries the response was YES. [2023-08-29 20:34:25,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6636 conditions, 1553 events. 922/1553 cut-off events. For 10127/10127 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7714 event pairs, 84 based on Foata normal form. 90/1642 useless extension candidates. Maximal degree in co-relation 6602. Up to 898 conditions per place. [2023-08-29 20:34:25,768 INFO L137 encePairwiseOnDemand]: 340/347 looper letters, 39 selfloop transitions, 12 changer transitions 17/69 dead transitions. [2023-08-29 20:34:25,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 69 transitions, 687 flow [2023-08-29 20:34:25,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:34:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:34:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 792 transitions. [2023-08-29 20:34:25,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32606010703993416 [2023-08-29 20:34:25,770 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 792 transitions. [2023-08-29 20:34:25,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 792 transitions. [2023-08-29 20:34:25,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:25,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 792 transitions. [2023-08-29 20:34:25,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.14285714285714) internal successors, (792), 7 states have internal predecessors, (792), 0 states have call successors, (0), 0 states 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:34:25,773 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:34:25,774 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:34:25,774 INFO L175 Difference]: Start difference. First operand has 101 places, 44 transitions, 399 flow. Second operand 7 states and 792 transitions. [2023-08-29 20:34:25,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 69 transitions, 687 flow [2023-08-29 20:34:25,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 69 transitions, 561 flow, removed 14 selfloop flow, removed 21 redundant places. [2023-08-29 20:34:25,778 INFO L231 Difference]: Finished difference. Result has 76 places, 40 transitions, 306 flow [2023-08-29 20:34:25,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=76, PETRI_TRANSITIONS=40} [2023-08-29 20:34:25,779 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -26 predicate places. [2023-08-29 20:34:25,779 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 40 transitions, 306 flow [2023-08-29 20:34:25,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.5) internal successors, (1075), 10 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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:34:25,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:25,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:25,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:34:25,780 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:34:25,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:25,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1419419705, now seen corresponding path program 1 times [2023-08-29 20:34:25,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:25,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753418889] [2023-08-29 20:34:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:26,070 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:34:26,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753418889] [2023-08-29 20:34:26,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753418889] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:26,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:26,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:34:26,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751497634] [2023-08-29 20:34:26,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:26,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:34:26,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:26,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:34:26,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:34:26,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 347 [2023-08-29 20:34:26,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 40 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states 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:34:26,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:26,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 347 [2023-08-29 20:34:26,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:26,224 INFO L130 PetriNetUnfolder]: 498/902 cut-off events. [2023-08-29 20:34:26,224 INFO L131 PetriNetUnfolder]: For 4150/4171 co-relation queries the response was YES. [2023-08-29 20:34:26,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3616 conditions, 902 events. 498/902 cut-off events. For 4150/4171 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4449 event pairs, 123 based on Foata normal form. 25/908 useless extension candidates. Maximal degree in co-relation 3594. Up to 764 conditions per place. [2023-08-29 20:34:26,228 INFO L137 encePairwiseOnDemand]: 342/347 looper letters, 49 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2023-08-29 20:34:26,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 61 transitions, 552 flow [2023-08-29 20:34:26,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:34:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:34:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-08-29 20:34:26,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38904899135446686 [2023-08-29 20:34:26,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-08-29 20:34:26,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-08-29 20:34:26,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:26,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-08-29 20:34:26,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states 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:34:26,232 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:34:26,232 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:34:26,232 INFO L175 Difference]: Start difference. First operand has 76 places, 40 transitions, 306 flow. Second operand 3 states and 405 transitions. [2023-08-29 20:34:26,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 61 transitions, 552 flow [2023-08-29 20:34:26,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 467 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-08-29 20:34:26,236 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 266 flow [2023-08-29 20:34:26,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2023-08-29 20:34:26,237 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -34 predicate places. [2023-08-29 20:34:26,237 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 266 flow [2023-08-29 20:34:26,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states 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:34:26,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:26,237 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:34:26,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:34:26,237 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:34:26,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:26,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1309338358, now seen corresponding path program 1 times [2023-08-29 20:34:26,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:26,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204005554] [2023-08-29 20:34:26,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:26,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:27,993 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:34:27,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:27,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204005554] [2023-08-29 20:34:27,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204005554] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:27,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:27,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:34:27,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247825754] [2023-08-29 20:34:27,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:27,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:34:27,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:27,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:34:27,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:34:28,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 347 [2023-08-29 20:34:28,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 266 flow. Second operand has 11 states, 11 states have (on average 109.54545454545455) internal successors, (1205), 11 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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:34:28,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:28,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 347 [2023-08-29 20:34:28,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:28,701 INFO L130 PetriNetUnfolder]: 536/955 cut-off events. [2023-08-29 20:34:28,701 INFO L131 PetriNetUnfolder]: For 2253/2253 co-relation queries the response was YES. [2023-08-29 20:34:28,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3878 conditions, 955 events. 536/955 cut-off events. For 2253/2253 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4302 event pairs, 187 based on Foata normal form. 9/964 useless extension candidates. Maximal degree in co-relation 3861. Up to 772 conditions per place. [2023-08-29 20:34:28,704 INFO L137 encePairwiseOnDemand]: 339/347 looper letters, 50 selfloop transitions, 24 changer transitions 0/75 dead transitions. [2023-08-29 20:34:28,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 75 transitions, 600 flow [2023-08-29 20:34:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:34:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:34:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1021 transitions. [2023-08-29 20:34:28,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3269292347102145 [2023-08-29 20:34:28,706 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1021 transitions. [2023-08-29 20:34:28,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1021 transitions. [2023-08-29 20:34:28,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:28,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1021 transitions. [2023-08-29 20:34:28,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 113.44444444444444) internal successors, (1021), 9 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states 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:34:28,710 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:34:28,711 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:34:28,711 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 266 flow. Second operand 9 states and 1021 transitions. [2023-08-29 20:34:28,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 75 transitions, 600 flow [2023-08-29 20:34:28,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 75 transitions, 588 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:28,714 INFO L231 Difference]: Finished difference. Result has 78 places, 53 transitions, 433 flow [2023-08-29 20:34:28,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=433, PETRI_PLACES=78, PETRI_TRANSITIONS=53} [2023-08-29 20:34:28,714 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -24 predicate places. [2023-08-29 20:34:28,714 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 53 transitions, 433 flow [2023-08-29 20:34:28,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.54545454545455) internal successors, (1205), 11 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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:34:28,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:28,715 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:34:28,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 20:34:28,715 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:34:28,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash -10363296, now seen corresponding path program 1 times [2023-08-29 20:34:28,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:28,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36461253] [2023-08-29 20:34:28,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:34:28,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:28,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36461253] [2023-08-29 20:34:28,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36461253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:28,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:28,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:34:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492826891] [2023-08-29 20:34:28,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:28,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:34:28,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:28,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:34:28,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:34:28,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 347 [2023-08-29 20:34:28,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 53 transitions, 433 flow. Second operand has 4 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:34:28,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:28,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 347 [2023-08-29 20:34:28,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:29,105 INFO L130 PetriNetUnfolder]: 237/502 cut-off events. [2023-08-29 20:34:29,106 INFO L131 PetriNetUnfolder]: For 1987/2002 co-relation queries the response was YES. [2023-08-29 20:34:29,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2144 conditions, 502 events. 237/502 cut-off events. For 1987/2002 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2317 event pairs, 30 based on Foata normal form. 59/555 useless extension candidates. Maximal degree in co-relation 2124. Up to 205 conditions per place. [2023-08-29 20:34:29,108 INFO L137 encePairwiseOnDemand]: 342/347 looper letters, 71 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2023-08-29 20:34:29,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 88 transitions, 899 flow [2023-08-29 20:34:29,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:34:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:34:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-29 20:34:29,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38472622478386165 [2023-08-29 20:34:29,110 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-29 20:34:29,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-29 20:34:29,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:29,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-29 20:34:29,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:34:29,112 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:34:29,112 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:34:29,112 INFO L175 Difference]: Start difference. First operand has 78 places, 53 transitions, 433 flow. Second operand 4 states and 534 transitions. [2023-08-29 20:34:29,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 88 transitions, 899 flow [2023-08-29 20:34:29,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 88 transitions, 786 flow, removed 32 selfloop flow, removed 5 redundant places. [2023-08-29 20:34:29,116 INFO L231 Difference]: Finished difference. Result has 77 places, 54 transitions, 393 flow [2023-08-29 20:34:29,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=393, PETRI_PLACES=77, PETRI_TRANSITIONS=54} [2023-08-29 20:34:29,116 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -25 predicate places. [2023-08-29 20:34:29,116 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 54 transitions, 393 flow [2023-08-29 20:34:29,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:34:29,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:29,117 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:34:29,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 20:34:29,117 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:34:29,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:29,117 INFO L85 PathProgramCache]: Analyzing trace with hash -589689416, now seen corresponding path program 1 times [2023-08-29 20:34:29,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:29,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887873168] [2023-08-29 20:34:29,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:29,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:29,412 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:34:29,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:29,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887873168] [2023-08-29 20:34:29,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887873168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:29,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:29,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:34:29,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450003359] [2023-08-29 20:34:29,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:29,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:34:29,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:29,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:34:29,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:34:29,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 347 [2023-08-29 20:34:29,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 54 transitions, 393 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states 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:34:29,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:29,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 347 [2023-08-29 20:34:29,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:29,529 INFO L130 PetriNetUnfolder]: 183/391 cut-off events. [2023-08-29 20:34:29,529 INFO L131 PetriNetUnfolder]: For 1367/1382 co-relation queries the response was YES. [2023-08-29 20:34:29,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 391 events. 183/391 cut-off events. For 1367/1382 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1794 event pairs, 18 based on Foata normal form. 39/424 useless extension candidates. Maximal degree in co-relation 1663. Up to 185 conditions per place. [2023-08-29 20:34:29,531 INFO L137 encePairwiseOnDemand]: 342/347 looper letters, 68 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2023-08-29 20:34:29,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 88 transitions, 814 flow [2023-08-29 20:34:29,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:34:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:34:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 657 transitions. [2023-08-29 20:34:29,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786743515850144 [2023-08-29 20:34:29,532 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 657 transitions. [2023-08-29 20:34:29,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 657 transitions. [2023-08-29 20:34:29,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:29,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 657 transitions. [2023-08-29 20:34:29,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states 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:34:29,534 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:34:29,534 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:34:29,535 INFO L175 Difference]: Start difference. First operand has 77 places, 54 transitions, 393 flow. Second operand 5 states and 657 transitions. [2023-08-29 20:34:29,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 88 transitions, 814 flow [2023-08-29 20:34:29,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 88 transitions, 725 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-08-29 20:34:29,537 INFO L231 Difference]: Finished difference. Result has 76 places, 54 transitions, 362 flow [2023-08-29 20:34:29,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=76, PETRI_TRANSITIONS=54} [2023-08-29 20:34:29,538 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -26 predicate places. [2023-08-29 20:34:29,538 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 54 transitions, 362 flow [2023-08-29 20:34:29,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states 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:34:29,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:29,538 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:34:29,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 20:34:29,538 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:34:29,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:29,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1175216741, now seen corresponding path program 1 times [2023-08-29 20:34:29,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:29,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95235727] [2023-08-29 20:34:29,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:29,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:34:29,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:34:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:34:29,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:34:29,741 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:34:29,741 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (108 of 109 remaining) [2023-08-29 20:34:29,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 109 remaining) [2023-08-29 20:34:29,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 109 remaining) [2023-08-29 20:34:29,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 109 remaining) [2023-08-29 20:34:29,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 109 remaining) [2023-08-29 20:34:29,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 109 remaining) [2023-08-29 20:34:29,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 109 remaining) [2023-08-29 20:34:29,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 109 remaining) [2023-08-29 20:34:29,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 109 remaining) [2023-08-29 20:34:29,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 109 remaining) [2023-08-29 20:34:29,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 109 remaining) [2023-08-29 20:34:29,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 109 remaining) [2023-08-29 20:34:29,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 109 remaining) [2023-08-29 20:34:29,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 109 remaining) [2023-08-29 20:34:29,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 109 remaining) [2023-08-29 20:34:29,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 109 remaining) [2023-08-29 20:34:29,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 109 remaining) [2023-08-29 20:34:29,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 109 remaining) [2023-08-29 20:34:29,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 109 remaining) [2023-08-29 20:34:29,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 109 remaining) [2023-08-29 20:34:29,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 109 remaining) [2023-08-29 20:34:29,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 109 remaining) [2023-08-29 20:34:29,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 109 remaining) [2023-08-29 20:34:29,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 109 remaining) [2023-08-29 20:34:29,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 109 remaining) [2023-08-29 20:34:29,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 109 remaining) [2023-08-29 20:34:29,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 109 remaining) [2023-08-29 20:34:29,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 109 remaining) [2023-08-29 20:34:29,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 109 remaining) [2023-08-29 20:34:29,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 109 remaining) [2023-08-29 20:34:29,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 109 remaining) [2023-08-29 20:34:29,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 109 remaining) [2023-08-29 20:34:29,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 109 remaining) [2023-08-29 20:34:29,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 109 remaining) [2023-08-29 20:34:29,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 109 remaining) [2023-08-29 20:34:29,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 109 remaining) [2023-08-29 20:34:29,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 109 remaining) [2023-08-29 20:34:29,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 109 remaining) [2023-08-29 20:34:29,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 109 remaining) [2023-08-29 20:34:29,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 109 remaining) [2023-08-29 20:34:29,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 109 remaining) [2023-08-29 20:34:29,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 109 remaining) [2023-08-29 20:34:29,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 109 remaining) [2023-08-29 20:34:29,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 109 remaining) [2023-08-29 20:34:29,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 109 remaining) [2023-08-29 20:34:29,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 109 remaining) [2023-08-29 20:34:29,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 109 remaining) [2023-08-29 20:34:29,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 109 remaining) [2023-08-29 20:34:29,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 109 remaining) [2023-08-29 20:34:29,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 109 remaining) [2023-08-29 20:34:29,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 109 remaining) [2023-08-29 20:34:29,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 109 remaining) [2023-08-29 20:34:29,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 109 remaining) [2023-08-29 20:34:29,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 109 remaining) [2023-08-29 20:34:29,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 109 remaining) [2023-08-29 20:34:29,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 109 remaining) [2023-08-29 20:34:29,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 109 remaining) [2023-08-29 20:34:29,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 109 remaining) [2023-08-29 20:34:29,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 109 remaining) [2023-08-29 20:34:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 109 remaining) [2023-08-29 20:34:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 109 remaining) [2023-08-29 20:34:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 109 remaining) [2023-08-29 20:34:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 109 remaining) [2023-08-29 20:34:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 109 remaining) [2023-08-29 20:34:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 109 remaining) [2023-08-29 20:34:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (43 of 109 remaining) [2023-08-29 20:34:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 109 remaining) [2023-08-29 20:34:29,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 109 remaining) [2023-08-29 20:34:29,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 109 remaining) [2023-08-29 20:34:29,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 109 remaining) [2023-08-29 20:34:29,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 109 remaining) [2023-08-29 20:34:29,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 109 remaining) [2023-08-29 20:34:29,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 109 remaining) [2023-08-29 20:34:29,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 109 remaining) [2023-08-29 20:34:29,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 109 remaining) [2023-08-29 20:34:29,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 109 remaining) [2023-08-29 20:34:29,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 109 remaining) [2023-08-29 20:34:29,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 109 remaining) [2023-08-29 20:34:29,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 109 remaining) [2023-08-29 20:34:29,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 109 remaining) [2023-08-29 20:34:29,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 109 remaining) [2023-08-29 20:34:29,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 109 remaining) [2023-08-29 20:34:29,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 109 remaining) [2023-08-29 20:34:29,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 109 remaining) [2023-08-29 20:34:29,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 109 remaining) [2023-08-29 20:34:29,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 109 remaining) [2023-08-29 20:34:29,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 109 remaining) [2023-08-29 20:34:29,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 109 remaining) [2023-08-29 20:34:29,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 109 remaining) [2023-08-29 20:34:29,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 109 remaining) [2023-08-29 20:34:29,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 109 remaining) [2023-08-29 20:34:29,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 109 remaining) [2023-08-29 20:34:29,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 109 remaining) [2023-08-29 20:34:29,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 109 remaining) [2023-08-29 20:34:29,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 109 remaining) [2023-08-29 20:34:29,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 109 remaining) [2023-08-29 20:34:29,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 109 remaining) [2023-08-29 20:34:29,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 109 remaining) [2023-08-29 20:34:29,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 109 remaining) [2023-08-29 20:34:29,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 109 remaining) [2023-08-29 20:34:29,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 109 remaining) [2023-08-29 20:34:29,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 109 remaining) [2023-08-29 20:34:29,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 109 remaining) [2023-08-29 20:34:29,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 109 remaining) [2023-08-29 20:34:29,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 109 remaining) [2023-08-29 20:34:29,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 109 remaining) [2023-08-29 20:34:29,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 109 remaining) [2023-08-29 20:34:29,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 109 remaining) [2023-08-29 20:34:29,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 109 remaining) [2023-08-29 20:34:29,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 20:34:29,757 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:29,761 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:34:29,761 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:34:29,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:34:29 BasicIcfg [2023-08-29 20:34:29,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:34:29,806 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:34:29,806 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:34:29,806 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:34:29,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:33:22" (3/4) ... [2023-08-29 20:34:29,808 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:34:29,808 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:34:29,808 INFO L158 Benchmark]: Toolchain (without parser) took 68612.29ms. Allocated memory was 71.3MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 47.8MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2023-08-29 20:34:29,809 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 56.6MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:34:29,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.70ms. Allocated memory is still 71.3MB. Free memory was 47.6MB in the beginning and 38.0MB in the end (delta: 9.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-29 20:34:29,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.30ms. Allocated memory is still 71.3MB. Free memory was 38.0MB in the beginning and 35.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:34:29,809 INFO L158 Benchmark]: Boogie Preprocessor took 40.42ms. Allocated memory is still 71.3MB. Free memory was 35.1MB in the beginning and 32.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:34:29,809 INFO L158 Benchmark]: RCFGBuilder took 1113.47ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 32.2MB in the beginning and 49.0MB in the end (delta: -16.8MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2023-08-29 20:34:29,810 INFO L158 Benchmark]: TraceAbstraction took 66881.18ms. Allocated memory was 104.9MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 48.2MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2023-08-29 20:34:29,810 INFO L158 Benchmark]: Witness Printer took 2.21ms. Allocated memory is still 4.0GB. Free memory is still 1.9GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:34:29,811 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.68ms. Allocated memory is still 56.6MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 507.70ms. Allocated memory is still 71.3MB. Free memory was 47.6MB in the beginning and 38.0MB in the end (delta: 9.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.30ms. Allocated memory is still 71.3MB. Free memory was 38.0MB in the beginning and 35.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.42ms. Allocated memory is still 71.3MB. Free memory was 35.1MB in the beginning and 32.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1113.47ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 32.2MB in the beginning and 49.0MB in the end (delta: -16.8MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * TraceAbstraction took 66881.18ms. Allocated memory was 104.9MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 48.2MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 2.21ms. Allocated memory is still 4.0GB. Free memory is still 1.9GB. 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: 16.8s, 198 PlacesBefore, 102 PlacesAfterwards, 190 TransitionsBefore, 93 TransitionsAfterwards, 9348 CoEnabledTransitionPairs, 8 FixpointIterations, 64 TrivialSequentialCompositions, 86 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 154 TotalNumberOfCompositions, 53551 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13701, independent: 12899, independent conditional: 0, independent unconditional: 12899, dependent: 802, dependent conditional: 0, dependent unconditional: 802, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3554, independent: 3446, independent conditional: 0, independent unconditional: 3446, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13701, independent: 9453, independent conditional: 0, independent unconditional: 9453, dependent: 694, dependent conditional: 0, dependent unconditional: 694, unknown: 3554, unknown conditional: 0, unknown unconditional: 3554] , Statistics on independence cache: Total cache size (in pairs): 796, Positive cache size: 747, Positive conditional cache size: 0, Positive unconditional cache size: 747, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, 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_p1_EAX = 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; [L853] 0 pthread_t t1777; [L854] FCALL, FORK 0 pthread_create(&t1777, ((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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1777, ((void *)0), P0, ((void *)0))=-3, t1777={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] 0 pthread_t t1778; [L856] FCALL, FORK 0 pthread_create(&t1778, ((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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1778, ((void *)0), P1, ((void *)0))=-2, t1777={6:0}, t1778={8:0}, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] 0 pthread_t t1779; [L780] 1 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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 __unbuffered_p1_EAX = 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_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 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_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L798] 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) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 \read(y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] 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) [L798] 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) [L799] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 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 [L801] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 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_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] FCALL, FORK 0 pthread_create(&t1779, ((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_p1_EAX=1, __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(&t1779, ((void *)0), P2, ((void *)0))=-1, t1777={6:0}, t1778={8:0}, t1779={5:0}, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] EXPR 3 \read(y) [L815] 3 y$mem_tmp = y [L816] 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) [L816] EXPR 3 \read(y) [L816] 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) [L816] 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) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 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)) [L822] 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)) [L823] EXPR 3 \read(y) [L823] 3 __unbuffered_p2_EAX = y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 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_p1_EAX=1, __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=1, 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}] [L828] 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_p1_EAX=1, __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=1, 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}] [L831] 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) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 \read(y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] 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) [L831] 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) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 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 [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 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_p1_EAX=1, __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=1, 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}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] 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) [L864] 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) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 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 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 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_p1_EAX=1, __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, t1777={6:0}, t1778={8:0}, t1779={5:0}, weak$$choice1=1, 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}] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] 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) [L875] EXPR 0 \read(y) [L875] 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) [L875] 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) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 \read(y) [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L888] 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_p1_EAX=1, __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=1, 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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 854]: 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: 856]: 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, 258 locations, 109 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: 66.7s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 39.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2842 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2138 mSDsluCounter, 1086 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 891 mSDsCounter, 497 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6006 IncrementalHoareTripleChecker+Invalid, 6503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 497 mSolverCounterUnsat, 195 mSDtfsCounter, 6006 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2377occurred in iteration=18, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 3529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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:34:29,836 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/safe000_power.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 e872da92455c9ab0fe125378ae9802f1d4dfc806cea229583fb74f8b758e929f --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:34:31,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:34:31,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:34:31,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:34:31,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:34:31,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:34:31,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:34:31,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:34:31,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:34:31,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:34:31,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:34:31,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:34:31,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:34:31,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:34:31,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:34:31,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:34:31,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:34:31,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:34:31,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:34:31,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:34:31,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:34:31,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:34:31,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:34:31,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:34:31,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:34:31,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:34:31,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:34:31,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:34:31,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:34:31,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:34:31,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:34:31,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:34:31,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:34:31,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:34:31,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:34:31,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:34:31,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:34:31,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:34:31,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:34:31,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:34:31,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:34:31,676 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:34:31,703 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:34:31,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:34:31,704 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:34:31,704 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:34:31,705 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:34:31,705 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:34:31,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:34:31,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:34:31,706 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:34:31,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:34:31,706 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:34:31,707 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:34:31,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:34:31,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:34:31,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:34:31,707 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:34:31,707 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:34:31,707 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:34:31,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:34:31,708 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:34:31,708 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:34:31,708 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:34:31,708 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:34:31,708 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:34:31,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:34:31,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:34:31,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:34:31,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:34:31,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:34:31,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:34:31,709 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:34:31,709 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:34:31,710 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:34:31,710 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:34:31,710 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:34:31,710 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:34:31,710 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:34:31,710 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 -> e872da92455c9ab0fe125378ae9802f1d4dfc806cea229583fb74f8b758e929f 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:34:31,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:34:31,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:34:31,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:34:31,940 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:34:31,940 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:34:31,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.oepc.i [2023-08-29 20:34:32,813 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:34:33,026 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:34:33,028 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.oepc.i [2023-08-29 20:34:33,038 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ae344bb/ef65a5c3cc904f1194e115166240cc26/FLAGadc7d7626 [2023-08-29 20:34:33,046 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ae344bb/ef65a5c3cc904f1194e115166240cc26 [2023-08-29 20:34:33,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:34:33,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:34:33,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:34:33,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:34:33,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:34:33,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:34:33" (1/1) ... [2023-08-29 20:34:33,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da733f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:33, skipping insertion in model container [2023-08-29 20:34:33,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:34:33" (1/1) ... [2023-08-29 20:34:33,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:34:33,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:34:33,234 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/safe000_power.oepc.i[995,1008] [2023-08-29 20:34:33,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:34:33,441 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:34:33,450 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/safe000_power.oepc.i[995,1008] [2023-08-29 20:34:33,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:34:33,534 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:34:33,535 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:34:33,539 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:34:33,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:33 WrapperNode [2023-08-29 20:34:33,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:34:33,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:34:33,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:34:33,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:34:33,545 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:34:33" (1/1) ... [2023-08-29 20:34:33,574 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:34:33" (1/1) ... [2023-08-29 20:34:33,602 INFO L138 Inliner]: procedures = 180, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 171 [2023-08-29 20:34:33,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:34:33,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:34:33,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:34:33,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:34:33,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:33" (1/1) ... [2023-08-29 20:34:33,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:33" (1/1) ... [2023-08-29 20:34:33,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:33" (1/1) ... [2023-08-29 20:34:33,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:33" (1/1) ... [2023-08-29 20:34:33,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:33" (1/1) ... [2023-08-29 20:34:33,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:33" (1/1) ... [2023-08-29 20:34:33,632 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:33" (1/1) ... [2023-08-29 20:34:33,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:33" (1/1) ... [2023-08-29 20:34:33,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:34:33,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:34:33,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:34:33,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:34:33,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:33" (1/1) ... [2023-08-29 20:34:33,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:34:33,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:34:33,675 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:34:33,697 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:34:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 20:34:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:34:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:34:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:34:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:34:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:34:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:34:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-29 20:34:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:34:33,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:34:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:34:33,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:34:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:34:33,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:34:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:34:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:34:33,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:34:33,713 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:34:33,849 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:34:33,856 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:34:34,396 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:34:34,829 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:34:34,830 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:34:34,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:34:34 BoogieIcfgContainer [2023-08-29 20:34:34,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:34:34,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:34:34,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:34:34,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:34:34,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:34:33" (1/3) ... [2023-08-29 20:34:34,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4371a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:34:34, skipping insertion in model container [2023-08-29 20:34:34,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:33" (2/3) ... [2023-08-29 20:34:34,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4371a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:34:34, skipping insertion in model container [2023-08-29 20:34:34,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:34:34" (3/3) ... [2023-08-29 20:34:34,838 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.oepc.i [2023-08-29 20:34:34,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:34:34,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2023-08-29 20:34:34,849 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:34:34,990 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:34:35,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 194 transitions, 403 flow [2023-08-29 20:34:35,072 INFO L130 PetriNetUnfolder]: 2/191 cut-off events. [2023-08-29 20:34:35,072 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:34:35,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 2/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 388 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2023-08-29 20:34:35,077 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 194 transitions, 403 flow [2023-08-29 20:34:35,081 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 191 transitions, 391 flow [2023-08-29 20:34:35,083 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:34:35,088 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 191 transitions, 391 flow [2023-08-29 20:34:35,118 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 191 transitions, 391 flow [2023-08-29 20:34:35,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 191 transitions, 391 flow [2023-08-29 20:34:35,208 INFO L130 PetriNetUnfolder]: 2/191 cut-off events. [2023-08-29 20:34:35,209 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:34:35,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 2/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 394 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2023-08-29 20:34:35,213 INFO L119 LiptonReduction]: Number of co-enabled transitions 9348 [2023-08-29 20:35:10,690 INFO L134 LiptonReduction]: Checked pairs total: 46994 [2023-08-29 20:35:10,691 INFO L136 LiptonReduction]: Total number of compositions: 162 [2023-08-29 20:35:10,708 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:35:10,713 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;@91ea89c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:35:10,713 INFO L358 AbstractCegarLoop]: Starting to check reachability of 109 error locations. [2023-08-29 20:35:10,717 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:35:10,717 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:35:10,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:10,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:35:10,718 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:35:10,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:10,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1296, now seen corresponding path program 1 times [2023-08-29 20:35:10,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:10,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933285936] [2023-08-29 20:35:10,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:10,729 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:35:10,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:10,734 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:35:10,737 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:35:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:10,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:35:10,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:10,841 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:10,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:10,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:10,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933285936] [2023-08-29 20:35:10,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933285936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:10,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:10,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:35:10,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701015236] [2023-08-29 20:35:10,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:10,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:35:10,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:10,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:35:10,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:35:10,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 356 [2023-08-29 20:35:10,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 91 transitions, 191 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:35:10,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:10,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 356 [2023-08-29 20:35:10,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:13,890 INFO L130 PetriNetUnfolder]: 17324/24356 cut-off events. [2023-08-29 20:35:13,891 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:35:13,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48713 conditions, 24356 events. 17324/24356 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2176. Compared 169016 event pairs, 17324 based on Foata normal form. 0/9946 useless extension candidates. Maximal degree in co-relation 48702. Up to 24261 conditions per place. [2023-08-29 20:35:14,009 INFO L137 encePairwiseOnDemand]: 315/356 looper letters, 44 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2023-08-29 20:35:14,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 197 flow [2023-08-29 20:35:14,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:35:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:35:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 341 transitions. [2023-08-29 20:35:14,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789325842696629 [2023-08-29 20:35:14,022 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 341 transitions. [2023-08-29 20:35:14,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 341 transitions. [2023-08-29 20:35:14,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:14,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 341 transitions. [2023-08-29 20:35:14,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 170.5) internal successors, (341), 2 states have internal predecessors, (341), 0 states have call successors, (0), 0 states 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:14,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 356.0) internal successors, (1068), 3 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states 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:14,034 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 356.0) internal successors, (1068), 3 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states 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:14,036 INFO L175 Difference]: Start difference. First operand has 101 places, 91 transitions, 191 flow. Second operand 2 states and 341 transitions. [2023-08-29 20:35:14,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 197 flow [2023-08-29 20:35:14,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 194 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:35:14,043 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 106 flow [2023-08-29 20:35:14,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-29 20:35:14,048 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -43 predicate places. [2023-08-29 20:35:14,048 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 106 flow [2023-08-29 20:35:14,048 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:35:14,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:14,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:35:14,055 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:35:14,255 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:35:14,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:35:14,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1281712, now seen corresponding path program 1 times [2023-08-29 20:35:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:14,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870342604] [2023-08-29 20:35:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:14,257 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:35:14,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:14,259 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:35:14,261 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:35:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:14,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:35:14,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:14,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:35:14,400 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:35:14,419 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:14,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:14,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870342604] [2023-08-29 20:35:14,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870342604] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:14,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:14,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:35:14,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748295931] [2023-08-29 20:35:14,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:14,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:35:14,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:14,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:35:14,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:35:14,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 356 [2023-08-29 20:35:14,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 106 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:35:14,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:14,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 356 [2023-08-29 20:35:14,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:15,737 INFO L130 PetriNetUnfolder]: 5696/8190 cut-off events. [2023-08-29 20:35:15,737 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:35:15,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16384 conditions, 8190 events. 5696/8190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 50128 event pairs, 5696 based on Foata normal form. 404/4936 useless extension candidates. Maximal degree in co-relation 16381. Up to 8133 conditions per place. [2023-08-29 20:35:15,779 INFO L137 encePairwiseOnDemand]: 345/356 looper letters, 34 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-29 20:35:15,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 156 flow [2023-08-29 20:35:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:35:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:35:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-29 20:35:15,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3960674157303371 [2023-08-29 20:35:15,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-29 20:35:15,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-29 20:35:15,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:15,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-29 20:35:15,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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:15,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states 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:15,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states 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:15,785 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 106 flow. Second operand 3 states and 423 transitions. [2023-08-29 20:35:15,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 156 flow [2023-08-29 20:35:15,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:35:15,786 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 88 flow [2023-08-29 20:35:15,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-29 20:35:15,787 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -51 predicate places. [2023-08-29 20:35:15,787 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 88 flow [2023-08-29 20:35:15,788 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:35:15,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:15,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:35:15,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-29 20:35:15,995 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:35:15,995 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:35:15,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:15,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1281711, now seen corresponding path program 1 times [2023-08-29 20:35:15,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:15,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873125021] [2023-08-29 20:35:15,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:15,999 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:35:15,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:16,000 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:35:16,037 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:35:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:16,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:35:16,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:16,125 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 20:35:16,126 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:35:16,144 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:16,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:16,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:16,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873125021] [2023-08-29 20:35:16,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873125021] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:16,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:16,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:35:16,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366389159] [2023-08-29 20:35:16,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:16,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:35:16,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:16,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:35:16,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:35:16,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 356 [2023-08-29 20:35:16,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 88 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:35:16,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:16,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 356 [2023-08-29 20:35:16,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:16,779 INFO L130 PetriNetUnfolder]: 2786/4080 cut-off events. [2023-08-29 20:35:16,779 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:35:16,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8181 conditions, 4080 events. 2786/4080 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 22392 event pairs, 1618 based on Foata normal form. 177/3057 useless extension candidates. Maximal degree in co-relation 8177. Up to 2945 conditions per place. [2023-08-29 20:35:16,792 INFO L137 encePairwiseOnDemand]: 343/356 looper letters, 40 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-29 20:35:16,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 182 flow [2023-08-29 20:35:16,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:35:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:35:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-29 20:35:16,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951310861423221 [2023-08-29 20:35:16,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-29 20:35:16,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-29 20:35:16,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:16,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-29 20:35:16,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states 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:16,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states 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:16,799 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states 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:16,799 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 88 flow. Second operand 3 states and 422 transitions. [2023-08-29 20:35:16,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 182 flow [2023-08-29 20:35:16,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:35:16,801 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 103 flow [2023-08-29 20:35:16,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-08-29 20:35:16,802 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -52 predicate places. [2023-08-29 20:35:16,804 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 103 flow [2023-08-29 20:35:16,804 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:35:16,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:16,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:35:16,829 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:35:17,014 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:35:17,014 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:35:17,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:17,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1218736292, now seen corresponding path program 1 times [2023-08-29 20:35:17,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:17,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432349243] [2023-08-29 20:35:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:17,019 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:35:17,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:17,020 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:35:17,022 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:35:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:17,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:35:17,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:17,170 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:17,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:17,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432349243] [2023-08-29 20:35:17,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432349243] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:17,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:35:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406101286] [2023-08-29 20:35:17,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:17,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:35:17,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:17,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:35:17,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:35:17,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 356 [2023-08-29 20:35:17,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:17,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:17,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 356 [2023-08-29 20:35:17,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:17,577 INFO L130 PetriNetUnfolder]: 1024/1708 cut-off events. [2023-08-29 20:35:17,577 INFO L131 PetriNetUnfolder]: For 127/161 co-relation queries the response was YES. [2023-08-29 20:35:17,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 1708 events. 1024/1708 cut-off events. For 127/161 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 9635 event pairs, 378 based on Foata normal form. 48/1485 useless extension candidates. Maximal degree in co-relation 3765. Up to 1464 conditions per place. [2023-08-29 20:35:17,582 INFO L137 encePairwiseOnDemand]: 350/356 looper letters, 42 selfloop transitions, 4 changer transitions 17/68 dead transitions. [2023-08-29 20:35:17,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 295 flow [2023-08-29 20:35:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:35:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:35:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-29 20:35:17,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37359550561797755 [2023-08-29 20:35:17,584 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-29 20:35:17,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-29 20:35:17,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:17,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-29 20:35:17,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:17,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states 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:17,588 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states 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:17,588 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 103 flow. Second operand 5 states and 665 transitions. [2023-08-29 20:35:17,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 295 flow [2023-08-29 20:35:17,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:35:17,590 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 135 flow [2023-08-29 20:35:17,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, 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=5, PETRI_FLOW=135, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-29 20:35:17,591 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -47 predicate places. [2023-08-29 20:35:17,591 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 135 flow [2023-08-29 20:35:17,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:17,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:17,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:35:17,609 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:35:17,798 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:35:17,799 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:35:17,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:17,799 INFO L85 PathProgramCache]: Analyzing trace with hash 752776769, now seen corresponding path program 1 times [2023-08-29 20:35:17,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738251341] [2023-08-29 20:35:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:17,800 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:35:17,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:17,800 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:35:17,801 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:35:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:17,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:35:17,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:17,955 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:17,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:17,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:17,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738251341] [2023-08-29 20:35:17,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738251341] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:17,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:17,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:35:17,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655458511] [2023-08-29 20:35:17,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:17,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:35:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:17,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:35:17,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:35:17,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 356 [2023-08-29 20:35:17,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:17,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:17,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 356 [2023-08-29 20:35:17,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:18,301 INFO L130 PetriNetUnfolder]: 253/502 cut-off events. [2023-08-29 20:35:18,301 INFO L131 PetriNetUnfolder]: For 198/202 co-relation queries the response was YES. [2023-08-29 20:35:18,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 502 events. 253/502 cut-off events. For 198/202 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2219 event pairs, 68 based on Foata normal form. 30/479 useless extension candidates. Maximal degree in co-relation 1336. Up to 246 conditions per place. [2023-08-29 20:35:18,303 INFO L137 encePairwiseOnDemand]: 350/356 looper letters, 50 selfloop transitions, 7 changer transitions 17/79 dead transitions. [2023-08-29 20:35:18,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 79 transitions, 405 flow [2023-08-29 20:35:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:35:18,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:35:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 796 transitions. [2023-08-29 20:35:18,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37265917602996257 [2023-08-29 20:35:18,315 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 796 transitions. [2023-08-29 20:35:18,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 796 transitions. [2023-08-29 20:35:18,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:18,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 796 transitions. [2023-08-29 20:35:18,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states 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:18,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states 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:18,323 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states 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:18,323 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 135 flow. Second operand 6 states and 796 transitions. [2023-08-29 20:35:18,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 79 transitions, 405 flow [2023-08-29 20:35:18,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 399 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:35:18,327 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 185 flow [2023-08-29 20:35:18,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-08-29 20:35:18,329 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -43 predicate places. [2023-08-29 20:35:18,329 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 185 flow [2023-08-29 20:35:18,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:18,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:18,330 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:35:18,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:35:18,538 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:35:18,538 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:35:18,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash -729421913, now seen corresponding path program 1 times [2023-08-29 20:35:18,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:18,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76794811] [2023-08-29 20:35:18,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:18,539 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:35:18,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:18,540 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:35:18,541 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:35:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:18,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:35:18,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:18,753 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:18,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:18,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:18,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76794811] [2023-08-29 20:35:18,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76794811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:18,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:18,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:35:18,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676551988] [2023-08-29 20:35:18,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:18,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:35:18,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:18,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:35:18,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:35:18,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 356 [2023-08-29 20:35:18,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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:18,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:18,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 356 [2023-08-29 20:35:18,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:19,117 INFO L130 PetriNetUnfolder]: 121/243 cut-off events. [2023-08-29 20:35:19,117 INFO L131 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2023-08-29 20:35:19,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 243 events. 121/243 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 835 event pairs, 40 based on Foata normal form. 9/245 useless extension candidates. Maximal degree in co-relation 724. Up to 92 conditions per place. [2023-08-29 20:35:19,118 INFO L137 encePairwiseOnDemand]: 350/356 looper letters, 40 selfloop transitions, 10 changer transitions 10/63 dead transitions. [2023-08-29 20:35:19,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 363 flow [2023-08-29 20:35:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:35:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:35:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2023-08-29 20:35:19,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3619582664526485 [2023-08-29 20:35:19,121 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2023-08-29 20:35:19,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2023-08-29 20:35:19,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:19,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2023-08-29 20:35:19,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states 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:19,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 356.0) internal successors, (2848), 8 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states 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:19,125 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 356.0) internal successors, (2848), 8 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states 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:19,125 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 185 flow. Second operand 7 states and 902 transitions. [2023-08-29 20:35:19,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 363 flow [2023-08-29 20:35:19,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 325 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-29 20:35:19,128 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 151 flow [2023-08-29 20:35:19,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=7, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2023-08-29 20:35:19,129 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -49 predicate places. [2023-08-29 20:35:19,129 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 151 flow [2023-08-29 20:35:19,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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:19,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:19,129 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:35:19,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-08-29 20:35:19,333 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:35:19,334 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:35:19,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:19,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1924928008, now seen corresponding path program 1 times [2023-08-29 20:35:19,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:19,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239072807] [2023-08-29 20:35:19,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:19,335 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:35:19,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:19,336 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:35:19,338 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:35:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:19,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-29 20:35:19,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:21,538 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 7 treesize of output 5 [2023-08-29 20:35:21,569 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:21,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:21,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:21,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239072807] [2023-08-29 20:35:21,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239072807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:21,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:21,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:35:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407643052] [2023-08-29 20:35:21,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:21,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:35:21,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:21,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:35:21,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:35:21,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 356 [2023-08-29 20:35:21,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:21,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:21,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 356 [2023-08-29 20:35:21,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:21,911 INFO L130 PetriNetUnfolder]: 168/347 cut-off events. [2023-08-29 20:35:21,912 INFO L131 PetriNetUnfolder]: For 402/402 co-relation queries the response was YES. [2023-08-29 20:35:21,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 347 events. 168/347 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1388 event pairs, 27 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 925. Up to 233 conditions per place. [2023-08-29 20:35:21,913 INFO L137 encePairwiseOnDemand]: 352/356 looper letters, 45 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-29 20:35:21,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 299 flow [2023-08-29 20:35:21,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:35:21,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:35:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-29 20:35:21,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3771067415730337 [2023-08-29 20:35:21,915 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-29 20:35:21,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-29 20:35:21,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:21,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-29 20:35:21,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:21,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states 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:21,918 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states 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:21,918 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 151 flow. Second operand 4 states and 537 transitions. [2023-08-29 20:35:21,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 299 flow [2023-08-29 20:35:21,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 255 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-08-29 20:35:21,920 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 113 flow [2023-08-29 20:35:21,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-08-29 20:35:21,920 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -57 predicate places. [2023-08-29 20:35:21,920 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 113 flow [2023-08-29 20:35:21,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:21,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:21,921 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:35:21,931 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:35:22,129 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:35:22,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:35:22,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:22,130 INFO L85 PathProgramCache]: Analyzing trace with hash -143935124, now seen corresponding path program 1 times [2023-08-29 20:35:22,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:22,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527954395] [2023-08-29 20:35:22,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:22,130 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:35:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:22,131 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:35:22,133 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:35:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:22,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:35:22,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:35:22,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:22,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:22,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527954395] [2023-08-29 20:35:22,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527954395] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:22,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:22,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:35:22,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934954004] [2023-08-29 20:35:22,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:22,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:35:22,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:22,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:35:22,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:35:22,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 356 [2023-08-29 20:35:22,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:22,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:22,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 356 [2023-08-29 20:35:22,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:22,517 INFO L130 PetriNetUnfolder]: 205/409 cut-off events. [2023-08-29 20:35:22,518 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2023-08-29 20:35:22,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 409 events. 205/409 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1792 event pairs, 64 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 1114. Up to 150 conditions per place. [2023-08-29 20:35:22,519 INFO L137 encePairwiseOnDemand]: 352/356 looper letters, 62 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2023-08-29 20:35:22,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 67 transitions, 371 flow [2023-08-29 20:35:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:35:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:35:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-29 20:35:22,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3848314606741573 [2023-08-29 20:35:22,522 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-29 20:35:22,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-29 20:35:22,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:22,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-29 20:35:22,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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:22,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states 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:22,525 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states 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:22,525 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 113 flow. Second operand 4 states and 548 transitions. [2023-08-29 20:35:22,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 67 transitions, 371 flow [2023-08-29 20:35:22,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:35:22,527 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 124 flow [2023-08-29 20:35:22,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, 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=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-29 20:35:22,527 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -55 predicate places. [2023-08-29 20:35:22,528 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 124 flow [2023-08-29 20:35:22,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:22,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:22,528 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:35:22,538 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:35:22,736 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:35:22,736 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:35:22,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1136696426, now seen corresponding path program 2 times [2023-08-29 20:35:22,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:22,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213737938] [2023-08-29 20:35:22,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:35:22,737 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:35:22,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:22,738 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:35:22,740 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:35:22,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:35:22,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:35:22,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-29 20:35:22,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:25,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2023-08-29 20:35:25,042 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-08-29 20:35:25,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 20:35:25,319 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:35:25,468 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:35:25,483 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:25,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:25,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:25,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213737938] [2023-08-29 20:35:25,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213737938] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:25,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:25,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:35:25,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488052134] [2023-08-29 20:35:25,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:25,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:35:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:25,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:35:25,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:35:25,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 356 [2023-08-29 20:35:25,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 124 flow. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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:25,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:25,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 356 [2023-08-29 20:35:25,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:26,290 INFO L130 PetriNetUnfolder]: 334/679 cut-off events. [2023-08-29 20:35:26,291 INFO L131 PetriNetUnfolder]: For 547/547 co-relation queries the response was YES. [2023-08-29 20:35:26,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1979 conditions, 679 events. 334/679 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3374 event pairs, 59 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 1971. Up to 349 conditions per place. [2023-08-29 20:35:26,293 INFO L137 encePairwiseOnDemand]: 349/356 looper letters, 64 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2023-08-29 20:35:26,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 400 flow [2023-08-29 20:35:26,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:35:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:35:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2023-08-29 20:35:26,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3408239700374532 [2023-08-29 20:35:26,295 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2023-08-29 20:35:26,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2023-08-29 20:35:26,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:26,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2023-08-29 20:35:26,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:26,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states 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:26,299 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states 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:26,299 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 124 flow. Second operand 6 states and 728 transitions. [2023-08-29 20:35:26,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 400 flow [2023-08-29 20:35:26,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:35:26,302 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 158 flow [2023-08-29 20:35:26,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-08-29 20:35:26,303 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -50 predicate places. [2023-08-29 20:35:26,303 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 158 flow [2023-08-29 20:35:26,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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:26,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:26,303 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:35:26,321 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:35:26,511 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:35:26,512 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:35:26,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash -126881560, now seen corresponding path program 3 times [2023-08-29 20:35:26,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:26,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009995998] [2023-08-29 20:35:26,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:35:26,513 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:35:26,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:26,513 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:35:26,516 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:35:26,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:35:26,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:35:26,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-29 20:35:26,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:26,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:35:26,755 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:35:26,769 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 20:35:26,769 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:35:26,807 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 20:35:26,807 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:35:26,838 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:35:26,864 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-29 20:35:26,864 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:35:26,890 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:35:27,140 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2023-08-29 20:35:27,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2023-08-29 20:35:27,337 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:27,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:27,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:27,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009995998] [2023-08-29 20:35:27,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009995998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:27,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:27,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:35:27,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985217086] [2023-08-29 20:35:27,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:27,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:35:27,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:27,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:35:27,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:35:27,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 356 [2023-08-29 20:35:27,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states 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:27,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:27,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 356 [2023-08-29 20:35:27,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:27,955 INFO L130 PetriNetUnfolder]: 404/784 cut-off events. [2023-08-29 20:35:27,955 INFO L131 PetriNetUnfolder]: For 936/936 co-relation queries the response was YES. [2023-08-29 20:35:27,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2572 conditions, 784 events. 404/784 cut-off events. For 936/936 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3925 event pairs, 70 based on Foata normal form. 1/785 useless extension candidates. Maximal degree in co-relation 2562. Up to 490 conditions per place. [2023-08-29 20:35:27,958 INFO L137 encePairwiseOnDemand]: 348/356 looper letters, 62 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2023-08-29 20:35:27,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 476 flow [2023-08-29 20:35:27,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:35:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:35:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 694 transitions. [2023-08-29 20:35:27,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3249063670411985 [2023-08-29 20:35:27,960 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 694 transitions. [2023-08-29 20:35:27,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 694 transitions. [2023-08-29 20:35:27,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:27,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 694 transitions. [2023-08-29 20:35:27,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states 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:27,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states 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:27,963 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states 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:27,963 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 158 flow. Second operand 6 states and 694 transitions. [2023-08-29 20:35:27,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 476 flow [2023-08-29 20:35:27,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 469 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:35:27,966 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 239 flow [2023-08-29 20:35:27,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-08-29 20:35:27,966 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -44 predicate places. [2023-08-29 20:35:27,966 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 239 flow [2023-08-29 20:35:27,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states 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:27,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:27,966 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:35:27,975 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:35:28,175 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:35:28,175 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2023-08-29 20:35:28,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:28,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1053979314, now seen corresponding path program 4 times [2023-08-29 20:35:28,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:28,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021506238] [2023-08-29 20:35:28,176 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:35:28,176 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:35:28,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:28,177 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:35:28,178 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:35:28,385 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:35:28,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:35:28,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:35:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:35:28,589 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:35:28,589 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:35:28,590 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (108 of 109 remaining) [2023-08-29 20:35:28,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 109 remaining) [2023-08-29 20:35:28,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 109 remaining) [2023-08-29 20:35:28,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 109 remaining) [2023-08-29 20:35:28,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 109 remaining) [2023-08-29 20:35:28,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 109 remaining) [2023-08-29 20:35:28,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 109 remaining) [2023-08-29 20:35:28,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 109 remaining) [2023-08-29 20:35:28,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 109 remaining) [2023-08-29 20:35:28,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 109 remaining) [2023-08-29 20:35:28,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 109 remaining) [2023-08-29 20:35:28,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 109 remaining) [2023-08-29 20:35:28,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 109 remaining) [2023-08-29 20:35:28,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 109 remaining) [2023-08-29 20:35:28,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 109 remaining) [2023-08-29 20:35:28,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 109 remaining) [2023-08-29 20:35:28,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 109 remaining) [2023-08-29 20:35:28,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 109 remaining) [2023-08-29 20:35:28,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 109 remaining) [2023-08-29 20:35:28,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 109 remaining) [2023-08-29 20:35:28,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 109 remaining) [2023-08-29 20:35:28,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 109 remaining) [2023-08-29 20:35:28,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 109 remaining) [2023-08-29 20:35:28,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 109 remaining) [2023-08-29 20:35:28,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 109 remaining) [2023-08-29 20:35:28,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 109 remaining) [2023-08-29 20:35:28,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 109 remaining) [2023-08-29 20:35:28,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 109 remaining) [2023-08-29 20:35:28,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 109 remaining) [2023-08-29 20:35:28,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 109 remaining) [2023-08-29 20:35:28,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 109 remaining) [2023-08-29 20:35:28,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 109 remaining) [2023-08-29 20:35:28,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 109 remaining) [2023-08-29 20:35:28,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 109 remaining) [2023-08-29 20:35:28,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 109 remaining) [2023-08-29 20:35:28,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 109 remaining) [2023-08-29 20:35:28,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 109 remaining) [2023-08-29 20:35:28,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 109 remaining) [2023-08-29 20:35:28,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 109 remaining) [2023-08-29 20:35:28,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 109 remaining) [2023-08-29 20:35:28,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 109 remaining) [2023-08-29 20:35:28,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 109 remaining) [2023-08-29 20:35:28,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 109 remaining) [2023-08-29 20:35:28,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 109 remaining) [2023-08-29 20:35:28,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 109 remaining) [2023-08-29 20:35:28,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 109 remaining) [2023-08-29 20:35:28,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 109 remaining) [2023-08-29 20:35:28,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 109 remaining) [2023-08-29 20:35:28,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 109 remaining) [2023-08-29 20:35:28,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 109 remaining) [2023-08-29 20:35:28,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 109 remaining) [2023-08-29 20:35:28,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 109 remaining) [2023-08-29 20:35:28,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (43 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 109 remaining) [2023-08-29 20:35:28,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 109 remaining) [2023-08-29 20:35:28,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 109 remaining) [2023-08-29 20:35:28,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 109 remaining) [2023-08-29 20:35:28,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 109 remaining) [2023-08-29 20:35:28,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 109 remaining) [2023-08-29 20:35:28,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 109 remaining) [2023-08-29 20:35:28,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 109 remaining) [2023-08-29 20:35:28,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 109 remaining) [2023-08-29 20:35:28,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 109 remaining) [2023-08-29 20:35:28,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 109 remaining) [2023-08-29 20:35:28,609 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:35:28,800 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:35:28,801 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:35:28,805 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:35:28,805 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:35:28,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:35:28 BasicIcfg [2023-08-29 20:35:28,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:35:28,879 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:35:28,879 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:35:28,879 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:35:28,880 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:34:34" (3/4) ... [2023-08-29 20:35:28,881 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:35:28,881 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:35:28,881 INFO L158 Benchmark]: Toolchain (without parser) took 55832.91ms. Allocated memory was 75.5MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 50.2MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-29 20:35:28,882 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:35:28,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.39ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 42.2MB in the end (delta: 7.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-08-29 20:35:28,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.29ms. Allocated memory is still 75.5MB. Free memory was 42.2MB in the beginning and 39.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:35:28,882 INFO L158 Benchmark]: Boogie Preprocessor took 49.63ms. Allocated memory is still 75.5MB. Free memory was 39.2MB in the beginning and 36.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:35:28,882 INFO L158 Benchmark]: RCFGBuilder took 1178.23ms. Allocated memory was 75.5MB in the beginning and 123.7MB in the end (delta: 48.2MB). Free memory was 36.4MB in the beginning and 72.1MB in the end (delta: -35.6MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2023-08-29 20:35:28,883 INFO L158 Benchmark]: TraceAbstraction took 54046.19ms. Allocated memory was 123.7MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 72.1MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-08-29 20:35:28,884 INFO L158 Benchmark]: Witness Printer took 2.05ms. Allocated memory is still 4.0GB. Free memory is still 2.7GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:35:28,885 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.09ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.39ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 42.2MB in the end (delta: 7.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.29ms. Allocated memory is still 75.5MB. Free memory was 42.2MB in the beginning and 39.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.63ms. Allocated memory is still 75.5MB. Free memory was 39.2MB in the beginning and 36.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1178.23ms. Allocated memory was 75.5MB in the beginning and 123.7MB in the end (delta: 48.2MB). Free memory was 36.4MB in the beginning and 72.1MB in the end (delta: -35.6MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * TraceAbstraction took 54046.19ms. Allocated memory was 123.7MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 72.1MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 2.05ms. Allocated memory is still 4.0GB. Free memory is still 2.7GB. 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: 35.6s, 199 PlacesBefore, 101 PlacesAfterwards, 191 TransitionsBefore, 91 TransitionsAfterwards, 9348 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 85 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 162 TotalNumberOfCompositions, 46994 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11846, independent: 11145, independent conditional: 0, independent unconditional: 11145, dependent: 701, dependent conditional: 0, dependent unconditional: 701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3312, independent: 3202, independent conditional: 0, independent unconditional: 3202, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11846, independent: 7943, independent conditional: 0, independent unconditional: 7943, dependent: 591, dependent conditional: 0, dependent unconditional: 591, unknown: 3312, unknown conditional: 0, unknown unconditional: 3312] , Statistics on independence cache: Total cache size (in pairs): 528, Positive cache size: 479, Positive conditional cache size: 0, Positive unconditional cache size: 479, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, 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_p1_EAX = 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; [L853] 0 pthread_t t1777; [L854] FCALL, FORK 0 pthread_create(&t1777, ((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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1777, ((void *)0), P0, ((void *)0))=0, t1777={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 \read(y) [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L780] 1 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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=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}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L855] 0 pthread_t t1778; [L856] FCALL, FORK 0 pthread_create(&t1778, ((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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1778, ((void *)0), P1, ((void *)0))=1, t1777={15:0}, t1778={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] 0 pthread_t t1779; [L858] FCALL, FORK 0 pthread_create(&t1779, ((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_p1_EAX=1, __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(&t1779, ((void *)0), P2, ((void *)0))=2, t1777={15:0}, t1778={7:0}, t1779={31:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 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_p1_EAX=1, __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$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L798] 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) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 \read(y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] 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) [L798] 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) [L799] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 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 [L801] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 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_p1_EAX=1, __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$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] EXPR 3 \read(y) [L815] 3 y$mem_tmp = y [L816] 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) [L816] EXPR 3 \read(y) [L816] 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) [L816] 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) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 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)) [L822] 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)) [L823] EXPR 3 \read(y) [L823] 3 __unbuffered_p2_EAX = y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=2, 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}] [L828] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=2, 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}] [L831] 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) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 \read(y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] 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) [L831] 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) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 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 [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=2, 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}] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] 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) [L864] 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) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 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 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 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_p1_EAX=1, __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, t1777={15:0}, t1778={7:0}, t1779={31:0}, weak$$choice1=0, weak$$choice2=2, 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}] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] 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) [L875] EXPR 0 \read(y) [L875] 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) [L875] 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) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 \read(y) [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 0 \read(y) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L888] 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_p1_EAX=1, __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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 856]: 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: 858]: 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, 259 locations, 109 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: 53.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 35.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 866 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 587 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1765 IncrementalHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 10 mSDtfsCounter, 1765 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=10, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 1588 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1513 ConjunctsInSsa, 99 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:35:28,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample