./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi006_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/rfi006_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 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 --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:32:18,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:32:18,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:32:18,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:32:18,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:32:18,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:32:18,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:32:18,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:32:18,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:32:18,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:32:18,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:32:18,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:32:18,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:32:18,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:32:18,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:32:18,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:32:18,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:32:18,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:32:18,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:32:18,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:32:18,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:32:18,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:32:18,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:32:18,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:32:18,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:32:18,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:32:18,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:32:18,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:32:18,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:32:18,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:32:18,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:32:18,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:32:18,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:32:18,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:32:18,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:32:18,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:32:18,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:32:18,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:32:18,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:32:18,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:32:18,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:32:18,826 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:32:18,849 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:32:18,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:32:18,850 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:32:18,851 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:32:18,851 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:32:18,851 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:32:18,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:32:18,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:32:18,852 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:32:18,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:32:18,853 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:32:18,853 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:32:18,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:32:18,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:32:18,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:32:18,853 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:32:18,853 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:32:18,854 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:32:18,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:32:18,854 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:32:18,854 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:32:18,854 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:32:18,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:32:18,854 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:32:18,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:32:18,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:32:18,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:32:18,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:32:18,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:32:18,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:32:18,855 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:32:18,856 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:32:18,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:32:18,856 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:32:18,856 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 -> 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 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:32:19,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:32:19,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:32:19,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:32:19,079 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:32:19,079 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:32:19,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2023-08-29 20:32:19,987 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:32:20,186 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:32:20,189 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2023-08-29 20:32:20,203 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84aa7d570/4dab4510fdd54eaa90a9d4ada0c2d712/FLAG5d8f12f84 [2023-08-29 20:32:20,222 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84aa7d570/4dab4510fdd54eaa90a9d4ada0c2d712 [2023-08-29 20:32:20,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:32:20,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:32:20,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:32:20,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:32:20,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:32:20,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:32:20" (1/1) ... [2023-08-29 20:32:20,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645e66b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:20, skipping insertion in model container [2023-08-29 20:32:20,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:32:20" (1/1) ... [2023-08-29 20:32:20,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:32:20,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:32:20,398 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/rfi006_power.oepc.i[994,1007] [2023-08-29 20:32:20,555 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:32:20,565 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:32:20,573 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/rfi006_power.oepc.i[994,1007] [2023-08-29 20:32:20,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:32:20,650 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:32:20,650 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:32:20,654 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:32:20,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:20 WrapperNode [2023-08-29 20:32:20,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:32:20,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:32:20,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:32:20,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:32:20,660 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:32:20" (1/1) ... [2023-08-29 20:32:20,681 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:32:20" (1/1) ... [2023-08-29 20:32:20,697 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2023-08-29 20:32:20,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:32:20,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:32:20,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:32:20,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:32:20,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:20" (1/1) ... [2023-08-29 20:32:20,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:20" (1/1) ... [2023-08-29 20:32:20,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:20" (1/1) ... [2023-08-29 20:32:20,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:20" (1/1) ... [2023-08-29 20:32:20,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:20" (1/1) ... [2023-08-29 20:32:20,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:20" (1/1) ... [2023-08-29 20:32:20,724 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:20" (1/1) ... [2023-08-29 20:32:20,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:20" (1/1) ... [2023-08-29 20:32:20,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:32:20,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:32:20,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:32:20,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:32:20,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:20" (1/1) ... [2023-08-29 20:32:20,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:32:20,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:32:20,810 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:32:20,819 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:32:20,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 20:32:20,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:32:20,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:32:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:32:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:32:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:32:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:32:20,841 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:32:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:32:20,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:32:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:32:20,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:32:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:32:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:32:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:32:20,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:32:20,843 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:32:20,975 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:32:20,976 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:32:21,381 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:32:21,763 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:32:21,763 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:32:21,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:32:21 BoogieIcfgContainer [2023-08-29 20:32:21,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:32:21,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:32:21,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:32:21,768 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:32:21,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:32:20" (1/3) ... [2023-08-29 20:32:21,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356ac20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:32:21, skipping insertion in model container [2023-08-29 20:32:21,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:20" (2/3) ... [2023-08-29 20:32:21,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356ac20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:32:21, skipping insertion in model container [2023-08-29 20:32:21,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:32:21" (3/3) ... [2023-08-29 20:32:21,771 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.oepc.i [2023-08-29 20:32:21,783 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:32:21,783 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-08-29 20:32:21,783 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:32:21,880 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:32:21,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 174 transitions, 363 flow [2023-08-29 20:32:21,993 INFO L130 PetriNetUnfolder]: 2/171 cut-off events. [2023-08-29 20:32:21,993 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:21,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 171 events. 2/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 279 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2023-08-29 20:32:21,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 174 transitions, 363 flow [2023-08-29 20:32:22,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 171 transitions, 351 flow [2023-08-29 20:32:22,007 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:32:22,015 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 171 transitions, 351 flow [2023-08-29 20:32:22,018 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 171 transitions, 351 flow [2023-08-29 20:32:22,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 171 transitions, 351 flow [2023-08-29 20:32:22,060 INFO L130 PetriNetUnfolder]: 2/171 cut-off events. [2023-08-29 20:32:22,060 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:22,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 171 events. 2/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 283 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2023-08-29 20:32:22,064 INFO L119 LiptonReduction]: Number of co-enabled transitions 6982 [2023-08-29 20:32:30,581 INFO L134 LiptonReduction]: Checked pairs total: 32691 [2023-08-29 20:32:30,581 INFO L136 LiptonReduction]: Total number of compositions: 147 [2023-08-29 20:32:30,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:32:30,594 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;@582f36bd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:32:30,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-08-29 20:32:30,595 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:32:30,595 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:30,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:30,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:32:30,596 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:30,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:30,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1064, now seen corresponding path program 1 times [2023-08-29 20:32:30,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:30,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968650269] [2023-08-29 20:32:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:30,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:32:30,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:30,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968650269] [2023-08-29 20:32:30,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968650269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:30,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:30,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:32:30,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740425524] [2023-08-29 20:32:30,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:30,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:32:30,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:30,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:32:30,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:32:30,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 321 [2023-08-29 20:32:30,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:30,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:30,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 321 [2023-08-29 20:32:30,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:32,598 INFO L130 PetriNetUnfolder]: 11260/15872 cut-off events. [2023-08-29 20:32:32,598 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:32:32,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31815 conditions, 15872 events. 11260/15872 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 99824 event pairs, 11260 based on Foata normal form. 0/7394 useless extension candidates. Maximal degree in co-relation 31804. Up to 15867 conditions per place. [2023-08-29 20:32:32,667 INFO L137 encePairwiseOnDemand]: 291/321 looper letters, 40 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-08-29 20:32:32,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 173 flow [2023-08-29 20:32:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:32:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:32:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 320 transitions. [2023-08-29 20:32:32,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984423676012461 [2023-08-29 20:32:32,676 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 320 transitions. [2023-08-29 20:32:32,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 320 transitions. [2023-08-29 20:32:32,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:32,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 320 transitions. [2023-08-29 20:32:32,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 160.0) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:32,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:32,683 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:32,684 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 153 flow. Second operand 2 states and 320 transitions. [2023-08-29 20:32:32,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 173 flow [2023-08-29 20:32:32,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:32:32,688 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2023-08-29 20:32:32,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-29 20:32:32,691 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -32 predicate places. [2023-08-29 20:32:32,692 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2023-08-29 20:32:32,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:32,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:32,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:32:32,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:32:32,693 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:32,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:32,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1048916, now seen corresponding path program 1 times [2023-08-29 20:32:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:32,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730611771] [2023-08-29 20:32:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:32,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:32,817 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:32:32,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:32,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730611771] [2023-08-29 20:32:32,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730611771] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:32,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:32,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:32:32,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367195047] [2023-08-29 20:32:32,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:32,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:32:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:32,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:32:32,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:32:32,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-29 20:32:32,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:32,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:32,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-29 20:32:32,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:34,160 INFO L130 PetriNetUnfolder]: 7440/11018 cut-off events. [2023-08-29 20:32:34,161 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:34,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22004 conditions, 11018 events. 7440/11018 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 70943 event pairs, 4668 based on Foata normal form. 0/6424 useless extension candidates. Maximal degree in co-relation 22001. Up to 6813 conditions per place. [2023-08-29 20:32:34,195 INFO L137 encePairwiseOnDemand]: 305/321 looper letters, 45 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2023-08-29 20:32:34,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 226 flow [2023-08-29 20:32:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:32:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:32:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-29 20:32:34,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43406022845275183 [2023-08-29 20:32:34,200 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-29 20:32:34,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-29 20:32:34,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:34,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-29 20:32:34,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:34,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:34,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:34,206 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 418 transitions. [2023-08-29 20:32:34,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 226 flow [2023-08-29 20:32:34,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:32:34,208 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 160 flow [2023-08-29 20:32:34,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-08-29 20:32:34,208 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -30 predicate places. [2023-08-29 20:32:34,209 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 160 flow [2023-08-29 20:32:34,209 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:32:34,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:34,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:32:34,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:32:34,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:34,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:34,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1048917, now seen corresponding path program 1 times [2023-08-29 20:32:34,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:34,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62688550] [2023-08-29 20:32:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:34,323 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:32:34,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:34,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62688550] [2023-08-29 20:32:34,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62688550] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:34,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:34,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:32:34,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936093523] [2023-08-29 20:32:34,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:34,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:32:34,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:34,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:32:34,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:32:34,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 321 [2023-08-29 20:32:34,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 160 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:32:34,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:34,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 321 [2023-08-29 20:32:34,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:34,853 INFO L130 PetriNetUnfolder]: 2598/4056 cut-off events. [2023-08-29 20:32:34,854 INFO L131 PetriNetUnfolder]: For 1134/1134 co-relation queries the response was YES. [2023-08-29 20:32:34,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11323 conditions, 4056 events. 2598/4056 cut-off events. For 1134/1134 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 23863 event pairs, 1942 based on Foata normal form. 1105/4677 useless extension candidates. Maximal degree in co-relation 11318. Up to 4004 conditions per place. [2023-08-29 20:32:34,868 INFO L137 encePairwiseOnDemand]: 313/321 looper letters, 37 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-29 20:32:34,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 222 flow [2023-08-29 20:32:34,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:32:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:32:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-29 20:32:34,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226375908618899 [2023-08-29 20:32:34,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-29 20:32:34,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-29 20:32:34,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:34,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-29 20:32:34,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:34,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:34,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:34,873 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 160 flow. Second operand 3 states and 407 transitions. [2023-08-29 20:32:34,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 222 flow [2023-08-29 20:32:34,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:34,880 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 130 flow [2023-08-29 20:32:34,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=130, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-29 20:32:34,881 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -37 predicate places. [2023-08-29 20:32:34,881 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 130 flow [2023-08-29 20:32:34,881 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:32:34,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:34,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:34,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:32:34,882 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:34,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:34,882 INFO L85 PathProgramCache]: Analyzing trace with hash -969735936, now seen corresponding path program 1 times [2023-08-29 20:32:34,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:34,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75799913] [2023-08-29 20:32:34,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:34,977 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:32:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75799913] [2023-08-29 20:32:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75799913] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:34,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:34,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:32:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330036953] [2023-08-29 20:32:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:34,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:32:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:34,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:32:34,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:32:34,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 321 [2023-08-29 20:32:34,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:34,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:34,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 321 [2023-08-29 20:32:34,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:35,472 INFO L130 PetriNetUnfolder]: 2518/4128 cut-off events. [2023-08-29 20:32:35,472 INFO L131 PetriNetUnfolder]: For 478/481 co-relation queries the response was YES. [2023-08-29 20:32:35,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10419 conditions, 4128 events. 2518/4128 cut-off events. For 478/481 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 26449 event pairs, 910 based on Foata normal form. 0/3267 useless extension candidates. Maximal degree in co-relation 10414. Up to 2515 conditions per place. [2023-08-29 20:32:35,485 INFO L137 encePairwiseOnDemand]: 317/321 looper letters, 65 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-08-29 20:32:35,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 364 flow [2023-08-29 20:32:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:32:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:32:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-29 20:32:35,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4454828660436137 [2023-08-29 20:32:35,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-29 20:32:35,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-29 20:32:35,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:35,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-29 20:32:35,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:35,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:35,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:35,490 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 130 flow. Second operand 3 states and 429 transitions. [2023-08-29 20:32:35,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 364 flow [2023-08-29 20:32:35,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:32:35,492 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 142 flow [2023-08-29 20:32:35,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-29 20:32:35,492 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -35 predicate places. [2023-08-29 20:32:35,493 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 142 flow [2023-08-29 20:32:35,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:35,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:35,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:35,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:32:35,493 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:35,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:35,494 INFO L85 PathProgramCache]: Analyzing trace with hash -969735733, now seen corresponding path program 1 times [2023-08-29 20:32:35,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:35,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884170915] [2023-08-29 20:32:35,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:35,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:35,697 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:32:35,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:35,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884170915] [2023-08-29 20:32:35,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884170915] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:35,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:35,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:32:35,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626487712] [2023-08-29 20:32:35,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:35,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:32:35,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:35,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:32:35,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:32:35,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 321 [2023-08-29 20:32:35,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:35,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:35,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 321 [2023-08-29 20:32:35,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:36,323 INFO L130 PetriNetUnfolder]: 3386/5507 cut-off events. [2023-08-29 20:32:36,323 INFO L131 PetriNetUnfolder]: For 1675/1675 co-relation queries the response was YES. [2023-08-29 20:32:36,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14348 conditions, 5507 events. 3386/5507 cut-off events. For 1675/1675 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 34873 event pairs, 743 based on Foata normal form. 0/4637 useless extension candidates. Maximal degree in co-relation 14342. Up to 4784 conditions per place. [2023-08-29 20:32:36,343 INFO L137 encePairwiseOnDemand]: 317/321 looper letters, 67 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-08-29 20:32:36,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 392 flow [2023-08-29 20:32:36,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:32:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:32:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-29 20:32:36,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4402907580477674 [2023-08-29 20:32:36,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-29 20:32:36,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-29 20:32:36,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:36,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-29 20:32:36,347 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:32:36,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:36,349 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:36,349 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 142 flow. Second operand 3 states and 424 transitions. [2023-08-29 20:32:36,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 392 flow [2023-08-29 20:32:36,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:36,351 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 155 flow [2023-08-29 20:32:36,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2023-08-29 20:32:36,351 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -34 predicate places. [2023-08-29 20:32:36,351 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 155 flow [2023-08-29 20:32:36,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:36,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:36,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:36,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:32:36,352 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:36,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:36,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1407984746, now seen corresponding path program 1 times [2023-08-29 20:32:36,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:36,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974290603] [2023-08-29 20:32:36,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:36,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:36,852 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:32:36,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:36,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974290603] [2023-08-29 20:32:36,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974290603] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:36,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:36,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:32:36,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423568443] [2023-08-29 20:32:36,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:36,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:32:36,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:36,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:32:36,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:32:36,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 321 [2023-08-29 20:32:36,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 155 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:36,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:36,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 321 [2023-08-29 20:32:36,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:37,862 INFO L130 PetriNetUnfolder]: 3594/5864 cut-off events. [2023-08-29 20:32:37,862 INFO L131 PetriNetUnfolder]: For 1309/1314 co-relation queries the response was YES. [2023-08-29 20:32:37,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16024 conditions, 5864 events. 3594/5864 cut-off events. For 1309/1314 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 38517 event pairs, 1266 based on Foata normal form. 88/5018 useless extension candidates. Maximal degree in co-relation 16017. Up to 2025 conditions per place. [2023-08-29 20:32:37,888 INFO L137 encePairwiseOnDemand]: 312/321 looper letters, 87 selfloop transitions, 9 changer transitions 0/99 dead transitions. [2023-08-29 20:32:37,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 99 transitions, 536 flow [2023-08-29 20:32:37,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:32:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:32:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions. [2023-08-29 20:32:37,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3987538940809969 [2023-08-29 20:32:37,891 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 768 transitions. [2023-08-29 20:32:37,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions. [2023-08-29 20:32:37,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:37,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions. [2023-08-29 20:32:37,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:37,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:37,896 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:37,896 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 155 flow. Second operand 6 states and 768 transitions. [2023-08-29 20:32:37,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 99 transitions, 536 flow [2023-08-29 20:32:37,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 99 transitions, 527 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:37,898 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 198 flow [2023-08-29 20:32:37,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-29 20:32:37,899 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -32 predicate places. [2023-08-29 20:32:37,899 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 198 flow [2023-08-29 20:32:37,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:37,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:37,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:37,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:32:37,900 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:37,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:37,901 INFO L85 PathProgramCache]: Analyzing trace with hash 942183236, now seen corresponding path program 1 times [2023-08-29 20:32:37,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:37,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800970910] [2023-08-29 20:32:37,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:37,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:38,023 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:32:38,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:38,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800970910] [2023-08-29 20:32:38,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800970910] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:38,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:38,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:32:38,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103829416] [2023-08-29 20:32:38,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:38,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:32:38,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:38,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:32:38,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:32:38,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 321 [2023-08-29 20:32:38,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 198 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:32:38,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:38,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 321 [2023-08-29 20:32:38,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:38,701 INFO L130 PetriNetUnfolder]: 4399/6942 cut-off events. [2023-08-29 20:32:38,701 INFO L131 PetriNetUnfolder]: For 3878/3878 co-relation queries the response was YES. [2023-08-29 20:32:38,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19865 conditions, 6942 events. 4399/6942 cut-off events. For 3878/3878 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 43687 event pairs, 1235 based on Foata normal form. 44/6054 useless extension candidates. Maximal degree in co-relation 19858. Up to 4904 conditions per place. [2023-08-29 20:32:38,725 INFO L137 encePairwiseOnDemand]: 318/321 looper letters, 72 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-08-29 20:32:38,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 480 flow [2023-08-29 20:32:38,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:32:38,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:32:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-29 20:32:38,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43509865005192105 [2023-08-29 20:32:38,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-29 20:32:38,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-29 20:32:38,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:38,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-29 20:32:38,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:38,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:38,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:38,730 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 198 flow. Second operand 3 states and 419 transitions. [2023-08-29 20:32:38,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 480 flow [2023-08-29 20:32:38,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:32:38,764 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 205 flow [2023-08-29 20:32:38,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-08-29 20:32:38,764 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -30 predicate places. [2023-08-29 20:32:38,765 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 205 flow [2023-08-29 20:32:38,765 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:32:38,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:38,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:38,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:32:38,765 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:38,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:38,766 INFO L85 PathProgramCache]: Analyzing trace with hash -857094764, now seen corresponding path program 1 times [2023-08-29 20:32:38,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:38,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746790554] [2023-08-29 20:32:38,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:38,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:38,904 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:32:38,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:38,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746790554] [2023-08-29 20:32:38,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746790554] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:38,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:38,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:32:38,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114714235] [2023-08-29 20:32:38,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:38,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:32:38,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:38,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:32:38,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:32:38,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 321 [2023-08-29 20:32:38,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:38,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:38,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 321 [2023-08-29 20:32:38,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:39,477 INFO L130 PetriNetUnfolder]: 3540/5784 cut-off events. [2023-08-29 20:32:39,477 INFO L131 PetriNetUnfolder]: For 3099/3104 co-relation queries the response was YES. [2023-08-29 20:32:39,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16787 conditions, 5784 events. 3540/5784 cut-off events. For 3099/3104 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 37951 event pairs, 1789 based on Foata normal form. 12/5003 useless extension candidates. Maximal degree in co-relation 16779. Up to 4162 conditions per place. [2023-08-29 20:32:39,497 INFO L137 encePairwiseOnDemand]: 318/321 looper letters, 67 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2023-08-29 20:32:39,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 443 flow [2023-08-29 20:32:39,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:32:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:32:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-29 20:32:39,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-29 20:32:39,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-29 20:32:39,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-29 20:32:39,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:39,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-29 20:32:39,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:39,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:39,502 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:39,502 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 205 flow. Second operand 3 states and 428 transitions. [2023-08-29 20:32:39,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 443 flow [2023-08-29 20:32:39,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:39,528 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 212 flow [2023-08-29 20:32:39,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=212, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-08-29 20:32:39,529 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -29 predicate places. [2023-08-29 20:32:39,529 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 212 flow [2023-08-29 20:32:39,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:39,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:39,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:39,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:32:39,529 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:39,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:39,530 INFO L85 PathProgramCache]: Analyzing trace with hash 91853000, now seen corresponding path program 1 times [2023-08-29 20:32:39,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:39,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299556927] [2023-08-29 20:32:39,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:39,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:32:39,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:39,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299556927] [2023-08-29 20:32:39,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299556927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:39,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:39,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:32:39,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673245318] [2023-08-29 20:32:39,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:39,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:32:39,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:39,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:32:39,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:32:39,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 321 [2023-08-29 20:32:39,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 212 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:32:39,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:39,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 321 [2023-08-29 20:32:39,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:40,222 INFO L130 PetriNetUnfolder]: 3199/5157 cut-off events. [2023-08-29 20:32:40,222 INFO L131 PetriNetUnfolder]: For 3827/3827 co-relation queries the response was YES. [2023-08-29 20:32:40,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15482 conditions, 5157 events. 3199/5157 cut-off events. For 3827/3827 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 31988 event pairs, 1499 based on Foata normal form. 16/4472 useless extension candidates. Maximal degree in co-relation 15473. Up to 1967 conditions per place. [2023-08-29 20:32:40,241 INFO L137 encePairwiseOnDemand]: 308/321 looper letters, 49 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2023-08-29 20:32:40,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 406 flow [2023-08-29 20:32:40,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:32:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:32:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-29 20:32:40,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3987538940809969 [2023-08-29 20:32:40,243 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-29 20:32:40,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-29 20:32:40,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:40,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-29 20:32:40,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:40,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:40,246 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:40,246 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 212 flow. Second operand 4 states and 512 transitions. [2023-08-29 20:32:40,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 406 flow [2023-08-29 20:32:40,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:40,264 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 284 flow [2023-08-29 20:32:40,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2023-08-29 20:32:40,264 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -26 predicate places. [2023-08-29 20:32:40,265 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 284 flow [2023-08-29 20:32:40,265 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:32:40,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:40,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:40,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:32:40,265 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:40,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash -635683316, now seen corresponding path program 1 times [2023-08-29 20:32:40,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:40,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6651280] [2023-08-29 20:32:40,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:40,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:32:41,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:41,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6651280] [2023-08-29 20:32:41,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6651280] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:41,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:41,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:32:41,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954373168] [2023-08-29 20:32:41,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:41,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:32:41,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:41,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:32:41,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:32:41,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 321 [2023-08-29 20:32:41,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 284 flow. Second operand has 9 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:41,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:41,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 321 [2023-08-29 20:32:41,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:42,855 INFO L130 PetriNetUnfolder]: 3532/5677 cut-off events. [2023-08-29 20:32:42,855 INFO L131 PetriNetUnfolder]: For 5262/5267 co-relation queries the response was YES. [2023-08-29 20:32:42,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18873 conditions, 5677 events. 3532/5677 cut-off events. For 5262/5267 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 36096 event pairs, 809 based on Foata normal form. 36/5224 useless extension candidates. Maximal degree in co-relation 18863. Up to 4821 conditions per place. [2023-08-29 20:32:42,878 INFO L137 encePairwiseOnDemand]: 309/321 looper letters, 82 selfloop transitions, 26 changer transitions 0/111 dead transitions. [2023-08-29 20:32:42,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 111 transitions, 765 flow [2023-08-29 20:32:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:32:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:32:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1272 transitions. [2023-08-29 20:32:42,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602378929481733 [2023-08-29 20:32:42,881 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1272 transitions. [2023-08-29 20:32:42,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1272 transitions. [2023-08-29 20:32:42,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:42,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1272 transitions. [2023-08-29 20:32:42,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.63636363636364) internal successors, (1272), 11 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:42,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 321.0) internal successors, (3852), 12 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:42,887 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 321.0) internal successors, (3852), 12 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:42,887 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 284 flow. Second operand 11 states and 1272 transitions. [2023-08-29 20:32:42,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 111 transitions, 765 flow [2023-08-29 20:32:42,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 111 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:32:42,912 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 526 flow [2023-08-29 20:32:42,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=526, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2023-08-29 20:32:42,913 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -12 predicate places. [2023-08-29 20:32:42,913 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 526 flow [2023-08-29 20:32:42,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:42,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:42,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:42,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:32:42,914 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:42,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:42,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1658495372, now seen corresponding path program 2 times [2023-08-29 20:32:42,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:42,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114612227] [2023-08-29 20:32:42,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:42,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:43,960 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:32:43,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:43,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114612227] [2023-08-29 20:32:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114612227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:43,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:43,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:32:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431806272] [2023-08-29 20:32:43,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:43,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:32:43,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:32:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:32:44,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 321 [2023-08-29 20:32:44,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 526 flow. Second operand has 8 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:44,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:44,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 321 [2023-08-29 20:32:44,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:45,034 INFO L130 PetriNetUnfolder]: 3522/5657 cut-off events. [2023-08-29 20:32:45,034 INFO L131 PetriNetUnfolder]: For 7314/7317 co-relation queries the response was YES. [2023-08-29 20:32:45,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20908 conditions, 5657 events. 3522/5657 cut-off events. For 7314/7317 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 35997 event pairs, 565 based on Foata normal form. 9/5177 useless extension candidates. Maximal degree in co-relation 20892. Up to 4173 conditions per place. [2023-08-29 20:32:45,056 INFO L137 encePairwiseOnDemand]: 311/321 looper letters, 99 selfloop transitions, 50 changer transitions 0/152 dead transitions. [2023-08-29 20:32:45,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 152 transitions, 1287 flow [2023-08-29 20:32:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:32:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:32:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1269 transitions. [2023-08-29 20:32:45,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35938827527612577 [2023-08-29 20:32:45,059 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1269 transitions. [2023-08-29 20:32:45,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1269 transitions. [2023-08-29 20:32:45,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:45,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1269 transitions. [2023-08-29 20:32:45,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.36363636363636) internal successors, (1269), 11 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:45,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 321.0) internal successors, (3852), 12 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:45,065 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 321.0) internal successors, (3852), 12 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:45,065 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 526 flow. Second operand 11 states and 1269 transitions. [2023-08-29 20:32:45,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 152 transitions, 1287 flow [2023-08-29 20:32:45,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 152 transitions, 1283 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-29 20:32:45,112 INFO L231 Difference]: Finished difference. Result has 85 places, 99 transitions, 941 flow [2023-08-29 20:32:45,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=941, PETRI_PLACES=85, PETRI_TRANSITIONS=99} [2023-08-29 20:32:45,112 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 3 predicate places. [2023-08-29 20:32:45,113 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 99 transitions, 941 flow [2023-08-29 20:32:45,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:45,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:45,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:45,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:32:45,113 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:45,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1923578745, now seen corresponding path program 1 times [2023-08-29 20:32:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:45,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390240622] [2023-08-29 20:32:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:45,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:45,392 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:32:45,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:45,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390240622] [2023-08-29 20:32:45,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390240622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:45,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:45,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:32:45,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681045688] [2023-08-29 20:32:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:45,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:32:45,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:45,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:32:45,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:32:45,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 321 [2023-08-29 20:32:45,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 99 transitions, 941 flow. Second operand has 8 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:45,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:45,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 321 [2023-08-29 20:32:45,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:46,271 INFO L130 PetriNetUnfolder]: 2734/4445 cut-off events. [2023-08-29 20:32:46,271 INFO L131 PetriNetUnfolder]: For 10439/10439 co-relation queries the response was YES. [2023-08-29 20:32:46,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17659 conditions, 4445 events. 2734/4445 cut-off events. For 10439/10439 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 27117 event pairs, 424 based on Foata normal form. 0/4397 useless extension candidates. Maximal degree in co-relation 17637. Up to 1617 conditions per place. [2023-08-29 20:32:46,291 INFO L137 encePairwiseOnDemand]: 314/321 looper letters, 101 selfloop transitions, 26 changer transitions 0/130 dead transitions. [2023-08-29 20:32:46,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 130 transitions, 1287 flow [2023-08-29 20:32:46,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:32:46,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:32:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2023-08-29 20:32:46,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3684913217623498 [2023-08-29 20:32:46,293 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2023-08-29 20:32:46,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2023-08-29 20:32:46,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:46,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2023-08-29 20:32:46,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:46,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:46,297 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:46,297 INFO L175 Difference]: Start difference. First operand has 85 places, 99 transitions, 941 flow. Second operand 7 states and 828 transitions. [2023-08-29 20:32:46,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 130 transitions, 1287 flow [2023-08-29 20:32:46,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 130 transitions, 1273 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-29 20:32:46,347 INFO L231 Difference]: Finished difference. Result has 87 places, 88 transitions, 844 flow [2023-08-29 20:32:46,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=844, PETRI_PLACES=87, PETRI_TRANSITIONS=88} [2023-08-29 20:32:46,348 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places. [2023-08-29 20:32:46,348 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 88 transitions, 844 flow [2023-08-29 20:32:46,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:46,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:46,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:46,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:32:46,349 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:46,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:46,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1447524274, now seen corresponding path program 1 times [2023-08-29 20:32:46,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:46,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242629936] [2023-08-29 20:32:46,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:46,466 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:32:46,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:46,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242629936] [2023-08-29 20:32:46,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242629936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:46,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:46,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:32:46,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274416408] [2023-08-29 20:32:46,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:46,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:32:46,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:46,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:32:46,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:32:46,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 321 [2023-08-29 20:32:46,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 88 transitions, 844 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:32:46,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:46,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 321 [2023-08-29 20:32:46,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:47,114 INFO L130 PetriNetUnfolder]: 2304/3759 cut-off events. [2023-08-29 20:32:47,114 INFO L131 PetriNetUnfolder]: For 9535/9538 co-relation queries the response was YES. [2023-08-29 20:32:47,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14850 conditions, 3759 events. 2304/3759 cut-off events. For 9535/9538 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 22107 event pairs, 1055 based on Foata normal form. 76/3803 useless extension candidates. Maximal degree in co-relation 14828. Up to 2135 conditions per place. [2023-08-29 20:32:47,130 INFO L137 encePairwiseOnDemand]: 308/321 looper letters, 88 selfloop transitions, 26 changer transitions 0/117 dead transitions. [2023-08-29 20:32:47,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 117 transitions, 1229 flow [2023-08-29 20:32:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:32:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:32:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 731 transitions. [2023-08-29 20:32:47,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37954309449636553 [2023-08-29 20:32:47,146 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 731 transitions. [2023-08-29 20:32:47,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 731 transitions. [2023-08-29 20:32:47,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:47,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 731 transitions. [2023-08-29 20:32:47,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:47,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:47,149 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:47,149 INFO L175 Difference]: Start difference. First operand has 87 places, 88 transitions, 844 flow. Second operand 6 states and 731 transitions. [2023-08-29 20:32:47,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 117 transitions, 1229 flow [2023-08-29 20:32:47,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 117 transitions, 1175 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-08-29 20:32:47,183 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 924 flow [2023-08-29 20:32:47,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=924, PETRI_PLACES=88, PETRI_TRANSITIONS=91} [2023-08-29 20:32:47,183 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 6 predicate places. [2023-08-29 20:32:47,183 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 924 flow [2023-08-29 20:32:47,184 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:32:47,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:47,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:47,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:32:47,184 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:47,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash 467013533, now seen corresponding path program 1 times [2023-08-29 20:32:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110327025] [2023-08-29 20:32:47,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:47,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:47,339 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:32:47,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:47,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110327025] [2023-08-29 20:32:47,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110327025] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:47,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:47,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:32:47,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858222526] [2023-08-29 20:32:47,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:47,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:32:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:47,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:32:47,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:32:47,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 321 [2023-08-29 20:32:47,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 924 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:47,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:47,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 321 [2023-08-29 20:32:47,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:47,607 INFO L130 PetriNetUnfolder]: 1058/1904 cut-off events. [2023-08-29 20:32:47,608 INFO L131 PetriNetUnfolder]: For 5104/5104 co-relation queries the response was YES. [2023-08-29 20:32:47,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7664 conditions, 1904 events. 1058/1904 cut-off events. For 5104/5104 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10819 event pairs, 222 based on Foata normal form. 44/1934 useless extension candidates. Maximal degree in co-relation 7641. Up to 1663 conditions per place. [2023-08-29 20:32:47,616 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 100 selfloop transitions, 4 changer transitions 4/111 dead transitions. [2023-08-29 20:32:47,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 111 transitions, 1248 flow [2023-08-29 20:32:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:32:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:32:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-29 20:32:47,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4215991692627207 [2023-08-29 20:32:47,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-29 20:32:47,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-29 20:32:47,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:47,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-29 20:32:47,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:47,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:47,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:47,620 INFO L175 Difference]: Start difference. First operand has 88 places, 91 transitions, 924 flow. Second operand 3 states and 406 transitions. [2023-08-29 20:32:47,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 111 transitions, 1248 flow [2023-08-29 20:32:47,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 111 transitions, 1215 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-29 20:32:47,638 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 821 flow [2023-08-29 20:32:47,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2023-08-29 20:32:47,639 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 6 predicate places. [2023-08-29 20:32:47,639 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 821 flow [2023-08-29 20:32:47,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:47,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:47,640 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:32:47,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:32:47,640 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:47,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:47,640 INFO L85 PathProgramCache]: Analyzing trace with hash -246200974, now seen corresponding path program 1 times [2023-08-29 20:32:47,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:47,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265543990] [2023-08-29 20:32:47,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:47,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:47,792 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:32:47,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:47,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265543990] [2023-08-29 20:32:47,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265543990] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:47,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:47,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:32:47,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998417431] [2023-08-29 20:32:47,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:47,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:32:47,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:47,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:32:47,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:32:47,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 321 [2023-08-29 20:32:47,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 821 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:47,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:47,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 321 [2023-08-29 20:32:47,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:47,948 INFO L130 PetriNetUnfolder]: 363/739 cut-off events. [2023-08-29 20:32:47,948 INFO L131 PetriNetUnfolder]: For 1656/1656 co-relation queries the response was YES. [2023-08-29 20:32:47,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 739 events. 363/739 cut-off events. For 1656/1656 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3731 event pairs, 76 based on Foata normal form. 51/784 useless extension candidates. Maximal degree in co-relation 2969. Up to 308 conditions per place. [2023-08-29 20:32:47,952 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 85 selfloop transitions, 7 changer transitions 9/104 dead transitions. [2023-08-29 20:32:47,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 104 transitions, 1039 flow [2023-08-29 20:32:47,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:32:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:32:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-08-29 20:32:47,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4190031152647975 [2023-08-29 20:32:47,953 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-08-29 20:32:47,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-08-29 20:32:47,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:47,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-08-29 20:32:47,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:47,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:47,956 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:47,956 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 821 flow. Second operand 4 states and 538 transitions. [2023-08-29 20:32:47,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 104 transitions, 1039 flow [2023-08-29 20:32:47,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 994 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-29 20:32:47,961 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 526 flow [2023-08-29 20:32:47,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=526, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2023-08-29 20:32:47,961 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 0 predicate places. [2023-08-29 20:32:47,961 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 526 flow [2023-08-29 20:32:47,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:47,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:47,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:47,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:32:47,962 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:47,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1970222810, now seen corresponding path program 1 times [2023-08-29 20:32:47,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:47,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785825629] [2023-08-29 20:32:47,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:48,164 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:32:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785825629] [2023-08-29 20:32:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785825629] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:48,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:48,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:32:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71248772] [2023-08-29 20:32:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:48,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:32:48,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:48,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:32:48,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:32:48,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 321 [2023-08-29 20:32:48,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 526 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:48,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:48,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 321 [2023-08-29 20:32:48,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:48,287 INFO L130 PetriNetUnfolder]: 262/515 cut-off events. [2023-08-29 20:32:48,287 INFO L131 PetriNetUnfolder]: For 1500/1500 co-relation queries the response was YES. [2023-08-29 20:32:48,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2097 conditions, 515 events. 262/515 cut-off events. For 1500/1500 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2533 event pairs, 65 based on Foata normal form. 18/528 useless extension candidates. Maximal degree in co-relation 2077. Up to 223 conditions per place. [2023-08-29 20:32:48,289 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 56 selfloop transitions, 10 changer transitions 5/74 dead transitions. [2023-08-29 20:32:48,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 74 transitions, 645 flow [2023-08-29 20:32:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:32:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:32:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-08-29 20:32:48,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074766355140187 [2023-08-29 20:32:48,291 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-08-29 20:32:48,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-08-29 20:32:48,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:48,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-08-29 20:32:48,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:48,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:48,294 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:48,294 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 526 flow. Second operand 5 states and 654 transitions. [2023-08-29 20:32:48,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 74 transitions, 645 flow [2023-08-29 20:32:48,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 530 flow, removed 18 selfloop flow, removed 15 redundant places. [2023-08-29 20:32:48,296 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 234 flow [2023-08-29 20:32:48,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2023-08-29 20:32:48,296 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -21 predicate places. [2023-08-29 20:32:48,297 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 234 flow [2023-08-29 20:32:48,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:48,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:48,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:48,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:32:48,297 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:32:48,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:48,297 INFO L85 PathProgramCache]: Analyzing trace with hash 728168337, now seen corresponding path program 1 times [2023-08-29 20:32:48,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:48,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298881186] [2023-08-29 20:32:48,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:48,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:32:48,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:32:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:32:48,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:32:48,423 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:32:48,423 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2023-08-29 20:32:48,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2023-08-29 20:32:48,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2023-08-29 20:32:48,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2023-08-29 20:32:48,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2023-08-29 20:32:48,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2023-08-29 20:32:48,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2023-08-29 20:32:48,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2023-08-29 20:32:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2023-08-29 20:32:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2023-08-29 20:32:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2023-08-29 20:32:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2023-08-29 20:32:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2023-08-29 20:32:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2023-08-29 20:32:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2023-08-29 20:32:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2023-08-29 20:32:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2023-08-29 20:32:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2023-08-29 20:32:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2023-08-29 20:32:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2023-08-29 20:32:48,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2023-08-29 20:32:48,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2023-08-29 20:32:48,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2023-08-29 20:32:48,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2023-08-29 20:32:48,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2023-08-29 20:32:48,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2023-08-29 20:32:48,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2023-08-29 20:32:48,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2023-08-29 20:32:48,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2023-08-29 20:32:48,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2023-08-29 20:32:48,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2023-08-29 20:32:48,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2023-08-29 20:32:48,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2023-08-29 20:32:48,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2023-08-29 20:32:48,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2023-08-29 20:32:48,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2023-08-29 20:32:48,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2023-08-29 20:32:48,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2023-08-29 20:32:48,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2023-08-29 20:32:48,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2023-08-29 20:32:48,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2023-08-29 20:32:48,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2023-08-29 20:32:48,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2023-08-29 20:32:48,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2023-08-29 20:32:48,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2023-08-29 20:32:48,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2023-08-29 20:32:48,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2023-08-29 20:32:48,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2023-08-29 20:32:48,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2023-08-29 20:32:48,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:32:48,431 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:48,435 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:32:48,435 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:32:48,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:32:48 BasicIcfg [2023-08-29 20:32:48,476 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:32:48,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:32:48,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:32:48,477 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:32:48,477 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:32:21" (3/4) ... [2023-08-29 20:32:48,479 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:32:48,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:32:48,479 INFO L158 Benchmark]: Toolchain (without parser) took 28254.65ms. Allocated memory was 71.3MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 46.7MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-29 20:32:48,479 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:32:48,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.10ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 46.5MB in the beginning and 61.6MB in the end (delta: -15.1MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-08-29 20:32:48,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.32ms. Allocated memory is still 94.4MB. Free memory was 61.6MB in the beginning and 59.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:32:48,479 INFO L158 Benchmark]: Boogie Preprocessor took 29.21ms. Allocated memory is still 94.4MB. Free memory was 59.4MB in the beginning and 57.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:32:48,480 INFO L158 Benchmark]: RCFGBuilder took 1036.98ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 57.0MB in the beginning and 71.6MB in the end (delta: -14.6MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2023-08-29 20:32:48,480 INFO L158 Benchmark]: TraceAbstraction took 26710.10ms. Allocated memory was 113.2MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 70.8MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-29 20:32:48,480 INFO L158 Benchmark]: Witness Printer took 1.89ms. Allocated memory is still 2.6GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:32:48,481 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.10ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 46.5MB in the beginning and 61.6MB in the end (delta: -15.1MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.32ms. Allocated memory is still 94.4MB. Free memory was 61.6MB in the beginning and 59.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.21ms. Allocated memory is still 94.4MB. Free memory was 59.4MB in the beginning and 57.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1036.98ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 57.0MB in the beginning and 71.6MB in the end (delta: -14.6MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26710.10ms. Allocated memory was 113.2MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 70.8MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 1.89ms. Allocated memory is still 2.6GB. Free memory is still 1.2GB. 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: 8.6s, 179 PlacesBefore, 82 PlacesAfterwards, 171 TransitionsBefore, 72 TransitionsAfterwards, 6982 CoEnabledTransitionPairs, 7 FixpointIterations, 68 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 147 TotalNumberOfCompositions, 32691 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8981, independent: 8422, independent conditional: 0, independent unconditional: 8422, dependent: 559, dependent conditional: 0, dependent unconditional: 559, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2796, independent: 2704, independent conditional: 0, independent unconditional: 2704, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8981, independent: 5718, independent conditional: 0, independent unconditional: 5718, dependent: 467, dependent conditional: 0, dependent unconditional: 467, unknown: 2796, unknown conditional: 0, unknown unconditional: 2796] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 382, Positive conditional cache size: 0, Positive unconditional cache size: 382, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, 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_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1681; [L849] FCALL, FORK 0 pthread_create(&t1681, ((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_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1681, ((void *)0), P0, ((void *)0))=-2, t1681={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$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_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L850] 0 pthread_t t1682; 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_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1681={6:0}, t1682={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] FCALL, FORK 0 pthread_create(&t1682, ((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_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1682, ((void *)0), P1, ((void *)0))=-1, t1681={6:0}, t1682={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L780] 1 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=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L792] 2 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=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] 2 __unbuffered_p1_EAX = y 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$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=2, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L852] 0 pthread_t t1683; [L853] FCALL, FORK 0 pthread_create(&t1683, ((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=2, __unbuffered_p1_EBX=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(&t1683, ((void *)0), P2, ((void *)0))=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L823] 3 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=2, __unbuffered_p1_EBX=0, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$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=2, __unbuffered_p1_EBX=0, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$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=2, __unbuffered_p1_EBX=0, 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, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L870] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 232 locations, 85 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: 26.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1563 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1165 mSDsluCounter, 512 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 359 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3493 IncrementalHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 153 mSDtfsCounter, 3493 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=941occurred in iteration=11, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 2239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:32:48,497 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/rfi006_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 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 --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:32:50,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:32:50,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:32:50,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:32:50,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:32:50,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:32:50,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:32:50,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:32:50,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:32:50,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:32:50,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:32:50,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:32:50,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:32:50,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:32:50,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:32:50,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:32:50,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:32:50,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:32:50,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:32:50,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:32:50,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:32:50,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:32:50,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:32:50,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:32:50,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:32:50,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:32:50,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:32:50,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:32:50,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:32:50,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:32:50,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:32:50,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:32:50,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:32:50,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:32:50,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:32:50,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:32:50,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:32:50,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:32:50,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:32:50,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:32:50,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:32:50,189 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:32:50,203 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:32:50,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:32:50,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:32:50,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:32:50,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:32:50,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:32:50,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:32:50,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:32:50,205 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:32:50,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:32:50,205 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:32:50,205 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:32:50,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:32:50,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:32:50,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:32:50,205 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:32:50,205 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:32:50,206 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:32:50,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:32:50,206 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:32:50,206 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:32:50,206 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:32:50,206 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:32:50,206 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:32:50,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:32:50,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:32:50,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:32:50,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:32:50,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:32:50,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:32:50,207 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:32:50,207 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:32:50,207 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:32:50,207 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:32:50,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:32:50,208 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:32:50,208 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:32:50,208 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 -> 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 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:32:50,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:32:50,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:32:50,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:32:50,474 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:32:50,474 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:32:50,475 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2023-08-29 20:32:51,392 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:32:51,594 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:32:51,594 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2023-08-29 20:32:51,611 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c79726bd/b0bae935d9b447ca8caefccc2f7f0088/FLAGeefad53a6 [2023-08-29 20:32:51,620 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c79726bd/b0bae935d9b447ca8caefccc2f7f0088 [2023-08-29 20:32:51,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:32:51,622 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:32:51,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:32:51,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:32:51,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:32:51,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:32:51" (1/1) ... [2023-08-29 20:32:51,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34903c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:51, skipping insertion in model container [2023-08-29 20:32:51,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:32:51" (1/1) ... [2023-08-29 20:32:51,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:32:51,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:32:51,770 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/rfi006_power.oepc.i[994,1007] [2023-08-29 20:32:51,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:32:51,963 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:32:51,972 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/rfi006_power.oepc.i[994,1007] [2023-08-29 20:32:52,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:32:52,037 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:32:52,037 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:32:52,042 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:32:52,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:52 WrapperNode [2023-08-29 20:32:52,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:32:52,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:32:52,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:32:52,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:32:52,048 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:32:52" (1/1) ... [2023-08-29 20:32:52,075 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:32:52" (1/1) ... [2023-08-29 20:32:52,098 INFO L138 Inliner]: procedures = 180, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2023-08-29 20:32:52,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:32:52,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:32:52,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:32:52,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:32:52,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:52" (1/1) ... [2023-08-29 20:32:52,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:52" (1/1) ... [2023-08-29 20:32:52,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:52" (1/1) ... [2023-08-29 20:32:52,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:52" (1/1) ... [2023-08-29 20:32:52,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:52" (1/1) ... [2023-08-29 20:32:52,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:52" (1/1) ... [2023-08-29 20:32:52,146 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:52" (1/1) ... [2023-08-29 20:32:52,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:52" (1/1) ... [2023-08-29 20:32:52,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:32:52,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:32:52,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:32:52,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:32:52,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:52" (1/1) ... [2023-08-29 20:32:52,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:32:52,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:32:52,181 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:32:52,187 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:32:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 20:32:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:32:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:32:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:32:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:32:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:32:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:32:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-29 20:32:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:32:52,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:32:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:32:52,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:32:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:32:52,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:32:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:32:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:32:52,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:32:52,207 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:32:52,354 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:32:52,355 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:32:52,848 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:32:53,244 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:32:53,244 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:32:53,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:32:53 BoogieIcfgContainer [2023-08-29 20:32:53,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:32:53,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:32:53,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:32:53,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:32:53,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:32:51" (1/3) ... [2023-08-29 20:32:53,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12252456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:32:53, skipping insertion in model container [2023-08-29 20:32:53,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:52" (2/3) ... [2023-08-29 20:32:53,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12252456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:32:53, skipping insertion in model container [2023-08-29 20:32:53,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:32:53" (3/3) ... [2023-08-29 20:32:53,252 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.oepc.i [2023-08-29 20:32:53,263 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:32:53,264 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-08-29 20:32:53,264 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:32:53,356 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:32:53,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 175 transitions, 365 flow [2023-08-29 20:32:53,469 INFO L130 PetriNetUnfolder]: 2/172 cut-off events. [2023-08-29 20:32:53,469 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:53,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 172 events. 2/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 279 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2023-08-29 20:32:53,475 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 175 transitions, 365 flow [2023-08-29 20:32:53,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 172 transitions, 353 flow [2023-08-29 20:32:53,483 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:32:53,492 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 172 transitions, 353 flow [2023-08-29 20:32:53,495 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 172 transitions, 353 flow [2023-08-29 20:32:53,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 172 transitions, 353 flow [2023-08-29 20:32:53,531 INFO L130 PetriNetUnfolder]: 2/172 cut-off events. [2023-08-29 20:32:53,531 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:53,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 172 events. 2/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 281 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2023-08-29 20:32:53,535 INFO L119 LiptonReduction]: Number of co-enabled transitions 6982 [2023-08-29 20:33:10,480 INFO L134 LiptonReduction]: Checked pairs total: 36107 [2023-08-29 20:33:10,480 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-08-29 20:33:10,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:33:10,493 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;@785dea5d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:33:10,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-08-29 20:33:10,494 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:33:10,494 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:10,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:10,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:33:10,495 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:33:10,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:10,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1060, now seen corresponding path program 1 times [2023-08-29 20:33:10,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:33:10,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821118337] [2023-08-29 20:33:10,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:10,520 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:33:10,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:33:10,521 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:33:10,522 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:33:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:10,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:33:10,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:33:10,642 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:10,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:33:10,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:33:10,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821118337] [2023-08-29 20:33:10,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821118337] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:10,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:10,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:33:10,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216850014] [2023-08-29 20:33:10,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:10,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:33:10,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:33:10,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:33:10,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:33:10,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 318 [2023-08-29 20:33:10,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call 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:10,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:10,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 318 [2023-08-29 20:33:10,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:12,498 INFO L130 PetriNetUnfolder]: 11260/15872 cut-off events. [2023-08-29 20:33:12,499 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:33:12,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31815 conditions, 15872 events. 11260/15872 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 99938 event pairs, 11260 based on Foata normal form. 0/7394 useless extension candidates. Maximal degree in co-relation 31804. Up to 15867 conditions per place. [2023-08-29 20:33:12,601 INFO L137 encePairwiseOnDemand]: 288/318 looper letters, 40 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-08-29 20:33:12,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 173 flow [2023-08-29 20:33:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:33:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:33:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 322 transitions. [2023-08-29 20:33:12,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062893081761006 [2023-08-29 20:33:12,614 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 322 transitions. [2023-08-29 20:33:12,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 322 transitions. [2023-08-29 20:33:12,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:12,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 322 transitions. [2023-08-29 20:33:12,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 161.0) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call 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:12,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call 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:12,626 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call 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:12,628 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 153 flow. Second operand 2 states and 322 transitions. [2023-08-29 20:33:12,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 173 flow [2023-08-29 20:33:12,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:33:12,634 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2023-08-29 20:33:12,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-29 20:33:12,640 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -32 predicate places. [2023-08-29 20:33:12,640 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2023-08-29 20:33:12,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call 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:12,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:12,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:33:12,649 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:33:12,847 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:33:12,848 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:33:12,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:12,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1048020, now seen corresponding path program 1 times [2023-08-29 20:33:12,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:33:12,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217043797] [2023-08-29 20:33:12,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:12,850 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:33:12,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:33:12,854 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:33:12,856 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:33:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:12,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:33:12,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:33:13,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:33:13,007 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:33:13,026 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:13,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:33:13,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:33:13,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217043797] [2023-08-29 20:33:13,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217043797] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:13,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:33:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008992371] [2023-08-29 20:33:13,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:13,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:33:13,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:13,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:13,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 318 [2023-08-29 20:33:13,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call 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:13,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:13,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 318 [2023-08-29 20:33:13,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:13,875 INFO L130 PetriNetUnfolder]: 4344/6242 cut-off events. [2023-08-29 20:33:13,876 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:13,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12532 conditions, 6242 events. 4344/6242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 34943 event pairs, 4344 based on Foata normal form. 0/3768 useless extension candidates. Maximal degree in co-relation 12529. Up to 6237 conditions per place. [2023-08-29 20:33:13,897 INFO L137 encePairwiseOnDemand]: 310/318 looper letters, 32 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-29 20:33:13,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 142 flow [2023-08-29 20:33:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-29 20:33:13,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4350104821802935 [2023-08-29 20:33:13,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-29 20:33:13,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-29 20:33:13,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:13,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-29 20:33:13,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:13,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call 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:13,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call 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:13,903 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 415 transitions. [2023-08-29 20:33:13,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 142 flow [2023-08-29 20:33:13,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:33:13,903 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2023-08-29 20:33:13,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-29 20:33:13,904 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -37 predicate places. [2023-08-29 20:33:13,904 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2023-08-29 20:33:13,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call 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:13,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:13,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:33:13,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-29 20:33:14,111 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:33:14,112 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:33:14,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1048019, now seen corresponding path program 1 times [2023-08-29 20:33:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:33:14,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556190789] [2023-08-29 20:33:14,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:14,119 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:33:14,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:33:14,120 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:33:14,136 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:33:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:14,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:33:14,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:33:14,239 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 20:33:14,239 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:33:14,260 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:14,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:33:14,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:33:14,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556190789] [2023-08-29 20:33:14,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556190789] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:14,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:14,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:33:14,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863392501] [2023-08-29 20:33:14,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:14,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:14,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:33:14,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:14,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:14,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 318 [2023-08-29 20:33:14,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 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:14,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:14,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 318 [2023-08-29 20:33:14,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:14,815 INFO L130 PetriNetUnfolder]: 1994/2940 cut-off events. [2023-08-29 20:33:14,815 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:14,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5913 conditions, 2940 events. 1994/2940 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 14854 event pairs, 1138 based on Foata normal form. 0/2160 useless extension candidates. Maximal degree in co-relation 5909. Up to 1817 conditions per place. [2023-08-29 20:33:14,826 INFO L137 encePairwiseOnDemand]: 309/318 looper letters, 37 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-08-29 20:33:14,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 168 flow [2023-08-29 20:33:14,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-29 20:33:14,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43186582809224316 [2023-08-29 20:33:14,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-29 20:33:14,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-29 20:33:14,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:14,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-29 20:33:14,829 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:14,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call 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:14,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call 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:14,831 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 3 states and 412 transitions. [2023-08-29 20:33:14,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 168 flow [2023-08-29 20:33:14,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:33:14,832 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 89 flow [2023-08-29 20:33:14,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-29 20:33:14,833 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -37 predicate places. [2023-08-29 20:33:14,833 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 89 flow [2023-08-29 20:33:14,833 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:14,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:14,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:14,840 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:33:15,040 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:33:15,042 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:33:15,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash -639150639, now seen corresponding path program 1 times [2023-08-29 20:33:15,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:33:15,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53853603] [2023-08-29 20:33:15,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:15,047 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:33:15,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:33:15,048 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:33:15,049 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:33:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:15,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:33:15,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:33:15,186 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:15,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:33:15,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:33:15,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53853603] [2023-08-29 20:33:15,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53853603] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:15,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:15,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:33:15,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633340016] [2023-08-29 20:33:15,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:15,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:15,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:33:15,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:15,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:15,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 318 [2023-08-29 20:33:15,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:15,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:15,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 318 [2023-08-29 20:33:15,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:15,453 INFO L130 PetriNetUnfolder]: 860/1409 cut-off events. [2023-08-29 20:33:15,453 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2023-08-29 20:33:15,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 1409 events. 860/1409 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7068 event pairs, 303 based on Foata normal form. 18/1234 useless extension candidates. Maximal degree in co-relation 3089. Up to 1324 conditions per place. [2023-08-29 20:33:15,457 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 41 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-29 20:33:15,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 211 flow [2023-08-29 20:33:15,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-29 20:33:15,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43186582809224316 [2023-08-29 20:33:15,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-29 20:33:15,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-29 20:33:15,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:15,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-29 20:33:15,460 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:15,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call 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:15,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call 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:15,462 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 89 flow. Second operand 3 states and 412 transitions. [2023-08-29 20:33:15,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 211 flow [2023-08-29 20:33:15,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:15,464 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 111 flow [2023-08-29 20:33:15,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-29 20:33:15,465 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -36 predicate places. [2023-08-29 20:33:15,466 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 111 flow [2023-08-29 20:33:15,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:15,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:15,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:15,473 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:33:15,673 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:33:15,673 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:33:15,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:15,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2034444681, now seen corresponding path program 1 times [2023-08-29 20:33:15,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:33:15,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32193341] [2023-08-29 20:33:15,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:15,674 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:33:15,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:33:15,675 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:33:15,676 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:33:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:15,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:33:15,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:33:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:33:15,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:33:15,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:33:15,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32193341] [2023-08-29 20:33:15,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32193341] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:15,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:15,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:33:15,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093425267] [2023-08-29 20:33:15,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:15,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:33:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:33:15,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:33:15,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:33:15,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 318 [2023-08-29 20:33:15,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call 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:15,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:15,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 318 [2023-08-29 20:33:15,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:15,997 INFO L130 PetriNetUnfolder]: 209/416 cut-off events. [2023-08-29 20:33:15,997 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2023-08-29 20:33:15,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 416 events. 209/416 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1658 event pairs, 65 based on Foata normal form. 21/389 useless extension candidates. Maximal degree in co-relation 1034. Up to 239 conditions per place. [2023-08-29 20:33:15,998 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 49 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2023-08-29 20:33:15,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 279 flow [2023-08-29 20:33:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:33:15,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:33:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 545 transitions. [2023-08-29 20:33:16,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42845911949685533 [2023-08-29 20:33:16,000 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 545 transitions. [2023-08-29 20:33:16,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 545 transitions. [2023-08-29 20:33:16,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:16,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 545 transitions. [2023-08-29 20:33:16,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call 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:16,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call 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:16,003 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call 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:16,003 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 111 flow. Second operand 4 states and 545 transitions. [2023-08-29 20:33:16,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 279 flow [2023-08-29 20:33:16,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:33:16,004 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 147 flow [2023-08-29 20:33:16,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-29 20:33:16,005 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -33 predicate places. [2023-08-29 20:33:16,005 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 147 flow [2023-08-29 20:33:16,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call 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:16,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:16,005 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:33:16,013 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 (6)] Ended with exit code 0 [2023-08-29 20:33:16,213 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:33:16,213 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:33:16,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:16,213 INFO L85 PathProgramCache]: Analyzing trace with hash -695106961, now seen corresponding path program 1 times [2023-08-29 20:33:16,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:33:16,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287982812] [2023-08-29 20:33:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:16,216 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:33:16,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:33:16,221 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:33:16,236 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:33:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:16,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:33:16,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:33:16,378 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:16,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:33:16,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:33:16,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287982812] [2023-08-29 20:33:16,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287982812] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:16,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:16,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:33:16,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854299320] [2023-08-29 20:33:16,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:16,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:33:16,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:33:16,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:33:16,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:33:16,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 318 [2023-08-29 20:33:16,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:16,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:16,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 318 [2023-08-29 20:33:16,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:16,596 INFO L130 PetriNetUnfolder]: 114/221 cut-off events. [2023-08-29 20:33:16,596 INFO L131 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2023-08-29 20:33:16,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 221 events. 114/221 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 726 event pairs, 40 based on Foata normal form. 8/222 useless extension candidates. Maximal degree in co-relation 627. Up to 92 conditions per place. [2023-08-29 20:33:16,597 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 40 selfloop transitions, 10 changer transitions 1/53 dead transitions. [2023-08-29 20:33:16,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 273 flow [2023-08-29 20:33:16,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:33:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:33:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-08-29 20:33:16,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41635220125786165 [2023-08-29 20:33:16,599 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-08-29 20:33:16,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-08-29 20:33:16,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:16,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-08-29 20:33:16,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call 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:16,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call 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:16,602 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call 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:16,602 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 147 flow. Second operand 5 states and 662 transitions. [2023-08-29 20:33:16,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 273 flow [2023-08-29 20:33:16,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 257 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:33:16,604 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-08-29 20:33:16,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-29 20:33:16,605 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -36 predicate places. [2023-08-29 20:33:16,606 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-08-29 20:33:16,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:16,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:16,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:16,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:33:16,814 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:33:16,814 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-29 20:33:16,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:16,815 INFO L85 PathProgramCache]: Analyzing trace with hash 897369721, now seen corresponding path program 1 times [2023-08-29 20:33:16,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:33:16,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969902758] [2023-08-29 20:33:16,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:16,815 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:33:16,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:33:16,817 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:33:16,819 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:33:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:33:16,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:33:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:33:17,180 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:33:17,180 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:33:17,180 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2023-08-29 20:33:17,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2023-08-29 20:33:17,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2023-08-29 20:33:17,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2023-08-29 20:33:17,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2023-08-29 20:33:17,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2023-08-29 20:33:17,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2023-08-29 20:33:17,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2023-08-29 20:33:17,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2023-08-29 20:33:17,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2023-08-29 20:33:17,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2023-08-29 20:33:17,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2023-08-29 20:33:17,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2023-08-29 20:33:17,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2023-08-29 20:33:17,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2023-08-29 20:33:17,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2023-08-29 20:33:17,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2023-08-29 20:33:17,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2023-08-29 20:33:17,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2023-08-29 20:33:17,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2023-08-29 20:33:17,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2023-08-29 20:33:17,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2023-08-29 20:33:17,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2023-08-29 20:33:17,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2023-08-29 20:33:17,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2023-08-29 20:33:17,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2023-08-29 20:33:17,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2023-08-29 20:33:17,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2023-08-29 20:33:17,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2023-08-29 20:33:17,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2023-08-29 20:33:17,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2023-08-29 20:33:17,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2023-08-29 20:33:17,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2023-08-29 20:33:17,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2023-08-29 20:33:17,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2023-08-29 20:33:17,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2023-08-29 20:33:17,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2023-08-29 20:33:17,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2023-08-29 20:33:17,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2023-08-29 20:33:17,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2023-08-29 20:33:17,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2023-08-29 20:33:17,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2023-08-29 20:33:17,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2023-08-29 20:33:17,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2023-08-29 20:33:17,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2023-08-29 20:33:17,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2023-08-29 20:33:17,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2023-08-29 20:33:17,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2023-08-29 20:33:17,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2023-08-29 20:33:17,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2023-08-29 20:33:17,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2023-08-29 20:33:17,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2023-08-29 20:33:17,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2023-08-29 20:33:17,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2023-08-29 20:33:17,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2023-08-29 20:33:17,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2023-08-29 20:33:17,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2023-08-29 20:33:17,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2023-08-29 20:33:17,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2023-08-29 20:33:17,210 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:33:17,406 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:33:17,407 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:17,411 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:33:17,411 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:33:17,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:33:17 BasicIcfg [2023-08-29 20:33:17,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:33:17,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:33:17,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:33:17,490 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:33:17,490 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:32:53" (3/4) ... [2023-08-29 20:33:17,492 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:33:17,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:33:17,492 INFO L158 Benchmark]: Toolchain (without parser) took 25870.02ms. Allocated memory was 71.3MB in the beginning and 1.3GB in the end (delta: 1.3GB). Free memory was 47.4MB in the beginning and 845.5MB in the end (delta: -798.1MB). Peak memory consumption was 475.8MB. Max. memory is 16.1GB. [2023-08-29 20:33:17,493 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 71.3MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:33:17,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.86ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 47.1MB in the beginning and 64.0MB in the end (delta: -16.8MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2023-08-29 20:33:17,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.54ms. Allocated memory is still 96.5MB. Free memory was 63.6MB in the beginning and 61.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:33:17,493 INFO L158 Benchmark]: Boogie Preprocessor took 55.29ms. Allocated memory is still 96.5MB. Free memory was 61.1MB in the beginning and 58.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:33:17,494 INFO L158 Benchmark]: RCFGBuilder took 1088.71ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 58.6MB in the beginning and 77.9MB in the end (delta: -19.2MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2023-08-29 20:33:17,494 INFO L158 Benchmark]: TraceAbstraction took 24241.95ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 76.8MB in the beginning and 845.5MB in the end (delta: -768.7MB). Peak memory consumption was 458.2MB. Max. memory is 16.1GB. [2023-08-29 20:33:17,494 INFO L158 Benchmark]: Witness Printer took 2.30ms. Allocated memory is still 1.3GB. Free memory is still 845.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:33:17,495 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.11ms. Allocated memory is still 71.3MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.86ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 47.1MB in the beginning and 64.0MB in the end (delta: -16.8MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.54ms. Allocated memory is still 96.5MB. Free memory was 63.6MB in the beginning and 61.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.29ms. Allocated memory is still 96.5MB. Free memory was 61.1MB in the beginning and 58.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1088.71ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 58.6MB in the beginning and 77.9MB in the end (delta: -19.2MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24241.95ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 76.8MB in the beginning and 845.5MB in the end (delta: -768.7MB). Peak memory consumption was 458.2MB. Max. memory is 16.1GB. * Witness Printer took 2.30ms. Allocated memory is still 1.3GB. Free memory is still 845.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.0s, 180 PlacesBefore, 82 PlacesAfterwards, 172 TransitionsBefore, 72 TransitionsAfterwards, 6982 CoEnabledTransitionPairs, 8 FixpointIterations, 65 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 143 TotalNumberOfCompositions, 36107 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9513, independent: 8878, independent conditional: 0, independent unconditional: 8878, dependent: 635, dependent conditional: 0, dependent unconditional: 635, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2806, independent: 2715, independent conditional: 0, independent unconditional: 2715, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9513, independent: 6163, independent conditional: 0, independent unconditional: 6163, dependent: 544, dependent conditional: 0, dependent unconditional: 544, unknown: 2806, unknown conditional: 0, unknown unconditional: 2806] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 380, Positive conditional cache size: 0, Positive unconditional cache size: 380, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, 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_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1681; [L849] FCALL, FORK 0 pthread_create(&t1681, ((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_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1681, ((void *)0), P0, ((void *)0))=-1, t1681={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$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_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L780] 1 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=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L850] 0 pthread_t t1682; 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_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1681={15:0}, t1682={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L851] FCALL, FORK 0 pthread_create(&t1682, ((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_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1682, ((void *)0), P1, ((void *)0))=0, t1681={15:0}, t1682={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L792] 2 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=0, __unbuffered_p1_EBX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] 2 __unbuffered_p1_EAX = y 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=2, __unbuffered_p1_EBX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] EXPR 2 \read(x) [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L852] 0 pthread_t t1683; [L853] FCALL, FORK 0 pthread_create(&t1683, ((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=2, __unbuffered_p1_EBX=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(&t1683, ((void *)0), P2, ((void *)0))=1, t1681={15:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L823] 3 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$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=2, __unbuffered_p1_EBX=0, 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, t1681={15:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L870] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 233 locations, 85 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 222 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 560 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 32 mSDtfsCounter, 560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=0, InterpolantAutomatonStates: 20, 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.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 2 NumberOfNonLiveVariables, 625 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:33:17,529 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