./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.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 d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:15:14,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:15:14,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:15:14,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:15:14,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:15:14,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:15:14,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:15:14,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:15:14,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:15:14,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:15:14,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:15:14,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:15:14,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:15:14,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:15:14,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:15:14,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:15:14,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:15:14,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:15:14,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:15:14,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:15:14,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:15:14,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:15:14,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:15:14,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:15:14,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:15:14,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:15:14,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:15:14,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:15:14,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:15:14,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:15:14,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:15:14,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:15:14,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:15:14,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:15:14,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:15:14,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:15:14,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:15:14,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:15:14,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:15:14,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:15:14,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:15:14,652 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 03:15:14,685 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:15:14,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:15:14,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:15:14,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:15:14,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:15:14,687 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:15:14,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:15:14,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:15:14,688 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:15:14,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:15:14,689 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:15:14,689 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:15:14,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:15:14,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:15:14,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:15:14,690 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:15:14,690 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:15:14,690 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:15:14,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:15:14,691 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:15:14,691 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:15:14,691 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:15:14,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:15:14,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:15:14,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:15:14,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:15:14,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:15:14,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:15:14,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 03:15:14,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 03:15:14,693 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:15:14,693 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:15:14,693 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:15:14,694 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:15:14,694 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 -> d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:15:14,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:15:15,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:15:15,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:15:15,009 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:15:15,010 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:15:15,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2023-08-30 03:15:16,117 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:15:16,370 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:15:16,377 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2023-08-30 03:15:16,411 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54c7fc36/980b027f74984a9394aa49058fe1cab1/FLAG467d0d12d [2023-08-30 03:15:16,436 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54c7fc36/980b027f74984a9394aa49058fe1cab1 [2023-08-30 03:15:16,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:15:16,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:15:16,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:15:16,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:15:16,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:15:16,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:15:16" (1/1) ... [2023-08-30 03:15:16,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3ce467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16, skipping insertion in model container [2023-08-30 03:15:16,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:15:16" (1/1) ... [2023-08-30 03:15:16,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:15:16,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:15:16,647 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/safe020_rmo.i[988,1001] [2023-08-30 03:15:16,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:15:16,805 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:15:16,815 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/safe020_rmo.i[988,1001] [2023-08-30 03:15:16,858 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:15:16,898 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:15:16,898 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:15:16,904 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:15:16,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16 WrapperNode [2023-08-30 03:15:16,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:15:16,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:15:16,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:15:16,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:15:16,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16" (1/1) ... [2023-08-30 03:15:16,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16" (1/1) ... [2023-08-30 03:15:16,943 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2023-08-30 03:15:16,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:15:16,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:15:16,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:15:16,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:15:16,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16" (1/1) ... [2023-08-30 03:15:16,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16" (1/1) ... [2023-08-30 03:15:16,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16" (1/1) ... [2023-08-30 03:15:16,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16" (1/1) ... [2023-08-30 03:15:16,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16" (1/1) ... [2023-08-30 03:15:16,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16" (1/1) ... [2023-08-30 03:15:16,976 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16" (1/1) ... [2023-08-30 03:15:16,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16" (1/1) ... [2023-08-30 03:15:16,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:15:16,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:15:16,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:15:16,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:15:16,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16" (1/1) ... [2023-08-30 03:15:16,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:15:17,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:15:17,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:15:17,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:15:17,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 03:15:17,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 03:15:17,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:15:17,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:15:17,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:15:17,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:15:17,066 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:15:17,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:15:17,066 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:15:17,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:15:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:15:17,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:15:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 03:15:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:15:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:15:17,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:15:17,068 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:15:17,274 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:15:17,276 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:15:17,801 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:15:18,224 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:15:18,224 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:15:18,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:15:18 BoogieIcfgContainer [2023-08-30 03:15:18,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:15:18,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:15:18,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:15:18,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:15:18,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:15:16" (1/3) ... [2023-08-30 03:15:18,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1482c9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:15:18, skipping insertion in model container [2023-08-30 03:15:18,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:16" (2/3) ... [2023-08-30 03:15:18,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1482c9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:15:18, skipping insertion in model container [2023-08-30 03:15:18,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:15:18" (3/3) ... [2023-08-30 03:15:18,235 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2023-08-30 03:15:18,251 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:15:18,252 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-08-30 03:15:18,253 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:15:18,372 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:15:18,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 173 transitions, 361 flow [2023-08-30 03:15:18,467 INFO L130 PetriNetUnfolder]: 2/170 cut-off events. [2023-08-30 03:15:18,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:15:18,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 170 events. 2/170 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 256 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2023-08-30 03:15:18,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 173 transitions, 361 flow [2023-08-30 03:15:18,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 170 transitions, 349 flow [2023-08-30 03:15:18,498 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:15:18,510 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 170 transitions, 349 flow [2023-08-30 03:15:18,513 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 170 transitions, 349 flow [2023-08-30 03:15:18,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 170 transitions, 349 flow [2023-08-30 03:15:18,546 INFO L130 PetriNetUnfolder]: 2/170 cut-off events. [2023-08-30 03:15:18,547 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:15:18,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 170 events. 2/170 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 254 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2023-08-30 03:15:18,553 INFO L119 LiptonReduction]: Number of co-enabled transitions 6704 [2023-08-30 03:15:24,632 INFO L134 LiptonReduction]: Checked pairs total: 36334 [2023-08-30 03:15:24,633 INFO L136 LiptonReduction]: Total number of compositions: 138 [2023-08-30 03:15:24,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:15:24,649 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;@3e2b1186, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:15:24,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-08-30 03:15:24,652 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 03:15:24,652 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:15:24,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:24,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:15:24,653 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:24,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:24,657 INFO L85 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2023-08-30 03:15:24,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:24,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560348481] [2023-08-30 03:15:24,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:24,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:24,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560348481] [2023-08-30 03:15:24,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560348481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:24,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:24,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:15:24,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003073817] [2023-08-30 03:15:24,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:24,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:15:24,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:24,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:15:24,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:15:24,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 311 [2023-08-30 03:15:24,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:24,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:24,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 311 [2023-08-30 03:15:24,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:28,845 INFO L130 PetriNetUnfolder]: 23428/32687 cut-off events. [2023-08-30 03:15:28,845 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-08-30 03:15:28,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65453 conditions, 32687 events. 23428/32687 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 2507. Compared 216457 event pairs, 23428 based on Foata normal form. 0/13853 useless extension candidates. Maximal degree in co-relation 65442. Up to 32628 conditions per place. [2023-08-30 03:15:29,089 INFO L137 encePairwiseOnDemand]: 285/311 looper letters, 45 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2023-08-30 03:15:29,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 191 flow [2023-08-30 03:15:29,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:15:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:15:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 317 transitions. [2023-08-30 03:15:29,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096463022508039 [2023-08-30 03:15:29,111 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 317 transitions. [2023-08-30 03:15:29,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 317 transitions. [2023-08-30 03:15:29,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:29,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 317 transitions. [2023-08-30 03:15:29,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.5) internal successors, (317), 2 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:29,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:29,126 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:29,127 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 153 flow. Second operand 2 states and 317 transitions. [2023-08-30 03:15:29,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 191 flow [2023-08-30 03:15:29,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:15:29,135 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 98 flow [2023-08-30 03:15:29,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-08-30 03:15:29,140 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -28 predicate places. [2023-08-30 03:15:29,141 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 98 flow [2023-08-30 03:15:29,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:29,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:29,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:15:29,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 03:15:29,146 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:29,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:29,147 INFO L85 PathProgramCache]: Analyzing trace with hash 30432820, now seen corresponding path program 1 times [2023-08-30 03:15:29,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:29,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282026103] [2023-08-30 03:15:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:29,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:29,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:29,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282026103] [2023-08-30 03:15:29,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282026103] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:29,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:29,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:15:29,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834104024] [2023-08-30 03:15:29,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:29,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:15:29,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:15:29,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:15:29,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 311 [2023-08-30 03:15:29,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:29,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:29,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 311 [2023-08-30 03:15:29,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:31,630 INFO L130 PetriNetUnfolder]: 14811/21812 cut-off events. [2023-08-30 03:15:31,630 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:15:31,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43434 conditions, 21812 events. 14811/21812 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1479. Compared 147535 event pairs, 9091 based on Foata normal form. 0/11792 useless extension candidates. Maximal degree in co-relation 43431. Up to 13032 conditions per place. [2023-08-30 03:15:31,731 INFO L137 encePairwiseOnDemand]: 292/311 looper letters, 52 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2023-08-30 03:15:31,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 256 flow [2023-08-30 03:15:31,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:15:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:15:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-30 03:15:31,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45230439442658094 [2023-08-30 03:15:31,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-30 03:15:31,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-30 03:15:31,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:31,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-30 03:15:31,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:31,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:31,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:31,741 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 98 flow. Second operand 3 states and 422 transitions. [2023-08-30 03:15:31,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 256 flow [2023-08-30 03:15:31,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:15:31,743 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 180 flow [2023-08-30 03:15:31,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2023-08-30 03:15:31,744 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -26 predicate places. [2023-08-30 03:15:31,745 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 180 flow [2023-08-30 03:15:31,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:31,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:31,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:15:31,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 03:15:31,746 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:31,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash 30432821, now seen corresponding path program 1 times [2023-08-30 03:15:31,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:31,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852267903] [2023-08-30 03:15:31,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:31,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:31,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:31,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852267903] [2023-08-30 03:15:31,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852267903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:31,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:31,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:15:31,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700141505] [2023-08-30 03:15:31,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:31,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:15:31,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:31,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:15:31,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:15:31,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 311 [2023-08-30 03:15:31,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:31,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:31,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 311 [2023-08-30 03:15:31,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:32,608 INFO L130 PetriNetUnfolder]: 4316/6749 cut-off events. [2023-08-30 03:15:32,608 INFO L131 PetriNetUnfolder]: For 2019/2019 co-relation queries the response was YES. [2023-08-30 03:15:32,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19179 conditions, 6749 events. 4316/6749 cut-off events. For 2019/2019 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 41651 event pairs, 3129 based on Foata normal form. 1935/7754 useless extension candidates. Maximal degree in co-relation 19174. Up to 6593 conditions per place. [2023-08-30 03:15:32,648 INFO L137 encePairwiseOnDemand]: 301/311 looper letters, 41 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-30 03:15:32,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 246 flow [2023-08-30 03:15:32,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:15:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:15:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-30 03:15:32,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43515541264737406 [2023-08-30 03:15:32,651 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-30 03:15:32,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-30 03:15:32,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:32,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-30 03:15:32,653 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-30 03:15:32,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:32,655 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:32,655 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 180 flow. Second operand 3 states and 406 transitions. [2023-08-30 03:15:32,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 246 flow [2023-08-30 03:15:32,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:15:32,674 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 144 flow [2023-08-30 03:15:32,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2023-08-30 03:15:32,675 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -35 predicate places. [2023-08-30 03:15:32,675 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 144 flow [2023-08-30 03:15:32,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:32,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:32,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:32,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 03:15:32,677 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:32,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:32,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1103341959, now seen corresponding path program 1 times [2023-08-30 03:15:32,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:32,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451448096] [2023-08-30 03:15:32,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:32,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:32,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:32,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451448096] [2023-08-30 03:15:32,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451448096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:32,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:32,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:15:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985412832] [2023-08-30 03:15:32,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:32,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:15:32,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:32,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:15:32,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:15:32,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 311 [2023-08-30 03:15:32,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:32,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:32,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 311 [2023-08-30 03:15:32,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:33,554 INFO L130 PetriNetUnfolder]: 4236/6701 cut-off events. [2023-08-30 03:15:33,555 INFO L131 PetriNetUnfolder]: For 827/827 co-relation queries the response was YES. [2023-08-30 03:15:33,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17552 conditions, 6701 events. 4236/6701 cut-off events. For 827/827 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 42117 event pairs, 1469 based on Foata normal form. 0/5063 useless extension candidates. Maximal degree in co-relation 17547. Up to 4987 conditions per place. [2023-08-30 03:15:33,591 INFO L137 encePairwiseOnDemand]: 307/311 looper letters, 63 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2023-08-30 03:15:33,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 358 flow [2023-08-30 03:15:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:15:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:15:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-30 03:15:33,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45016077170418006 [2023-08-30 03:15:33,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-30 03:15:33,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-30 03:15:33,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:33,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-30 03:15:33,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:33,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:33,603 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:33,603 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 144 flow. Second operand 3 states and 420 transitions. [2023-08-30 03:15:33,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 358 flow [2023-08-30 03:15:33,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 357 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:15:33,607 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 156 flow [2023-08-30 03:15:33,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2023-08-30 03:15:33,609 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -33 predicate places. [2023-08-30 03:15:33,610 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 156 flow [2023-08-30 03:15:33,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:33,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:33,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:33,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 03:15:33,611 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:33,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1103341747, now seen corresponding path program 1 times [2023-08-30 03:15:33,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:33,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163724065] [2023-08-30 03:15:33,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:33,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:34,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:34,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163724065] [2023-08-30 03:15:34,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163724065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:34,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:34,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:15:34,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616146758] [2023-08-30 03:15:34,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:34,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:15:34,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:34,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:15:34,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:15:34,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 311 [2023-08-30 03:15:34,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:34,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:34,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 311 [2023-08-30 03:15:34,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:34,868 INFO L130 PetriNetUnfolder]: 4196/6629 cut-off events. [2023-08-30 03:15:34,868 INFO L131 PetriNetUnfolder]: For 1239/1239 co-relation queries the response was YES. [2023-08-30 03:15:34,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18086 conditions, 6629 events. 4196/6629 cut-off events. For 1239/1239 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 41574 event pairs, 1477 based on Foata normal form. 0/5195 useless extension candidates. Maximal degree in co-relation 18080. Up to 4971 conditions per place. [2023-08-30 03:15:34,903 INFO L137 encePairwiseOnDemand]: 308/311 looper letters, 62 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2023-08-30 03:15:34,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 366 flow [2023-08-30 03:15:34,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:15:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:15:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-30 03:15:34,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4512325830653805 [2023-08-30 03:15:34,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-30 03:15:34,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-30 03:15:34,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:34,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-30 03:15:34,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:34,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:34,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:34,910 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 156 flow. Second operand 3 states and 421 transitions. [2023-08-30 03:15:34,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 366 flow [2023-08-30 03:15:34,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:15:34,914 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 161 flow [2023-08-30 03:15:34,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-08-30 03:15:34,915 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -32 predicate places. [2023-08-30 03:15:34,915 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 161 flow [2023-08-30 03:15:34,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:34,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:34,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:34,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 03:15:34,917 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:34,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 156143303, now seen corresponding path program 1 times [2023-08-30 03:15:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:34,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528938707] [2023-08-30 03:15:34,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528938707] [2023-08-30 03:15:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528938707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:34,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:15:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882683003] [2023-08-30 03:15:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:34,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:15:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:34,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:15:34,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:15:35,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 311 [2023-08-30 03:15:35,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:35,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:35,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 311 [2023-08-30 03:15:35,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:35,807 INFO L130 PetriNetUnfolder]: 4619/7376 cut-off events. [2023-08-30 03:15:35,807 INFO L131 PetriNetUnfolder]: For 1419/1419 co-relation queries the response was YES. [2023-08-30 03:15:35,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20372 conditions, 7376 events. 4619/7376 cut-off events. For 1419/1419 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 47654 event pairs, 2081 based on Foata normal form. 0/5945 useless extension candidates. Maximal degree in co-relation 20365. Up to 5301 conditions per place. [2023-08-30 03:15:35,836 INFO L137 encePairwiseOnDemand]: 305/311 looper letters, 50 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2023-08-30 03:15:35,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 315 flow [2023-08-30 03:15:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:15:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:15:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-30 03:15:35,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43515541264737406 [2023-08-30 03:15:35,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-30 03:15:35,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-30 03:15:35,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:35,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-30 03:15:35,841 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-30 03:15:35,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:35,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:35,844 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 161 flow. Second operand 3 states and 406 transitions. [2023-08-30 03:15:35,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 315 flow [2023-08-30 03:15:35,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:15:35,847 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 193 flow [2023-08-30 03:15:35,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-30 03:15:35,848 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -32 predicate places. [2023-08-30 03:15:35,848 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 193 flow [2023-08-30 03:15:35,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:35,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:35,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:35,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 03:15:35,849 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:35,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:35,850 INFO L85 PathProgramCache]: Analyzing trace with hash 156143304, now seen corresponding path program 1 times [2023-08-30 03:15:35,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:35,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522377230] [2023-08-30 03:15:35,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:35,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:35,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:35,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522377230] [2023-08-30 03:15:35,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522377230] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:35,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:35,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:15:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202616735] [2023-08-30 03:15:35,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:35,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:15:35,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:35,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:15:35,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:15:36,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 311 [2023-08-30 03:15:36,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:36,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:36,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 311 [2023-08-30 03:15:36,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:36,779 INFO L130 PetriNetUnfolder]: 4515/7224 cut-off events. [2023-08-30 03:15:36,780 INFO L131 PetriNetUnfolder]: For 2819/2819 co-relation queries the response was YES. [2023-08-30 03:15:36,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21265 conditions, 7224 events. 4515/7224 cut-off events. For 2819/2819 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 46703 event pairs, 1413 based on Foata normal form. 48/5841 useless extension candidates. Maximal degree in co-relation 21257. Up to 5565 conditions per place. [2023-08-30 03:15:36,815 INFO L137 encePairwiseOnDemand]: 308/311 looper letters, 63 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2023-08-30 03:15:36,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 403 flow [2023-08-30 03:15:36,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:15:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:15:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-30 03:15:36,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292604501607717 [2023-08-30 03:15:36,818 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-30 03:15:36,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-30 03:15:36,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:36,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-30 03:15:36,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:36,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:36,822 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:36,822 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 193 flow. Second operand 4 states and 534 transitions. [2023-08-30 03:15:36,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 403 flow [2023-08-30 03:15:36,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:15:36,838 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 186 flow [2023-08-30 03:15:36,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-08-30 03:15:36,839 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -32 predicate places. [2023-08-30 03:15:36,839 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 186 flow [2023-08-30 03:15:36,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:36,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:36,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:36,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 03:15:36,841 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:36,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:36,841 INFO L85 PathProgramCache]: Analyzing trace with hash 156143515, now seen corresponding path program 1 times [2023-08-30 03:15:36,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:36,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391532316] [2023-08-30 03:15:36,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:37,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391532316] [2023-08-30 03:15:37,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391532316] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:37,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:37,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:15:37,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380232482] [2023-08-30 03:15:37,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:37,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:15:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:37,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:15:37,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:15:37,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 311 [2023-08-30 03:15:37,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:37,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:37,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 311 [2023-08-30 03:15:37,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:37,858 INFO L130 PetriNetUnfolder]: 5459/8412 cut-off events. [2023-08-30 03:15:37,858 INFO L131 PetriNetUnfolder]: For 3660/3660 co-relation queries the response was YES. [2023-08-30 03:15:37,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24301 conditions, 8412 events. 5459/8412 cut-off events. For 3660/3660 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 52339 event pairs, 1491 based on Foata normal form. 4/6804 useless extension candidates. Maximal degree in co-relation 24294. Up to 8028 conditions per place. [2023-08-30 03:15:37,890 INFO L137 encePairwiseOnDemand]: 307/311 looper letters, 75 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-08-30 03:15:37,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 480 flow [2023-08-30 03:15:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:15:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:15:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-30 03:15:37,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44694533762057875 [2023-08-30 03:15:37,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-30 03:15:37,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-30 03:15:37,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:37,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-30 03:15:37,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:37,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:37,895 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:37,895 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 186 flow. Second operand 3 states and 417 transitions. [2023-08-30 03:15:37,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 480 flow [2023-08-30 03:15:37,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:15:37,913 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 201 flow [2023-08-30 03:15:37,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2023-08-30 03:15:37,913 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -31 predicate places. [2023-08-30 03:15:37,913 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 201 flow [2023-08-30 03:15:37,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:37,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:37,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:37,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 03:15:37,914 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:37,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash 497651259, now seen corresponding path program 1 times [2023-08-30 03:15:37,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:37,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345887475] [2023-08-30 03:15:37,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:37,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:38,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:38,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345887475] [2023-08-30 03:15:38,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345887475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:38,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:38,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:15:38,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401634238] [2023-08-30 03:15:38,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:38,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:15:38,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:38,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:15:38,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:15:39,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 311 [2023-08-30 03:15:39,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 201 flow. Second operand has 9 states, 9 states have (on average 106.44444444444444) internal successors, (958), 9 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:39,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:39,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 311 [2023-08-30 03:15:39,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:40,355 INFO L130 PetriNetUnfolder]: 5158/8042 cut-off events. [2023-08-30 03:15:40,355 INFO L131 PetriNetUnfolder]: For 2876/2876 co-relation queries the response was YES. [2023-08-30 03:15:40,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24305 conditions, 8042 events. 5158/8042 cut-off events. For 2876/2876 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 50677 event pairs, 1419 based on Foata normal form. 15/6312 useless extension candidates. Maximal degree in co-relation 24297. Up to 6094 conditions per place. [2023-08-30 03:15:40,393 INFO L137 encePairwiseOnDemand]: 302/311 looper letters, 104 selfloop transitions, 31 changer transitions 0/137 dead transitions. [2023-08-30 03:15:40,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 137 transitions, 843 flow [2023-08-30 03:15:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 03:15:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 03:15:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1152 transitions. [2023-08-30 03:15:40,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37041800643086814 [2023-08-30 03:15:40,396 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1152 transitions. [2023-08-30 03:15:40,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1152 transitions. [2023-08-30 03:15:40,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:40,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1152 transitions. [2023-08-30 03:15:40,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.2) internal successors, (1152), 10 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:40,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 311.0) internal successors, (3421), 11 states have internal predecessors, (3421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:40,404 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 311.0) internal successors, (3421), 11 states have internal predecessors, (3421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:40,404 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 201 flow. Second operand 10 states and 1152 transitions. [2023-08-30 03:15:40,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 137 transitions, 843 flow [2023-08-30 03:15:40,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 137 transitions, 832 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:15:40,420 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 447 flow [2023-08-30 03:15:40,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=447, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2023-08-30 03:15:40,421 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -19 predicate places. [2023-08-30 03:15:40,421 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 74 transitions, 447 flow [2023-08-30 03:15:40,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.44444444444444) internal successors, (958), 9 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:40,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:40,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:40,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 03:15:40,422 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:40,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash 545495068, now seen corresponding path program 1 times [2023-08-30 03:15:40,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:40,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764528413] [2023-08-30 03:15:40,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:40,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:40,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:40,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764528413] [2023-08-30 03:15:40,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764528413] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:40,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:40,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:15:40,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531010758] [2023-08-30 03:15:40,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:40,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:15:40,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:40,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:15:40,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:15:40,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 311 [2023-08-30 03:15:40,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 74 transitions, 447 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:40,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:40,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 311 [2023-08-30 03:15:40,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:41,354 INFO L130 PetriNetUnfolder]: 4462/6945 cut-off events. [2023-08-30 03:15:41,355 INFO L131 PetriNetUnfolder]: For 4639/4651 co-relation queries the response was YES. [2023-08-30 03:15:41,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23138 conditions, 6945 events. 4462/6945 cut-off events. For 4639/4651 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 42332 event pairs, 1404 based on Foata normal form. 35/5597 useless extension candidates. Maximal degree in co-relation 23126. Up to 2922 conditions per place. [2023-08-30 03:15:41,388 INFO L137 encePairwiseOnDemand]: 295/311 looper letters, 72 selfloop transitions, 24 changer transitions 0/98 dead transitions. [2023-08-30 03:15:41,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 759 flow [2023-08-30 03:15:41,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:15:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:15:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2023-08-30 03:15:41,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107717041800643 [2023-08-30 03:15:41,390 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2023-08-30 03:15:41,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2023-08-30 03:15:41,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:41,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2023-08-30 03:15:41,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:41,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:41,393 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:41,393 INFO L175 Difference]: Start difference. First operand has 63 places, 74 transitions, 447 flow. Second operand 4 states and 511 transitions. [2023-08-30 03:15:41,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 759 flow [2023-08-30 03:15:41,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 98 transitions, 755 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 03:15:41,411 INFO L231 Difference]: Finished difference. Result has 67 places, 81 transitions, 593 flow [2023-08-30 03:15:41,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=593, PETRI_PLACES=67, PETRI_TRANSITIONS=81} [2023-08-30 03:15:41,412 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -15 predicate places. [2023-08-30 03:15:41,412 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 81 transitions, 593 flow [2023-08-30 03:15:41,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:41,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:41,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:41,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 03:15:41,413 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:41,414 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:41,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1872792123, now seen corresponding path program 1 times [2023-08-30 03:15:41,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:41,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077628536] [2023-08-30 03:15:41,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:41,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:41,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:41,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077628536] [2023-08-30 03:15:41,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077628536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:41,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:41,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:15:41,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007212651] [2023-08-30 03:15:41,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:41,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:15:41,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:41,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:15:41,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:15:41,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 311 [2023-08-30 03:15:41,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 81 transitions, 593 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:41,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:41,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 311 [2023-08-30 03:15:41,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:41,981 INFO L130 PetriNetUnfolder]: 1347/2347 cut-off events. [2023-08-30 03:15:41,981 INFO L131 PetriNetUnfolder]: For 2529/2529 co-relation queries the response was YES. [2023-08-30 03:15:41,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8840 conditions, 2347 events. 1347/2347 cut-off events. For 2529/2529 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 13552 event pairs, 377 based on Foata normal form. 27/2096 useless extension candidates. Maximal degree in co-relation 8826. Up to 2157 conditions per place. [2023-08-30 03:15:41,991 INFO L137 encePairwiseOnDemand]: 306/311 looper letters, 89 selfloop transitions, 4 changer transitions 0/95 dead transitions. [2023-08-30 03:15:41,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 819 flow [2023-08-30 03:15:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:15:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:15:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-08-30 03:15:41,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4340836012861736 [2023-08-30 03:15:41,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-08-30 03:15:41,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-08-30 03:15:41,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:41,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-08-30 03:15:41,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:41,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:41,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:41,996 INFO L175 Difference]: Start difference. First operand has 67 places, 81 transitions, 593 flow. Second operand 3 states and 405 transitions. [2023-08-30 03:15:41,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 819 flow [2023-08-30 03:15:42,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 95 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:15:42,007 INFO L231 Difference]: Finished difference. Result has 69 places, 78 transitions, 560 flow [2023-08-30 03:15:42,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=69, PETRI_TRANSITIONS=78} [2023-08-30 03:15:42,008 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -13 predicate places. [2023-08-30 03:15:42,008 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 78 transitions, 560 flow [2023-08-30 03:15:42,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:42,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:42,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 03:15:42,009 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:42,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash 219961160, now seen corresponding path program 1 times [2023-08-30 03:15:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:42,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449726977] [2023-08-30 03:15:42,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:42,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:42,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449726977] [2023-08-30 03:15:42,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449726977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:42,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:42,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:15:42,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065939740] [2023-08-30 03:15:42,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:42,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:15:42,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:42,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:15:42,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:15:42,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 311 [2023-08-30 03:15:42,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 78 transitions, 560 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:42,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 311 [2023-08-30 03:15:42,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:42,459 INFO L130 PetriNetUnfolder]: 283/563 cut-off events. [2023-08-30 03:15:42,459 INFO L131 PetriNetUnfolder]: For 545/545 co-relation queries the response was YES. [2023-08-30 03:15:42,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2136 conditions, 563 events. 283/563 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2302 event pairs, 75 based on Foata normal form. 29/555 useless extension candidates. Maximal degree in co-relation 2120. Up to 292 conditions per place. [2023-08-30 03:15:42,462 INFO L137 encePairwiseOnDemand]: 306/311 looper letters, 83 selfloop transitions, 7 changer transitions 0/92 dead transitions. [2023-08-30 03:15:42,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 92 transitions, 738 flow [2023-08-30 03:15:42,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:15:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:15:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2023-08-30 03:15:42,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43086816720257237 [2023-08-30 03:15:42,464 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2023-08-30 03:15:42,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2023-08-30 03:15:42,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:42,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2023-08-30 03:15:42,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,468 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,468 INFO L175 Difference]: Start difference. First operand has 69 places, 78 transitions, 560 flow. Second operand 4 states and 536 transitions. [2023-08-30 03:15:42,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 92 transitions, 738 flow [2023-08-30 03:15:42,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 92 transitions, 713 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 03:15:42,474 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 432 flow [2023-08-30 03:15:42,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=432, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2023-08-30 03:15:42,474 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -14 predicate places. [2023-08-30 03:15:42,474 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 432 flow [2023-08-30 03:15:42,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:42,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:42,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 03:15:42,475 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:42,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1755719245, now seen corresponding path program 1 times [2023-08-30 03:15:42,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:42,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534015855] [2023-08-30 03:15:42,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:42,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:42,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:42,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534015855] [2023-08-30 03:15:42,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534015855] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:42,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:42,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:15:42,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333040413] [2023-08-30 03:15:42,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:42,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:15:42,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:42,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:15:42,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:15:42,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 311 [2023-08-30 03:15:42,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 432 flow. Second operand has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:42,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 311 [2023-08-30 03:15:42,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:42,951 INFO L130 PetriNetUnfolder]: 168/313 cut-off events. [2023-08-30 03:15:42,951 INFO L131 PetriNetUnfolder]: For 474/474 co-relation queries the response was YES. [2023-08-30 03:15:42,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 313 events. 168/313 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1040 event pairs, 55 based on Foata normal form. 10/321 useless extension candidates. Maximal degree in co-relation 1156. Up to 137 conditions per place. [2023-08-30 03:15:42,953 INFO L137 encePairwiseOnDemand]: 306/311 looper letters, 51 selfloop transitions, 10 changer transitions 1/64 dead transitions. [2023-08-30 03:15:42,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 472 flow [2023-08-30 03:15:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:15:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:15:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-30 03:15:42,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41672025723472667 [2023-08-30 03:15:42,955 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-30 03:15:42,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-30 03:15:42,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:42,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-30 03:15:42,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 311.0) internal successors, (1866), 6 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,960 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 311.0) internal successors, (1866), 6 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,960 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 432 flow. Second operand 5 states and 648 transitions. [2023-08-30 03:15:42,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 472 flow [2023-08-30 03:15:42,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 64 transitions, 409 flow, removed 12 selfloop flow, removed 10 redundant places. [2023-08-30 03:15:42,962 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 194 flow [2023-08-30 03:15:42,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-08-30 03:15:42,963 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -29 predicate places. [2023-08-30 03:15:42,963 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 194 flow [2023-08-30 03:15:42,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:42,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:42,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 03:15:42,964 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:42,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:42,965 INFO L85 PathProgramCache]: Analyzing trace with hash -11683163, now seen corresponding path program 1 times [2023-08-30 03:15:42,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:42,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020141260] [2023-08-30 03:15:42,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:42,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:43,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:43,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020141260] [2023-08-30 03:15:43,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020141260] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:43,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:43,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:15:43,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440772095] [2023-08-30 03:15:43,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:43,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:15:43,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:43,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:15:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:15:43,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 311 [2023-08-30 03:15:43,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 194 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-30 03:15:43,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:43,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 311 [2023-08-30 03:15:43,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:43,348 INFO L130 PetriNetUnfolder]: 225/415 cut-off events. [2023-08-30 03:15:43,348 INFO L131 PetriNetUnfolder]: For 673/673 co-relation queries the response was YES. [2023-08-30 03:15:43,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 415 events. 225/415 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1455 event pairs, 106 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 1522. Up to 302 conditions per place. [2023-08-30 03:15:43,350 INFO L137 encePairwiseOnDemand]: 308/311 looper letters, 53 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2023-08-30 03:15:43,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 415 flow [2023-08-30 03:15:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:15:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:15:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-30 03:15:43,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4287245444801715 [2023-08-30 03:15:43,352 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-30 03:15:43,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-30 03:15:43,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:43,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-30 03:15:43,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:43,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:43,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:43,355 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 194 flow. Second operand 3 states and 400 transitions. [2023-08-30 03:15:43,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 415 flow [2023-08-30 03:15:43,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 365 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 03:15:43,358 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 179 flow [2023-08-30 03:15:43,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-30 03:15:43,358 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -30 predicate places. [2023-08-30 03:15:43,359 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 179 flow [2023-08-30 03:15:43,359 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-30 03:15:43,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:43,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:43,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 03:15:43,360 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:43,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:43,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1688455913, now seen corresponding path program 2 times [2023-08-30 03:15:43,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:43,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831288596] [2023-08-30 03:15:43,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:43,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:45,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:45,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831288596] [2023-08-30 03:15:45,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831288596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:45,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:45,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 03:15:45,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960363004] [2023-08-30 03:15:45,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:45,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 03:15:45,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:45,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 03:15:45,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-30 03:15:45,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 311 [2023-08-30 03:15:45,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 179 flow. Second operand has 11 states, 11 states have (on average 106.81818181818181) internal successors, (1175), 11 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:45,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:45,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 311 [2023-08-30 03:15:45,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:46,067 INFO L130 PetriNetUnfolder]: 263/524 cut-off events. [2023-08-30 03:15:46,068 INFO L131 PetriNetUnfolder]: For 565/571 co-relation queries the response was YES. [2023-08-30 03:15:46,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 524 events. 263/524 cut-off events. For 565/571 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2208 event pairs, 36 based on Foata normal form. 1/525 useless extension candidates. Maximal degree in co-relation 1835. Up to 244 conditions per place. [2023-08-30 03:15:46,070 INFO L137 encePairwiseOnDemand]: 303/311 looper letters, 70 selfloop transitions, 14 changer transitions 0/86 dead transitions. [2023-08-30 03:15:46,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 580 flow [2023-08-30 03:15:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 03:15:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 03:15:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1429 transitions. [2023-08-30 03:15:46,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35345040811278755 [2023-08-30 03:15:46,075 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1429 transitions. [2023-08-30 03:15:46,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1429 transitions. [2023-08-30 03:15:46,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:46,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1429 transitions. [2023-08-30 03:15:46,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 109.92307692307692) internal successors, (1429), 13 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:46,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 311.0) internal successors, (4354), 14 states have internal predecessors, (4354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:46,084 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 311.0) internal successors, (4354), 14 states have internal predecessors, (4354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:46,084 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 179 flow. Second operand 13 states and 1429 transitions. [2023-08-30 03:15:46,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 580 flow [2023-08-30 03:15:46,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 572 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 03:15:46,088 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 236 flow [2023-08-30 03:15:46,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=236, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2023-08-30 03:15:46,089 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -16 predicate places. [2023-08-30 03:15:46,089 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 236 flow [2023-08-30 03:15:46,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 106.81818181818181) internal successors, (1175), 11 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:46,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:46,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:46,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 03:15:46,090 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:15:46,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:46,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1024320425, now seen corresponding path program 3 times [2023-08-30 03:15:46,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:46,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550589734] [2023-08-30 03:15:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:15:46,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:15:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:15:46,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 03:15:46,316 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:15:46,318 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2023-08-30 03:15:46,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2023-08-30 03:15:46,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2023-08-30 03:15:46,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2023-08-30 03:15:46,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2023-08-30 03:15:46,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2023-08-30 03:15:46,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2023-08-30 03:15:46,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2023-08-30 03:15:46,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2023-08-30 03:15:46,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2023-08-30 03:15:46,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2023-08-30 03:15:46,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2023-08-30 03:15:46,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2023-08-30 03:15:46,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2023-08-30 03:15:46,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2023-08-30 03:15:46,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2023-08-30 03:15:46,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2023-08-30 03:15:46,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2023-08-30 03:15:46,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2023-08-30 03:15:46,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2023-08-30 03:15:46,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2023-08-30 03:15:46,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2023-08-30 03:15:46,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2023-08-30 03:15:46,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2023-08-30 03:15:46,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2023-08-30 03:15:46,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2023-08-30 03:15:46,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2023-08-30 03:15:46,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2023-08-30 03:15:46,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2023-08-30 03:15:46,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2023-08-30 03:15:46,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2023-08-30 03:15:46,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2023-08-30 03:15:46,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2023-08-30 03:15:46,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2023-08-30 03:15:46,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2023-08-30 03:15:46,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2023-08-30 03:15:46,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2023-08-30 03:15:46,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2023-08-30 03:15:46,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2023-08-30 03:15:46,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2023-08-30 03:15:46,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2023-08-30 03:15:46,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2023-08-30 03:15:46,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2023-08-30 03:15:46,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2023-08-30 03:15:46,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2023-08-30 03:15:46,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2023-08-30 03:15:46,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2023-08-30 03:15:46,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2023-08-30 03:15:46,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2023-08-30 03:15:46,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2023-08-30 03:15:46,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2023-08-30 03:15:46,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2023-08-30 03:15:46,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2023-08-30 03:15:46,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2023-08-30 03:15:46,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2023-08-30 03:15:46,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2023-08-30 03:15:46,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2023-08-30 03:15:46,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2023-08-30 03:15:46,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2023-08-30 03:15:46,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2023-08-30 03:15:46,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2023-08-30 03:15:46,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2023-08-30 03:15:46,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2023-08-30 03:15:46,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2023-08-30 03:15:46,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2023-08-30 03:15:46,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2023-08-30 03:15:46,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2023-08-30 03:15:46,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2023-08-30 03:15:46,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2023-08-30 03:15:46,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2023-08-30 03:15:46,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2023-08-30 03:15:46,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2023-08-30 03:15:46,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2023-08-30 03:15:46,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2023-08-30 03:15:46,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2023-08-30 03:15:46,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2023-08-30 03:15:46,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2023-08-30 03:15:46,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2023-08-30 03:15:46,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2023-08-30 03:15:46,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2023-08-30 03:15:46,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2023-08-30 03:15:46,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2023-08-30 03:15:46,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2023-08-30 03:15:46,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2023-08-30 03:15:46,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2023-08-30 03:15:46,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 03:15:46,342 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:46,349 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:15:46,349 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:15:46,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:15:46 BasicIcfg [2023-08-30 03:15:46,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:15:46,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:15:46,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:15:46,446 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:15:46,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:15:18" (3/4) ... [2023-08-30 03:15:46,449 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:15:46,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:15:46,450 INFO L158 Benchmark]: Toolchain (without parser) took 30010.36ms. Allocated memory was 90.2MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 69.3MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-08-30 03:15:46,450 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:15:46,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.44ms. Allocated memory is still 90.2MB. Free memory was 69.0MB in the beginning and 66.0MB in the end (delta: 2.9MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2023-08-30 03:15:46,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.22ms. Allocated memory is still 90.2MB. Free memory was 66.0MB in the beginning and 64.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:15:46,452 INFO L158 Benchmark]: Boogie Preprocessor took 38.44ms. Allocated memory is still 90.2MB. Free memory was 64.0MB in the beginning and 61.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:15:46,453 INFO L158 Benchmark]: RCFGBuilder took 1243.42ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 61.4MB in the beginning and 79.0MB in the end (delta: -17.6MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2023-08-30 03:15:46,453 INFO L158 Benchmark]: TraceAbstraction took 28215.40ms. Allocated memory was 109.1MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 77.7MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-08-30 03:15:46,453 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 5.0GB. Free memory is still 3.6GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:15:46,455 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.44ms. Allocated memory is still 90.2MB. Free memory was 69.0MB in the beginning and 66.0MB in the end (delta: 2.9MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.22ms. Allocated memory is still 90.2MB. Free memory was 66.0MB in the beginning and 64.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.44ms. Allocated memory is still 90.2MB. Free memory was 64.0MB in the beginning and 61.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1243.42ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 61.4MB in the beginning and 79.0MB in the end (delta: -17.6MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * TraceAbstraction took 28215.40ms. Allocated memory was 109.1MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 77.7MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 5.0GB. Free memory is still 3.6GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 178 PlacesBefore, 82 PlacesAfterwards, 170 TransitionsBefore, 72 TransitionsAfterwards, 6704 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 138 TotalNumberOfCompositions, 36334 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9005, independent: 8378, independent conditional: 0, independent unconditional: 8378, dependent: 627, dependent conditional: 0, dependent unconditional: 627, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2669, independent: 2579, independent conditional: 0, independent unconditional: 2579, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9005, independent: 5799, independent conditional: 0, independent unconditional: 5799, dependent: 537, dependent conditional: 0, dependent unconditional: 537, unknown: 2669, unknown conditional: 0, unknown unconditional: 2669] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 357, Positive conditional cache size: 0, Positive unconditional cache size: 357, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, 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; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2269, ((void *)0), P0, ((void *)0))=-2, t2269={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] [L851] 0 pthread_t t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2270, ((void *)0), P1, ((void *)0))=-1, t2269={6:0}, t2270={7: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] [L853] 0 pthread_t t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2271, ((void *)0), P2, ((void *)0))=0, t2269={6:0}, t2270={7:0}, t2271={5: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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$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] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$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] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=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] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=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] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L827] 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) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] 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) [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=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] [L789] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=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] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=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] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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, t2269={6:0}, t2270={7:0}, t2271={5:0}, weak$$choice1=0, 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] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L871] 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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: 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, 231 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: 27.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1159 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 824 mSDsluCounter, 547 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 431 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2461 IncrementalHoareTripleChecker+Invalid, 2709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 116 mSDtfsCounter, 2461 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=593occurred in iteration=10, InterpolantAutomatonStates: 66, 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.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 1354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:15:46,499 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/safe020_rmo.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 d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:15:48,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:15:48,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:15:48,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:15:48,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:15:48,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:15:48,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:15:48,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:15:48,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:15:48,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:15:48,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:15:48,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:15:48,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:15:48,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:15:48,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:15:48,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:15:48,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:15:48,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:15:48,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:15:48,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:15:48,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:15:48,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:15:48,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:15:48,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:15:48,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:15:48,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:15:48,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:15:48,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:15:48,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:15:48,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:15:48,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:15:48,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:15:48,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:15:48,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:15:48,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:15:48,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:15:48,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:15:48,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:15:48,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:15:48,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:15:48,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:15:48,703 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 03:15:48,734 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:15:48,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:15:48,735 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:15:48,736 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:15:48,736 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:15:48,737 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:15:48,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:15:48,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:15:48,738 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:15:48,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:15:48,738 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:15:48,739 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:15:48,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:15:48,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:15:48,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:15:48,739 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:15:48,739 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:15:48,740 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:15:48,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:15:48,740 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:15:48,740 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 03:15:48,740 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 03:15:48,740 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:15:48,740 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:15:48,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:15:48,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:15:48,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:15:48,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:15:48,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:15:48,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:15:48,742 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 03:15:48,742 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 03:15:48,742 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:15:48,742 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:15:48,742 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:15:48,742 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 03:15:48,743 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:15:48,743 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 -> d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:15:49,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:15:49,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:15:49,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:15:49,089 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:15:49,089 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:15:49,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2023-08-30 03:15:50,360 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:15:50,634 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:15:50,638 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2023-08-30 03:15:50,663 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0d9eb035/b03ba531566845caae81584c838999ef/FLAGbe74247ca [2023-08-30 03:15:50,686 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0d9eb035/b03ba531566845caae81584c838999ef [2023-08-30 03:15:50,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:15:50,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:15:50,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:15:50,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:15:50,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:15:50,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:15:50" (1/1) ... [2023-08-30 03:15:50,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3e13d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:50, skipping insertion in model container [2023-08-30 03:15:50,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:15:50" (1/1) ... [2023-08-30 03:15:50,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:15:50,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:15:50,930 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/safe020_rmo.i[988,1001] [2023-08-30 03:15:51,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:15:51,172 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:15:51,201 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/safe020_rmo.i[988,1001] [2023-08-30 03:15:51,261 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:15:51,300 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:15:51,301 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:15:51,305 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:15:51,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:51 WrapperNode [2023-08-30 03:15:51,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:15:51,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:15:51,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:15:51,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:15:51,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:51" (1/1) ... [2023-08-30 03:15:51,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:51" (1/1) ... [2023-08-30 03:15:51,345 INFO L138 Inliner]: procedures = 180, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2023-08-30 03:15:51,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:15:51,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:15:51,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:15:51,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:15:51,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:51" (1/1) ... [2023-08-30 03:15:51,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:51" (1/1) ... [2023-08-30 03:15:51,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:51" (1/1) ... [2023-08-30 03:15:51,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:51" (1/1) ... [2023-08-30 03:15:51,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:51" (1/1) ... [2023-08-30 03:15:51,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:51" (1/1) ... [2023-08-30 03:15:51,386 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:51" (1/1) ... [2023-08-30 03:15:51,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:51" (1/1) ... [2023-08-30 03:15:51,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:15:51,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:15:51,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:15:51,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:15:51,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:51" (1/1) ... [2023-08-30 03:15:51,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:15:51,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:15:51,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:15:51,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:15:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 03:15:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:15:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:15:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:15:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:15:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 03:15:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 03:15:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-30 03:15:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:15:51,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:15:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:15:51,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:15:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:15:51,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:15:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:15:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:15:51,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:15:51,454 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:15:51,640 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:15:51,642 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:15:52,345 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:15:52,711 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:15:52,711 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:15:52,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:15:52 BoogieIcfgContainer [2023-08-30 03:15:52,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:15:52,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:15:52,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:15:52,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:15:52,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:15:50" (1/3) ... [2023-08-30 03:15:52,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f786f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:15:52, skipping insertion in model container [2023-08-30 03:15:52,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:51" (2/3) ... [2023-08-30 03:15:52,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f786f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:15:52, skipping insertion in model container [2023-08-30 03:15:52,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:15:52" (3/3) ... [2023-08-30 03:15:52,720 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2023-08-30 03:15:52,736 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:15:52,737 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-08-30 03:15:52,737 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:15:52,857 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:15:52,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 174 transitions, 363 flow [2023-08-30 03:15:52,957 INFO L130 PetriNetUnfolder]: 2/171 cut-off events. [2023-08-30 03:15:52,957 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:15:52,962 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 14. Compared 257 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-30 03:15:52,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 174 transitions, 363 flow [2023-08-30 03:15:52,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 171 transitions, 351 flow [2023-08-30 03:15:52,970 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:15:52,977 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 171 transitions, 351 flow [2023-08-30 03:15:52,979 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 171 transitions, 351 flow [2023-08-30 03:15:52,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 171 transitions, 351 flow [2023-08-30 03:15:53,013 INFO L130 PetriNetUnfolder]: 2/171 cut-off events. [2023-08-30 03:15:53,014 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:15:53,015 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 14. Compared 254 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-30 03:15:53,018 INFO L119 LiptonReduction]: Number of co-enabled transitions 6704 [2023-08-30 03:16:02,335 INFO L134 LiptonReduction]: Checked pairs total: 36761 [2023-08-30 03:16:02,335 INFO L136 LiptonReduction]: Total number of compositions: 144 [2023-08-30 03:16:02,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:16:02,353 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;@39b997fe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:16:02,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-08-30 03:16:02,355 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:16:02,355 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:16:02,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:02,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:16:02,357 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:02,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2023-08-30 03:16:02,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:02,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040570473] [2023-08-30 03:16:02,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:02,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:02,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:02,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:02,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 03:16:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:02,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 03:16:02,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:02,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:02,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:02,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040570473] [2023-08-30 03:16:02,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040570473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:02,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:02,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:16:02,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119199004] [2023-08-30 03:16:02,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:02,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:16:02,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:02,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:16:02,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:16:02,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 318 [2023-08-30 03:16:02,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:02,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:02,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 318 [2023-08-30 03:16:02,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:06,562 INFO L130 PetriNetUnfolder]: 23428/32747 cut-off events. [2023-08-30 03:16:06,562 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-08-30 03:16:06,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65513 conditions, 32747 events. 23428/32747 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 2482. Compared 216244 event pairs, 23428 based on Foata normal form. 0/13673 useless extension candidates. Maximal degree in co-relation 65502. Up to 32628 conditions per place. [2023-08-30 03:16:06,798 INFO L137 encePairwiseOnDemand]: 292/318 looper letters, 45 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2023-08-30 03:16:06,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 191 flow [2023-08-30 03:16:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:16:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:16:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 319 transitions. [2023-08-30 03:16:06,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015723270440252 [2023-08-30 03:16:06,815 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 319 transitions. [2023-08-30 03:16:06,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 319 transitions. [2023-08-30 03:16:06,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:06,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 319 transitions. [2023-08-30 03:16:06,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 159.5) internal successors, (319), 2 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:06,829 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-30 03:16:06,830 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-30 03:16:06,832 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 153 flow. Second operand 2 states and 319 transitions. [2023-08-30 03:16:06,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 191 flow [2023-08-30 03:16:06,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:16:06,844 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 98 flow [2023-08-30 03:16:06,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-08-30 03:16:06,851 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -28 predicate places. [2023-08-30 03:16:06,851 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 98 flow [2023-08-30 03:16:06,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:06,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:06,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:16:06,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:07,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:07,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:07,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash 30702894, now seen corresponding path program 1 times [2023-08-30 03:16:07,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:07,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789825589] [2023-08-30 03:16:07,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:07,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:07,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:07,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:07,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 03:16:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:07,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:16:07,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:07,269 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-30 03:16:07,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-30 03:16:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:07,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:07,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:07,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789825589] [2023-08-30 03:16:07,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789825589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:07,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:07,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:16:07,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129208100] [2023-08-30 03:16:07,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:07,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:16:07,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:07,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:16:07,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:16:07,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 318 [2023-08-30 03:16:07,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:07,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:07,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 318 [2023-08-30 03:16:07,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:09,498 INFO L130 PetriNetUnfolder]: 11451/16247 cut-off events. [2023-08-30 03:16:09,499 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:16:09,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32509 conditions, 16247 events. 11451/16247 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 98888 event pairs, 6971 based on Foata normal form. 0/8237 useless extension candidates. Maximal degree in co-relation 32506. Up to 8366 conditions per place. [2023-08-30 03:16:09,587 INFO L137 encePairwiseOnDemand]: 307/318 looper letters, 57 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-30 03:16:09,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 244 flow [2023-08-30 03:16:09,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:16:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:16:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-30 03:16:09,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44863731656184486 [2023-08-30 03:16:09,590 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-30 03:16:09,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-30 03:16:09,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:09,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-30 03:16:09,592 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-30 03:16:09,594 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-30 03:16:09,595 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-30 03:16:09,595 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 98 flow. Second operand 3 states and 428 transitions. [2023-08-30 03:16:09,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 244 flow [2023-08-30 03:16:09,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:16:09,597 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 114 flow [2023-08-30 03:16:09,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-30 03:16:09,598 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -27 predicate places. [2023-08-30 03:16:09,598 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 114 flow [2023-08-30 03:16:09,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:09,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:09,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:16:09,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:09,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:09,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:09,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash 30702895, now seen corresponding path program 1 times [2023-08-30 03:16:09,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:09,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295761343] [2023-08-30 03:16:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:09,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:09,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:09,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:09,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 03:16:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:09,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:16:09,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:09,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 03:16:09,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 03:16:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:09,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:09,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:09,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295761343] [2023-08-30 03:16:09,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295761343] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:09,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:09,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:16:09,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908038796] [2023-08-30 03:16:09,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:09,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:16:09,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:09,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:16:09,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:16:10,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 318 [2023-08-30 03:16:10,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:10,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:10,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 318 [2023-08-30 03:16:10,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:10,577 INFO L130 PetriNetUnfolder]: 3309/4830 cut-off events. [2023-08-30 03:16:10,578 INFO L131 PetriNetUnfolder]: For 486/486 co-relation queries the response was YES. [2023-08-30 03:16:10,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10840 conditions, 4830 events. 3309/4830 cut-off events. For 486/486 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 25020 event pairs, 3309 based on Foata normal form. 0/4097 useless extension candidates. Maximal degree in co-relation 10835. Up to 4798 conditions per place. [2023-08-30 03:16:10,608 INFO L137 encePairwiseOnDemand]: 308/318 looper letters, 33 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-30 03:16:10,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 35 transitions, 164 flow [2023-08-30 03:16:10,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:16:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:16:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-30 03:16:10,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43186582809224316 [2023-08-30 03:16:10,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-30 03:16:10,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-30 03:16:10,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:10,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-30 03:16:10,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:10,615 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-30 03:16:10,616 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-30 03:16:10,616 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 114 flow. Second operand 3 states and 412 transitions. [2023-08-30 03:16:10,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 35 transitions, 164 flow [2023-08-30 03:16:10,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 35 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:16:10,619 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 94 flow [2023-08-30 03:16:10,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=94, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-08-30 03:16:10,620 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -36 predicate places. [2023-08-30 03:16:10,620 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 94 flow [2023-08-30 03:16:10,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:10,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:10,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:10,633 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-30 03:16:10,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:10,831 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:10,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2003567774, now seen corresponding path program 1 times [2023-08-30 03:16:10,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:10,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214694756] [2023-08-30 03:16:10,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:10,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:10,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:10,833 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:10,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 03:16:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:11,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:16:11,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:11,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:11,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:11,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214694756] [2023-08-30 03:16:11,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214694756] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:11,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:11,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:16:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160138689] [2023-08-30 03:16:11,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:11,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:16:11,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:11,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:16:11,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:16:11,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 318 [2023-08-30 03:16:11,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:11,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:11,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 318 [2023-08-30 03:16:11,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:11,389 INFO L130 PetriNetUnfolder]: 1212/1972 cut-off events. [2023-08-30 03:16:11,389 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2023-08-30 03:16:11,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4336 conditions, 1972 events. 1212/1972 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10055 event pairs, 461 based on Foata normal form. 27/1698 useless extension candidates. Maximal degree in co-relation 4331. Up to 1830 conditions per place. [2023-08-30 03:16:11,398 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 45 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2023-08-30 03:16:11,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 226 flow [2023-08-30 03:16:11,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:16:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:16:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-30 03:16:11,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.429769392033543 [2023-08-30 03:16:11,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-30 03:16:11,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-30 03:16:11,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:11,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-30 03:16:11,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:11,403 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-30 03:16:11,404 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-30 03:16:11,404 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 94 flow. Second operand 3 states and 410 transitions. [2023-08-30 03:16:11,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 226 flow [2023-08-30 03:16:11,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:16:11,406 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 119 flow [2023-08-30 03:16:11,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-30 03:16:11,408 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -34 predicate places. [2023-08-30 03:16:11,408 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 119 flow [2023-08-30 03:16:11,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:11,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:11,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:11,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:11,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:11,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:11,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1513001801, now seen corresponding path program 1 times [2023-08-30 03:16:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:11,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151721091] [2023-08-30 03:16:11,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:11,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:11,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:11,626 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:11,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 03:16:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:11,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:16:11,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:11,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:11,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:11,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151721091] [2023-08-30 03:16:11,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151721091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:11,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:11,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:16:11,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43152832] [2023-08-30 03:16:11,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:11,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:16:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:11,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:16:11,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:16:11,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 318 [2023-08-30 03:16:11,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:11,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:11,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 318 [2023-08-30 03:16:11,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:12,034 INFO L130 PetriNetUnfolder]: 273/535 cut-off events. [2023-08-30 03:16:12,035 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-30 03:16:12,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 535 events. 273/535 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2144 event pairs, 101 based on Foata normal form. 27/506 useless extension candidates. Maximal degree in co-relation 1306. Up to 276 conditions per place. [2023-08-30 03:16:12,037 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 54 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-08-30 03:16:12,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 301 flow [2023-08-30 03:16:12,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:16:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:16:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2023-08-30 03:16:12,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4261006289308176 [2023-08-30 03:16:12,039 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2023-08-30 03:16:12,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2023-08-30 03:16:12,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:12,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2023-08-30 03:16:12,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:12,043 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-30 03:16:12,043 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-30 03:16:12,044 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 119 flow. Second operand 4 states and 542 transitions. [2023-08-30 03:16:12,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 301 flow [2023-08-30 03:16:12,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:16:12,045 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 155 flow [2023-08-30 03:16:12,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-30 03:16:12,046 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -31 predicate places. [2023-08-30 03:16:12,046 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 155 flow [2023-08-30 03:16:12,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:12,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:12,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:12,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:12,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:12,264 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:12,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1772314334, now seen corresponding path program 1 times [2023-08-30 03:16:12,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:12,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874682626] [2023-08-30 03:16:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:12,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:12,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:12,267 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:12,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 03:16:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:12,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:16:12,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:12,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:12,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:12,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874682626] [2023-08-30 03:16:12,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874682626] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:12,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:12,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:16:12,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414406207] [2023-08-30 03:16:12,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:12,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:16:12,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:12,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:16:12,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:16:12,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 318 [2023-08-30 03:16:12,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:12,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:12,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 318 [2023-08-30 03:16:12,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:12,679 INFO L130 PetriNetUnfolder]: 162/306 cut-off events. [2023-08-30 03:16:12,679 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2023-08-30 03:16:12,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 306 events. 162/306 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1015 event pairs, 70 based on Foata normal form. 9/310 useless extension candidates. Maximal degree in co-relation 825. Up to 134 conditions per place. [2023-08-30 03:16:12,680 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 43 selfloop transitions, 10 changer transitions 1/55 dead transitions. [2023-08-30 03:16:12,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 283 flow [2023-08-30 03:16:12,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:16:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:16:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-08-30 03:16:12,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119496855345912 [2023-08-30 03:16:12,683 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-08-30 03:16:12,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-08-30 03:16:12,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:12,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-08-30 03:16:12,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:12,687 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-30 03:16:12,688 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-30 03:16:12,688 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 155 flow. Second operand 5 states and 655 transitions. [2023-08-30 03:16:12,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 283 flow [2023-08-30 03:16:12,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 267 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 03:16:12,690 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-08-30 03:16:12,690 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-30 03:16:12,691 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -36 predicate places. [2023-08-30 03:16:12,691 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-08-30 03:16:12,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:12,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:12,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:12,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:12,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:12,902 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:12,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:12,902 INFO L85 PathProgramCache]: Analyzing trace with hash 13606007, now seen corresponding path program 1 times [2023-08-30 03:16:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:12,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378006273] [2023-08-30 03:16:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:12,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:12,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:12,904 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:12,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 03:16:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:13,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:16:13,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:13,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:13,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:13,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378006273] [2023-08-30 03:16:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378006273] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:13,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:13,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:16:13,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394546223] [2023-08-30 03:16:13,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:13,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:16:13,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:13,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:16:13,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:16:13,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 318 [2023-08-30 03:16:13,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:13,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:13,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 318 [2023-08-30 03:16:13,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:13,263 INFO L130 PetriNetUnfolder]: 225/419 cut-off events. [2023-08-30 03:16:13,263 INFO L131 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2023-08-30 03:16:13,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 419 events. 225/419 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1483 event pairs, 131 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 1203. Up to 304 conditions per place. [2023-08-30 03:16:13,265 INFO L137 encePairwiseOnDemand]: 315/318 looper letters, 53 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-30 03:16:13,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 351 flow [2023-08-30 03:16:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:16:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:16:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-30 03:16:13,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42662473794549266 [2023-08-30 03:16:13,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-30 03:16:13,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-30 03:16:13,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:13,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-30 03:16:13,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:13,270 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-30 03:16:13,270 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-30 03:16:13,270 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 3 states and 407 transitions. [2023-08-30 03:16:13,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 351 flow [2023-08-30 03:16:13,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 301 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 03:16:13,276 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 123 flow [2023-08-30 03:16:13,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-30 03:16:13,277 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -37 predicate places. [2023-08-30 03:16:13,277 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 123 flow [2023-08-30 03:16:13,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:13,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:13,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:13,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:13,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:13,485 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:13,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:13,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1459837702, now seen corresponding path program 1 times [2023-08-30 03:16:13,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:13,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932724100] [2023-08-30 03:16:13,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:13,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:13,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:13,488 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:13,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 03:16:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:13,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 03:16:13,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:13,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:13,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:13,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932724100] [2023-08-30 03:16:13,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932724100] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:13,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:13,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:16:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656689353] [2023-08-30 03:16:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:13,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:16:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:13,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:16:13,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:16:13,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 318 [2023-08-30 03:16:13,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:13,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:13,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 318 [2023-08-30 03:16:13,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:13,841 INFO L130 PetriNetUnfolder]: 205/397 cut-off events. [2023-08-30 03:16:13,841 INFO L131 PetriNetUnfolder]: For 246/246 co-relation queries the response was YES. [2023-08-30 03:16:13,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 397 events. 205/397 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1399 event pairs, 106 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 1102. Up to 208 conditions per place. [2023-08-30 03:16:13,843 INFO L137 encePairwiseOnDemand]: 315/318 looper letters, 38 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-08-30 03:16:13,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 235 flow [2023-08-30 03:16:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:16:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:16:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-30 03:16:13,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4109014675052411 [2023-08-30 03:16:13,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-30 03:16:13,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-30 03:16:13,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:13,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-30 03:16:13,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:13,846 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-30 03:16:13,846 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-30 03:16:13,846 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 123 flow. Second operand 3 states and 392 transitions. [2023-08-30 03:16:13,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 235 flow [2023-08-30 03:16:13,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:16:13,848 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 123 flow [2023-08-30 03:16:13,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=123, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-30 03:16:13,849 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -37 predicate places. [2023-08-30 03:16:13,849 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 123 flow [2023-08-30 03:16:13,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:13,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:13,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:13,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:14,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:14,053 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:14,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1924520863, now seen corresponding path program 1 times [2023-08-30 03:16:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:14,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979416997] [2023-08-30 03:16:14,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:14,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:14,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:14,055 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:14,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 03:16:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:14,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:16:14,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:14,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:14,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:14,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979416997] [2023-08-30 03:16:14,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979416997] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:14,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:14,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:16:14,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643585880] [2023-08-30 03:16:14,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:14,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:16:14,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:14,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:16:14,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:16:14,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 318 [2023-08-30 03:16:14,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:14,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:14,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 318 [2023-08-30 03:16:14,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:14,579 INFO L130 PetriNetUnfolder]: 205/395 cut-off events. [2023-08-30 03:16:14,579 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2023-08-30 03:16:14,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 395 events. 205/395 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1389 event pairs, 106 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 1104. Up to 212 conditions per place. [2023-08-30 03:16:14,582 INFO L137 encePairwiseOnDemand]: 315/318 looper letters, 37 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-08-30 03:16:14,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 233 flow [2023-08-30 03:16:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:16:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:16:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2023-08-30 03:16:14,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.404874213836478 [2023-08-30 03:16:14,584 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2023-08-30 03:16:14,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2023-08-30 03:16:14,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:14,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2023-08-30 03:16:14,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:14,588 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-30 03:16:14,588 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-30 03:16:14,589 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 123 flow. Second operand 4 states and 515 transitions. [2023-08-30 03:16:14,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 233 flow [2023-08-30 03:16:14,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 229 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:16:14,591 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 121 flow [2023-08-30 03:16:14,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-30 03:16:14,592 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -37 predicate places. [2023-08-30 03:16:14,592 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 121 flow [2023-08-30 03:16:14,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:14,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:14,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:14,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:14,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:14,804 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:14,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:14,804 INFO L85 PathProgramCache]: Analyzing trace with hash -968097561, now seen corresponding path program 2 times [2023-08-30 03:16:14,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:14,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840918631] [2023-08-30 03:16:14,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 03:16:14,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:14,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:14,806 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:14,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 03:16:14,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:16:14,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:16:14,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 03:16:15,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:15,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 03:16:15,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2023-08-30 03:16:16,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-08-30 03:16:16,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2023-08-30 03:16:17,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-08-30 03:16:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:17,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:17,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:17,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840918631] [2023-08-30 03:16:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840918631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:17,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:17,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:16:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509066982] [2023-08-30 03:16:17,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:17,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:16:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:17,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:16:17,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:16:18,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 318 [2023-08-30 03:16:18,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 121 flow. Second operand has 8 states, 8 states have (on average 112.5) internal successors, (900), 8 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:18,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:18,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 318 [2023-08-30 03:16:18,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:18,783 INFO L130 PetriNetUnfolder]: 299/585 cut-off events. [2023-08-30 03:16:18,783 INFO L131 PetriNetUnfolder]: For 392/392 co-relation queries the response was YES. [2023-08-30 03:16:18,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1675 conditions, 585 events. 299/585 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2639 event pairs, 119 based on Foata normal form. 1/586 useless extension candidates. Maximal degree in co-relation 1667. Up to 333 conditions per place. [2023-08-30 03:16:18,787 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 58 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2023-08-30 03:16:18,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 399 flow [2023-08-30 03:16:18,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:16:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:16:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 707 transitions. [2023-08-30 03:16:18,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37054507337526205 [2023-08-30 03:16:18,791 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 707 transitions. [2023-08-30 03:16:18,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 707 transitions. [2023-08-30 03:16:18,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:18,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 707 transitions. [2023-08-30 03:16:18,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:18,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 318.0) internal successors, (2226), 7 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:18,795 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 318.0) internal successors, (2226), 7 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:18,796 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 121 flow. Second operand 6 states and 707 transitions. [2023-08-30 03:16:18,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 399 flow [2023-08-30 03:16:18,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:16:18,799 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 157 flow [2023-08-30 03:16:18,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=157, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-08-30 03:16:18,800 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -32 predicate places. [2023-08-30 03:16:18,800 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 157 flow [2023-08-30 03:16:18,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.5) internal successors, (900), 8 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:18,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:18,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:18,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:19,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:19,012 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:19,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash -133618203, now seen corresponding path program 3 times [2023-08-30 03:16:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633101904] [2023-08-30 03:16:19,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 03:16:19,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:19,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:19,014 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:19,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-30 03:16:19,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 03:16:19,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:16:19,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 03:16:19,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:19,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:16:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:19,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:19,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:19,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633101904] [2023-08-30 03:16:19,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633101904] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:19,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:19,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:16:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356331344] [2023-08-30 03:16:19,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:19,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:16:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:19,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:16:19,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:16:19,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 318 [2023-08-30 03:16:19,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:19,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:19,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 318 [2023-08-30 03:16:19,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:19,759 INFO L130 PetriNetUnfolder]: 418/836 cut-off events. [2023-08-30 03:16:19,759 INFO L131 PetriNetUnfolder]: For 743/743 co-relation queries the response was YES. [2023-08-30 03:16:19,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 836 events. 418/836 cut-off events. For 743/743 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4256 event pairs, 173 based on Foata normal form. 1/837 useless extension candidates. Maximal degree in co-relation 2623. Up to 536 conditions per place. [2023-08-30 03:16:19,762 INFO L137 encePairwiseOnDemand]: 310/318 looper letters, 68 selfloop transitions, 13 changer transitions 0/82 dead transitions. [2023-08-30 03:16:19,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 506 flow [2023-08-30 03:16:19,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:16:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:16:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2023-08-30 03:16:19,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39832285115303984 [2023-08-30 03:16:19,766 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 760 transitions. [2023-08-30 03:16:19,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 760 transitions. [2023-08-30 03:16:19,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:19,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 760 transitions. [2023-08-30 03:16:19,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:19,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 318.0) internal successors, (2226), 7 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:19,773 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 318.0) internal successors, (2226), 7 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:19,773 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 157 flow. Second operand 6 states and 760 transitions. [2023-08-30 03:16:19,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 506 flow [2023-08-30 03:16:19,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 82 transitions, 505 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:16:19,779 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 247 flow [2023-08-30 03:16:19,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-08-30 03:16:19,779 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -25 predicate places. [2023-08-30 03:16:19,779 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 247 flow [2023-08-30 03:16:19,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:19,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:19,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:19,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:19,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:19,988 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:19,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash 994286969, now seen corresponding path program 4 times [2023-08-30 03:16:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:19,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978904776] [2023-08-30 03:16:19,989 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 03:16:19,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:19,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:19,990 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:19,990 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 (13)] Waiting until timeout for monitored process [2023-08-30 03:16:20,122 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 03:16:20,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:16:20,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 03:16:20,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:20,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:16:20,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:16:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:20,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:20,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:20,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978904776] [2023-08-30 03:16:20,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978904776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:20,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:20,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:16:20,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58612185] [2023-08-30 03:16:20,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:20,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:16:20,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:20,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:16:20,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:16:20,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 318 [2023-08-30 03:16:20,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:20,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:20,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 318 [2023-08-30 03:16:20,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:21,011 INFO L130 PetriNetUnfolder]: 537/1125 cut-off events. [2023-08-30 03:16:21,011 INFO L131 PetriNetUnfolder]: For 1985/1993 co-relation queries the response was YES. [2023-08-30 03:16:21,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4350 conditions, 1125 events. 537/1125 cut-off events. For 1985/1993 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6473 event pairs, 103 based on Foata normal form. 9/1134 useless extension candidates. Maximal degree in co-relation 4337. Up to 462 conditions per place. [2023-08-30 03:16:21,016 INFO L137 encePairwiseOnDemand]: 310/318 looper letters, 80 selfloop transitions, 20 changer transitions 0/101 dead transitions. [2023-08-30 03:16:21,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 101 transitions, 732 flow [2023-08-30 03:16:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:16:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:16:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2023-08-30 03:16:21,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38469601677148846 [2023-08-30 03:16:21,019 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 734 transitions. [2023-08-30 03:16:21,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 734 transitions. [2023-08-30 03:16:21,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:21,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 734 transitions. [2023-08-30 03:16:21,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:21,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 318.0) internal successors, (2226), 7 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:21,024 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 318.0) internal successors, (2226), 7 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:21,025 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 247 flow. Second operand 6 states and 734 transitions. [2023-08-30 03:16:21,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 101 transitions, 732 flow [2023-08-30 03:16:21,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 721 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 03:16:21,034 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 376 flow [2023-08-30 03:16:21,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-08-30 03:16:21,035 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -19 predicate places. [2023-08-30 03:16:21,035 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 376 flow [2023-08-30 03:16:21,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:21,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:21,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:21,048 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 (13)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:21,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:21,249 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:21,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1861225729, now seen corresponding path program 5 times [2023-08-30 03:16:21,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:21,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282119667] [2023-08-30 03:16:21,250 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 03:16:21,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:21,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:21,251 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:21,251 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 (14)] Waiting until timeout for monitored process [2023-08-30 03:16:21,390 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:16:21,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:16:21,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-30 03:16:21,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:21,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:16:21,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:16:21,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:16:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:21,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:21,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:21,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282119667] [2023-08-30 03:16:21,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282119667] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:21,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:21,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:16:21,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640433515] [2023-08-30 03:16:21,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:21,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:16:21,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:21,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:16:21,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:16:22,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 318 [2023-08-30 03:16:22,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 376 flow. Second operand has 8 states, 8 states have (on average 113.5) internal successors, (908), 8 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:22,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:22,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 318 [2023-08-30 03:16:22,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:22,997 INFO L130 PetriNetUnfolder]: 665/1431 cut-off events. [2023-08-30 03:16:22,997 INFO L131 PetriNetUnfolder]: For 3980/3996 co-relation queries the response was YES. [2023-08-30 03:16:23,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5982 conditions, 1431 events. 665/1431 cut-off events. For 3980/3996 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9056 event pairs, 133 based on Foata normal form. 17/1448 useless extension candidates. Maximal degree in co-relation 5966. Up to 477 conditions per place. [2023-08-30 03:16:23,005 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 93 selfloop transitions, 16 changer transitions 0/110 dead transitions. [2023-08-30 03:16:23,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 110 transitions, 900 flow [2023-08-30 03:16:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:16:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:16:23,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2023-08-30 03:16:23,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38155136268343814 [2023-08-30 03:16:23,015 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2023-08-30 03:16:23,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2023-08-30 03:16:23,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:23,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2023-08-30 03:16:23,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:23,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 318.0) internal successors, (2226), 7 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:23,022 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 318.0) internal successors, (2226), 7 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:23,022 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 376 flow. Second operand 6 states and 728 transitions. [2023-08-30 03:16:23,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 110 transitions, 900 flow [2023-08-30 03:16:23,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 110 transitions, 885 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-08-30 03:16:23,039 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 452 flow [2023-08-30 03:16:23,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=452, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-08-30 03:16:23,040 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -12 predicate places. [2023-08-30 03:16:23,040 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 452 flow [2023-08-30 03:16:23,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.5) internal successors, (908), 8 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:23,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:23,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:23,054 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 (14)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:23,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:23,252 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:16:23,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:23,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2042933163, now seen corresponding path program 6 times [2023-08-30 03:16:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:23,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177225951] [2023-08-30 03:16:23,253 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 03:16:23,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:23,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:23,254 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:23,257 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 (15)] Waiting until timeout for monitored process [2023-08-30 03:16:23,463 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-30 03:16:23,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 03:16:23,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:16:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:16:23,672 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 03:16:23,672 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:16:23,673 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2023-08-30 03:16:23,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2023-08-30 03:16:23,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2023-08-30 03:16:23,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2023-08-30 03:16:23,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2023-08-30 03:16:23,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2023-08-30 03:16:23,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2023-08-30 03:16:23,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2023-08-30 03:16:23,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2023-08-30 03:16:23,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2023-08-30 03:16:23,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2023-08-30 03:16:23,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2023-08-30 03:16:23,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2023-08-30 03:16:23,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2023-08-30 03:16:23,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2023-08-30 03:16:23,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2023-08-30 03:16:23,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2023-08-30 03:16:23,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2023-08-30 03:16:23,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2023-08-30 03:16:23,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2023-08-30 03:16:23,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2023-08-30 03:16:23,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2023-08-30 03:16:23,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2023-08-30 03:16:23,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2023-08-30 03:16:23,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2023-08-30 03:16:23,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2023-08-30 03:16:23,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2023-08-30 03:16:23,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2023-08-30 03:16:23,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2023-08-30 03:16:23,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2023-08-30 03:16:23,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2023-08-30 03:16:23,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2023-08-30 03:16:23,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2023-08-30 03:16:23,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2023-08-30 03:16:23,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2023-08-30 03:16:23,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2023-08-30 03:16:23,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2023-08-30 03:16:23,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2023-08-30 03:16:23,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2023-08-30 03:16:23,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2023-08-30 03:16:23,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2023-08-30 03:16:23,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2023-08-30 03:16:23,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2023-08-30 03:16:23,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2023-08-30 03:16:23,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2023-08-30 03:16:23,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2023-08-30 03:16:23,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2023-08-30 03:16:23,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2023-08-30 03:16:23,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2023-08-30 03:16:23,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2023-08-30 03:16:23,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2023-08-30 03:16:23,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2023-08-30 03:16:23,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2023-08-30 03:16:23,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2023-08-30 03:16:23,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2023-08-30 03:16:23,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2023-08-30 03:16:23,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2023-08-30 03:16:23,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2023-08-30 03:16:23,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2023-08-30 03:16:23,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2023-08-30 03:16:23,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2023-08-30 03:16:23,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2023-08-30 03:16:23,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2023-08-30 03:16:23,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2023-08-30 03:16:23,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2023-08-30 03:16:23,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2023-08-30 03:16:23,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2023-08-30 03:16:23,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2023-08-30 03:16:23,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2023-08-30 03:16:23,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2023-08-30 03:16:23,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2023-08-30 03:16:23,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2023-08-30 03:16:23,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2023-08-30 03:16:23,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2023-08-30 03:16:23,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2023-08-30 03:16:23,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2023-08-30 03:16:23,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2023-08-30 03:16:23,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2023-08-30 03:16:23,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2023-08-30 03:16:23,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2023-08-30 03:16:23,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2023-08-30 03:16:23,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2023-08-30 03:16:23,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2023-08-30 03:16:23,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2023-08-30 03:16:23,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2023-08-30 03:16:23,699 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 (15)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:23,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:23,897 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:23,903 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:16:23,903 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:16:23,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:16:23 BasicIcfg [2023-08-30 03:16:24,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:16:24,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:16:24,004 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:16:24,004 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:16:24,005 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:15:52" (3/4) ... [2023-08-30 03:16:24,007 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:16:24,007 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:16:24,007 INFO L158 Benchmark]: Toolchain (without parser) took 33315.30ms. Allocated memory was 73.4MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 49.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-08-30 03:16:24,008 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 56.6MB. Free memory is still 34.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:16:24,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.97ms. Allocated memory is still 73.4MB. Free memory was 49.6MB in the beginning and 43.5MB in the end (delta: 6.2MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-08-30 03:16:24,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.85ms. Allocated memory is still 73.4MB. Free memory was 43.5MB in the beginning and 41.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:16:24,008 INFO L158 Benchmark]: Boogie Preprocessor took 44.77ms. Allocated memory is still 73.4MB. Free memory was 41.0MB in the beginning and 38.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:16:24,009 INFO L158 Benchmark]: RCFGBuilder took 1321.07ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 38.5MB in the beginning and 37.4MB in the end (delta: 1.1MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2023-08-30 03:16:24,010 INFO L158 Benchmark]: TraceAbstraction took 31288.50ms. Allocated memory was 88.1MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 36.7MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-08-30 03:16:24,010 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 3.2GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:16:24,011 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.12ms. Allocated memory is still 56.6MB. Free memory is still 34.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 611.97ms. Allocated memory is still 73.4MB. Free memory was 49.6MB in the beginning and 43.5MB in the end (delta: 6.2MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.85ms. Allocated memory is still 73.4MB. Free memory was 43.5MB in the beginning and 41.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.77ms. Allocated memory is still 73.4MB. Free memory was 41.0MB in the beginning and 38.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1321.07ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 38.5MB in the beginning and 37.4MB in the end (delta: 1.1MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * TraceAbstraction took 31288.50ms. Allocated memory was 88.1MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 36.7MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 3.2GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 179 PlacesBefore, 82 PlacesAfterwards, 171 TransitionsBefore, 72 TransitionsAfterwards, 6704 CoEnabledTransitionPairs, 7 FixpointIterations, 66 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 144 TotalNumberOfCompositions, 36761 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8479, independent: 7846, independent conditional: 0, independent unconditional: 7846, dependent: 633, dependent conditional: 0, dependent unconditional: 633, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2688, independent: 2594, independent conditional: 0, independent unconditional: 2594, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8479, independent: 5252, independent conditional: 0, independent unconditional: 5252, dependent: 539, dependent conditional: 0, dependent unconditional: 539, unknown: 2688, unknown conditional: 0, unknown unconditional: 2688] , Statistics on independence cache: Total cache size (in pairs): 365, Positive cache size: 319, Positive conditional cache size: 0, Positive unconditional cache size: 319, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, 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; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2269, ((void *)0), P0, ((void *)0))=-2, t2269={7: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] [L851] 0 pthread_t t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2270, ((void *)0), P1, ((void *)0))=-1, t2269={7:0}, t2270={14: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] [L853] 0 pthread_t t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2271, ((void *)0), P2, ((void *)0))=0, t2269={7:0}, t2270={14:0}, t2271={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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=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] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=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=1] [L827] 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) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] 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) [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=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=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=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] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x$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] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L789] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=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] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=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] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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, t2269={7:0}, t2270={14:0}, t2271={15:0}, 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] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L871] 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=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=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] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - 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: 31.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1104 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 762 mSDsluCounter, 417 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 386 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2541 IncrementalHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 31 mSDtfsCounter, 2541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=452occurred in iteration=13, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 1920 SizeOfPredicates, 46 NumberOfNonLiveVariables, 2108 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:16:24,045 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