./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.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/safe009_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f20fd36bba02e157a8b8bf1ebc392e6f77e4774b666ec7e51005ea908400e881 --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:07:15,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:07:15,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:07:15,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:07:15,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:07:15,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:07:15,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:07:15,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:07:15,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:07:15,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:07:15,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:07:15,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:07:15,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:07:15,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:07:15,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:07:15,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:07:15,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:07:15,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:07:15,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:07:15,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:07:15,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:07:15,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:07:15,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:07:15,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:07:15,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:07:15,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:07:15,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:07:15,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:07:15,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:07:15,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:07:15,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:07:15,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:07:15,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:07:15,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:07:15,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:07:15,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:07:15,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:07:15,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:07:15,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:07:15,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:07:15,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:07:15,492 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:07:15,519 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:07:15,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:07:15,520 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:07:15,520 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:07:15,521 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:07:15,521 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:07:15,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:07:15,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:07:15,522 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:07:15,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:07:15,522 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:07:15,523 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:07:15,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:07:15,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:07:15,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:07:15,523 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:07:15,523 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:07:15,523 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:07:15,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:07:15,524 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:07:15,524 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:07:15,524 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:07:15,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:07:15,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:07:15,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:07:15,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:07:15,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:07:15,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:07:15,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 03:07:15,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 03:07:15,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:07:15,526 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:07:15,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:07:15,526 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:07:15,526 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 -> f20fd36bba02e157a8b8bf1ebc392e6f77e4774b666ec7e51005ea908400e881 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:07:15,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:07:15,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:07:15,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:07:15,795 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:07:15,796 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:07:15,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i [2023-08-30 03:07:16,785 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:07:17,005 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:07:17,005 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i [2023-08-30 03:07:17,020 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf5069b4/132a0dbfef6c4cf4971a42f877ac7ea3/FLAG7b355b438 [2023-08-30 03:07:17,353 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf5069b4/132a0dbfef6c4cf4971a42f877ac7ea3 [2023-08-30 03:07:17,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:07:17,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:07:17,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:07:17,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:07:17,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:07:17,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:07:17" (1/1) ... [2023-08-30 03:07:17,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d6df7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:07:17, skipping insertion in model container [2023-08-30 03:07:17,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:07:17" (1/1) ... [2023-08-30 03:07:17,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:07:17,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:07:17,503 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/safe009_power.oepc.i[995,1008] [2023-08-30 03:07:17,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:07:17,712 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:07:17,727 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/safe009_power.oepc.i[995,1008] [2023-08-30 03:07:17,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:07:17,844 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:07:17,846 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:07:17,850 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:07:17,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:07:17 WrapperNode [2023-08-30 03:07:17,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:07:17,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:07:17,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:07:17,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:07:17,856 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:07:17" (1/1) ... [2023-08-30 03:07:17,886 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:07:17" (1/1) ... [2023-08-30 03:07:17,903 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2023-08-30 03:07:17,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:07:17,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:07:17,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:07:17,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:07:17,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:07:17" (1/1) ... [2023-08-30 03:07:17,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:07:17" (1/1) ... [2023-08-30 03:07:17,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:07:17" (1/1) ... [2023-08-30 03:07:17,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:07:17" (1/1) ... [2023-08-30 03:07:17,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:07:17" (1/1) ... [2023-08-30 03:07:17,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:07:17" (1/1) ... [2023-08-30 03:07:17,953 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:07:17" (1/1) ... [2023-08-30 03:07:17,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:07:17" (1/1) ... [2023-08-30 03:07:17,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:07:17,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:07:17,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:07:17,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:07:17,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:07:17" (1/1) ... [2023-08-30 03:07:17,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:07:17,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:07:17,983 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:07:17,989 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:07:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 03:07:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 03:07:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:07:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:07:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:07:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:07:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:07:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:07:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:07:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:07:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:07:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:07:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 03:07:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:07:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:07:18,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:07:18,011 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:07:18,165 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:07:18,166 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:07:18,585 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:07:19,108 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:07:19,109 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:07:19,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:07:19 BoogieIcfgContainer [2023-08-30 03:07:19,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:07:19,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:07:19,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:07:19,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:07:19,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:07:17" (1/3) ... [2023-08-30 03:07:19,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0aa1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:07:19, skipping insertion in model container [2023-08-30 03:07:19,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:07:17" (2/3) ... [2023-08-30 03:07:19,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0aa1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:07:19, skipping insertion in model container [2023-08-30 03:07:19,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:07:19" (3/3) ... [2023-08-30 03:07:19,116 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.oepc.i [2023-08-30 03:07:19,127 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:07:19,127 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2023-08-30 03:07:19,128 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:07:19,209 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:07:19,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 179 transitions, 373 flow [2023-08-30 03:07:19,299 INFO L130 PetriNetUnfolder]: 2/176 cut-off events. [2023-08-30 03:07:19,300 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:07:19,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 2/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 299 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2023-08-30 03:07:19,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 179 transitions, 373 flow [2023-08-30 03:07:19,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 176 transitions, 361 flow [2023-08-30 03:07:19,310 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:07:19,316 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 176 transitions, 361 flow [2023-08-30 03:07:19,317 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 176 transitions, 361 flow [2023-08-30 03:07:19,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 176 transitions, 361 flow [2023-08-30 03:07:19,358 INFO L130 PetriNetUnfolder]: 2/176 cut-off events. [2023-08-30 03:07:19,358 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:07:19,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 2/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 300 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2023-08-30 03:07:19,361 INFO L119 LiptonReduction]: Number of co-enabled transitions 7138 [2023-08-30 03:07:38,932 INFO L134 LiptonReduction]: Checked pairs total: 37486 [2023-08-30 03:07:38,932 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-08-30 03:07:38,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:07:38,946 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;@63f9e8c4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:07:38,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-08-30 03:07:38,947 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:07:38,947 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:07:38,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:07:38,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:07:38,948 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:07:38,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:07:38,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1173, now seen corresponding path program 1 times [2023-08-30 03:07:38,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:07:38,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654002350] [2023-08-30 03:07:38,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:07:38,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:07:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:07:39,022 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:07:39,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:07:39,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654002350] [2023-08-30 03:07:39,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654002350] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:07:39,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:07:39,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:07:39,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324331744] [2023-08-30 03:07:39,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:07:39,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:07:39,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:07:39,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:07:39,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:07:39,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 325 [2023-08-30 03:07:39,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 169 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:39,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:07:39,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 325 [2023-08-30 03:07:39,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:07:42,289 INFO L130 PetriNetUnfolder]: 16294/23246 cut-off events. [2023-08-30 03:07:42,290 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-30 03:07:42,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46173 conditions, 23246 events. 16294/23246 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2236. Compared 161233 event pairs, 16294 based on Foata normal form. 0/9516 useless extension candidates. Maximal degree in co-relation 46162. Up to 22831 conditions per place. [2023-08-30 03:07:42,414 INFO L137 encePairwiseOnDemand]: 294/325 looper letters, 43 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2023-08-30 03:07:42,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 191 flow [2023-08-30 03:07:42,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:07:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:07:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 326 transitions. [2023-08-30 03:07:42,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015384615384615 [2023-08-30 03:07:42,428 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 326 transitions. [2023-08-30 03:07:42,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 326 transitions. [2023-08-30 03:07:42,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:07:42,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 326 transitions. [2023-08-30 03:07:42,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 163.0) internal successors, (326), 2 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:42,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:42,438 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:42,439 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 169 flow. Second operand 2 states and 326 transitions. [2023-08-30 03:07:42,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 191 flow [2023-08-30 03:07:42,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:07:42,444 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 102 flow [2023-08-30 03:07:42,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-08-30 03:07:42,490 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -33 predicate places. [2023-08-30 03:07:42,490 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 102 flow [2023-08-30 03:07:42,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:42,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:07:42,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:07:42,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 03:07:42,491 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:07:42,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:07:42,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1160100, now seen corresponding path program 1 times [2023-08-30 03:07:42,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:07:42,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265154127] [2023-08-30 03:07:42,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:07:42,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:07:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:07:42,694 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:07:42,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:07:42,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265154127] [2023-08-30 03:07:42,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265154127] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:07:42,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:07:42,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:07:42,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116591431] [2023-08-30 03:07:42,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:07:42,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:07:42,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:07:42,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:07:42,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:07:42,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 325 [2023-08-30 03:07:42,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:42,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:07:42,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 325 [2023-08-30 03:07:42,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:07:45,091 INFO L130 PetriNetUnfolder]: 12410/18272 cut-off events. [2023-08-30 03:07:45,092 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:07:45,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36508 conditions, 18272 events. 12410/18272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1153. Compared 119046 event pairs, 7755 based on Foata normal form. 0/9992 useless extension candidates. Maximal degree in co-relation 36505. Up to 11196 conditions per place. [2023-08-30 03:07:45,146 INFO L137 encePairwiseOnDemand]: 305/325 looper letters, 51 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2023-08-30 03:07:45,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 254 flow [2023-08-30 03:07:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:07:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:07:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-30 03:07:45,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2023-08-30 03:07:45,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-30 03:07:45,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-30 03:07:45,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:07:45,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-30 03:07:45,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:45,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:45,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:45,154 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 102 flow. Second operand 3 states and 425 transitions. [2023-08-30 03:07:45,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 254 flow [2023-08-30 03:07:45,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:07:45,156 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 182 flow [2023-08-30 03:07:45,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-08-30 03:07:45,157 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -32 predicate places. [2023-08-30 03:07:45,157 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 182 flow [2023-08-30 03:07:45,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:45,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:07:45,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:07:45,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 03:07:45,158 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:07:45,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:07:45,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1160101, now seen corresponding path program 1 times [2023-08-30 03:07:45,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:07:45,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148653621] [2023-08-30 03:07:45,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:07:45,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:07:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:07:45,257 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:07:45,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:07:45,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148653621] [2023-08-30 03:07:45,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148653621] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:07:45,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:07:45,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:07:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84596548] [2023-08-30 03:07:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:07:45,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:07:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:07:45,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:07:45,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:07:45,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 325 [2023-08-30 03:07:45,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 182 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:07:45,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:07:45,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 325 [2023-08-30 03:07:45,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:07:46,076 INFO L130 PetriNetUnfolder]: 3691/5875 cut-off events. [2023-08-30 03:07:46,077 INFO L131 PetriNetUnfolder]: For 1989/2047 co-relation queries the response was YES. [2023-08-30 03:07:46,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16307 conditions, 5875 events. 3691/5875 cut-off events. For 1989/2047 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 37622 event pairs, 2660 based on Foata normal form. 1647/6621 useless extension candidates. Maximal degree in co-relation 16302. Up to 5166 conditions per place. [2023-08-30 03:07:46,103 INFO L137 encePairwiseOnDemand]: 314/325 looper letters, 36 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-30 03:07:46,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 236 flow [2023-08-30 03:07:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:07:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:07:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-30 03:07:46,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4205128205128205 [2023-08-30 03:07:46,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-30 03:07:46,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-30 03:07:46,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:07:46,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-30 03:07:46,106 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:07:46,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:46,108 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:46,108 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 182 flow. Second operand 3 states and 410 transitions. [2023-08-30 03:07:46,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 236 flow [2023-08-30 03:07:46,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:07:46,120 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 144 flow [2023-08-30 03:07:46,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, 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:07:46,121 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -42 predicate places. [2023-08-30 03:07:46,121 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 144 flow [2023-08-30 03:07:46,121 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:07:46,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:07:46,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:07:46,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 03:07:46,122 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:07:46,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:07:46,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1604641168, now seen corresponding path program 1 times [2023-08-30 03:07:46,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:07:46,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080700809] [2023-08-30 03:07:46,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:07:46,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:07:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:07:46,987 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:07:46,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:07:46,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080700809] [2023-08-30 03:07:46,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080700809] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:07:46,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:07:46,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:07:46,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568053977] [2023-08-30 03:07:46,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:07:46,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:07:46,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:07:46,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:07:46,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:07:47,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 325 [2023-08-30 03:07:47,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:47,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:07:47,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 325 [2023-08-30 03:07:47,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:07:47,777 INFO L130 PetriNetUnfolder]: 3591/5796 cut-off events. [2023-08-30 03:07:47,777 INFO L131 PetriNetUnfolder]: For 853/889 co-relation queries the response was YES. [2023-08-30 03:07:47,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14805 conditions, 5796 events. 3591/5796 cut-off events. For 853/889 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 38326 event pairs, 1329 based on Foata normal form. 0/4266 useless extension candidates. Maximal degree in co-relation 14800. Up to 4840 conditions per place. [2023-08-30 03:07:47,799 INFO L137 encePairwiseOnDemand]: 319/325 looper letters, 59 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2023-08-30 03:07:47,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 356 flow [2023-08-30 03:07:47,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:07:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:07:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-30 03:07:47,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4348717948717949 [2023-08-30 03:07:47,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-30 03:07:47,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-30 03:07:47,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:07:47,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-30 03:07:47,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:47,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:47,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:47,807 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 144 flow. Second operand 3 states and 424 transitions. [2023-08-30 03:07:47,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 356 flow [2023-08-30 03:07:47,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:07:47,810 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 177 flow [2023-08-30 03:07:47,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2023-08-30 03:07:47,811 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -40 predicate places. [2023-08-30 03:07:47,811 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 177 flow [2023-08-30 03:07:47,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:47,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:07:47,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:07:47,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 03:07:47,812 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:07:47,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:07:47,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1795732267, now seen corresponding path program 1 times [2023-08-30 03:07:47,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:07:47,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776112140] [2023-08-30 03:07:47,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:07:47,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:07:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:07:48,854 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:07:48,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:07:48,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776112140] [2023-08-30 03:07:48,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776112140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:07:48,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:07:48,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:07:48,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001862939] [2023-08-30 03:07:48,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:07:48,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:07:48,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:07:48,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:07:48,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:07:48,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 325 [2023-08-30 03:07:48,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:48,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:07:48,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 325 [2023-08-30 03:07:48,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:07:49,827 INFO L130 PetriNetUnfolder]: 3574/5729 cut-off events. [2023-08-30 03:07:49,827 INFO L131 PetriNetUnfolder]: For 1665/1695 co-relation queries the response was YES. [2023-08-30 03:07:49,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15732 conditions, 5729 events. 3574/5729 cut-off events. For 1665/1695 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 37712 event pairs, 932 based on Foata normal form. 10/4486 useless extension candidates. Maximal degree in co-relation 15726. Up to 4418 conditions per place. [2023-08-30 03:07:49,849 INFO L137 encePairwiseOnDemand]: 322/325 looper letters, 60 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2023-08-30 03:07:49,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 381 flow [2023-08-30 03:07:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:07:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:07:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-30 03:07:49,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4379487179487179 [2023-08-30 03:07:49,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-30 03:07:49,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-30 03:07:49,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:07:49,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-30 03:07:49,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:49,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:49,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:49,855 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 177 flow. Second operand 3 states and 427 transitions. [2023-08-30 03:07:49,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 381 flow [2023-08-30 03:07:49,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:07:49,857 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 184 flow [2023-08-30 03:07:49,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-30 03:07:49,857 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -38 predicate places. [2023-08-30 03:07:49,857 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 184 flow [2023-08-30 03:07:49,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:49,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:07:49,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:07:49,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 03:07:49,858 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:07:49,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:07:49,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1238258992, now seen corresponding path program 1 times [2023-08-30 03:07:49,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:07:49,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252006935] [2023-08-30 03:07:49,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:07:49,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:07:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:07:49,936 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:07:49,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:07:49,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252006935] [2023-08-30 03:07:49,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252006935] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:07:49,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:07:49,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:07:49,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866676965] [2023-08-30 03:07:49,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:07:49,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:07:49,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:07:49,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:07:49,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:07:49,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 325 [2023-08-30 03:07:49,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:49,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:07:49,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 325 [2023-08-30 03:07:49,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:07:50,913 INFO L130 PetriNetUnfolder]: 3670/5870 cut-off events. [2023-08-30 03:07:50,913 INFO L131 PetriNetUnfolder]: For 2251/2290 co-relation queries the response was YES. [2023-08-30 03:07:50,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16766 conditions, 5870 events. 3670/5870 cut-off events. For 2251/2290 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 38016 event pairs, 1780 based on Foata normal form. 0/4677 useless extension candidates. Maximal degree in co-relation 16759. Up to 3355 conditions per place. [2023-08-30 03:07:50,933 INFO L137 encePairwiseOnDemand]: 323/325 looper letters, 69 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2023-08-30 03:07:50,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 77 transitions, 438 flow [2023-08-30 03:07:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:07:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:07:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-30 03:07:50,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4235897435897436 [2023-08-30 03:07:50,935 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-30 03:07:50,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-30 03:07:50,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:07:50,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-30 03:07:50,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:50,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:50,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:50,938 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 184 flow. Second operand 3 states and 413 transitions. [2023-08-30 03:07:50,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 77 transitions, 438 flow [2023-08-30 03:07:50,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 77 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:07:50,941 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 192 flow [2023-08-30 03:07:50,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-08-30 03:07:50,941 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -37 predicate places. [2023-08-30 03:07:50,941 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 192 flow [2023-08-30 03:07:50,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:50,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:07:50,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:07:50,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 03:07:50,942 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:07:50,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:07:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1795732515, now seen corresponding path program 1 times [2023-08-30 03:07:50,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:07:50,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707266654] [2023-08-30 03:07:50,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:07:50,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:07:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:07:51,119 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:07:51,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:07:51,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707266654] [2023-08-30 03:07:51,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707266654] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:07:51,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:07:51,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:07:51,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020125323] [2023-08-30 03:07:51,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:07:51,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:07:51,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:07:51,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:07:51,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:07:51,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 325 [2023-08-30 03:07:51,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:51,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:07:51,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 325 [2023-08-30 03:07:51,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:07:52,156 INFO L130 PetriNetUnfolder]: 5096/8286 cut-off events. [2023-08-30 03:07:52,156 INFO L131 PetriNetUnfolder]: For 5162/5227 co-relation queries the response was YES. [2023-08-30 03:07:52,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22953 conditions, 8286 events. 5096/8286 cut-off events. For 5162/5227 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 58841 event pairs, 2394 based on Foata normal form. 32/6570 useless extension candidates. Maximal degree in co-relation 22945. Up to 4168 conditions per place. [2023-08-30 03:07:52,187 INFO L137 encePairwiseOnDemand]: 320/325 looper letters, 63 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2023-08-30 03:07:52,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 435 flow [2023-08-30 03:07:52,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:07:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:07:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-30 03:07:52,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41 [2023-08-30 03:07:52,190 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-30 03:07:52,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-30 03:07:52,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:07:52,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-30 03:07:52,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:52,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:52,193 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:52,193 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 192 flow. Second operand 4 states and 533 transitions. [2023-08-30 03:07:52,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 435 flow [2023-08-30 03:07:52,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 431 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:07:52,197 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 218 flow [2023-08-30 03:07:52,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-08-30 03:07:52,197 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -34 predicate places. [2023-08-30 03:07:52,197 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 218 flow [2023-08-30 03:07:52,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:52,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:07:52,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:07:52,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 03:07:52,198 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:07:52,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:07:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash -187144401, now seen corresponding path program 2 times [2023-08-30 03:07:52,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:07:52,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653079064] [2023-08-30 03:07:52,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:07:52,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:07:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:07:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:07:52,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:07:52,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653079064] [2023-08-30 03:07:52,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653079064] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:07:52,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:07:52,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:07:52,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964375476] [2023-08-30 03:07:52,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:07:52,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:07:52,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:07:52,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:07:52,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:07:52,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 325 [2023-08-30 03:07:52,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 218 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:07:52,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:07:52,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 325 [2023-08-30 03:07:52,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:07:53,286 INFO L130 PetriNetUnfolder]: 5030/8183 cut-off events. [2023-08-30 03:07:53,286 INFO L131 PetriNetUnfolder]: For 7381/7445 co-relation queries the response was YES. [2023-08-30 03:07:53,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23239 conditions, 8183 events. 5030/8183 cut-off events. For 7381/7445 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 57898 event pairs, 2872 based on Foata normal form. 38/6475 useless extension candidates. Maximal degree in co-relation 23230. Up to 5233 conditions per place. [2023-08-30 03:07:53,326 INFO L137 encePairwiseOnDemand]: 322/325 looper letters, 64 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2023-08-30 03:07:53,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 452 flow [2023-08-30 03:07:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:07:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:07:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 540 transitions. [2023-08-30 03:07:53,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153846153846154 [2023-08-30 03:07:53,328 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 540 transitions. [2023-08-30 03:07:53,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 540 transitions. [2023-08-30 03:07:53,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:07:53,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 540 transitions. [2023-08-30 03:07:53,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:53,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:53,332 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:53,332 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 218 flow. Second operand 4 states and 540 transitions. [2023-08-30 03:07:53,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 452 flow [2023-08-30 03:07:53,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:07:53,337 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 226 flow [2023-08-30 03:07:53,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-08-30 03:07:53,339 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -32 predicate places. [2023-08-30 03:07:53,339 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 226 flow [2023-08-30 03:07:53,339 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:07:53,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:07:53,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:07:53,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 03:07:53,340 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:07:53,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:07:53,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1819600654, now seen corresponding path program 1 times [2023-08-30 03:07:53,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:07:53,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049423643] [2023-08-30 03:07:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:07:53,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:07:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:07:53,404 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:07:53,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:07:53,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049423643] [2023-08-30 03:07:53,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049423643] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:07:53,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:07:53,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:07:53,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617082588] [2023-08-30 03:07:53,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:07:53,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:07:53,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:07:53,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:07:53,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:07:53,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 325 [2023-08-30 03:07:53,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:53,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:07:53,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 325 [2023-08-30 03:07:53,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:07:54,221 INFO L130 PetriNetUnfolder]: 4894/7927 cut-off events. [2023-08-30 03:07:54,221 INFO L131 PetriNetUnfolder]: For 9709/9765 co-relation queries the response was YES. [2023-08-30 03:07:54,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22960 conditions, 7927 events. 4894/7927 cut-off events. For 9709/9765 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 55411 event pairs, 2818 based on Foata normal form. 30/6223 useless extension candidates. Maximal degree in co-relation 22950. Up to 5088 conditions per place. [2023-08-30 03:07:54,256 INFO L137 encePairwiseOnDemand]: 321/325 looper letters, 62 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2023-08-30 03:07:54,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 442 flow [2023-08-30 03:07:54,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:07:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:07:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-08-30 03:07:54,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.441025641025641 [2023-08-30 03:07:54,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-08-30 03:07:54,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-08-30 03:07:54,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:07:54,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-08-30 03:07:54,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:54,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:54,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:54,266 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 226 flow. Second operand 3 states and 430 transitions. [2023-08-30 03:07:54,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 442 flow [2023-08-30 03:07:54,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 428 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 03:07:54,270 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 208 flow [2023-08-30 03:07:54,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-08-30 03:07:54,270 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -36 predicate places. [2023-08-30 03:07:54,270 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 208 flow [2023-08-30 03:07:54,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:54,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:07:54,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:07:54,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 03:07:54,271 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:07:54,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:07:54,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1819600406, now seen corresponding path program 1 times [2023-08-30 03:07:54,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:07:54,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016183336] [2023-08-30 03:07:54,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:07:54,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:07:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:07:54,694 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:07:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:07:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016183336] [2023-08-30 03:07:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016183336] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:07:54,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:07:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:07:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627897220] [2023-08-30 03:07:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:07:54,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:07:54,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:07:54,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:07:54,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:07:54,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 325 [2023-08-30 03:07:54,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 208 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:07:54,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:07:54,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 325 [2023-08-30 03:07:54,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:07:55,838 INFO L130 PetriNetUnfolder]: 6874/10811 cut-off events. [2023-08-30 03:07:55,839 INFO L131 PetriNetUnfolder]: For 5256/5328 co-relation queries the response was YES. [2023-08-30 03:07:55,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30777 conditions, 10811 events. 6874/10811 cut-off events. For 5256/5328 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 71894 event pairs, 4171 based on Foata normal form. 15/8518 useless extension candidates. Maximal degree in co-relation 30769. Up to 7811 conditions per place. [2023-08-30 03:07:55,875 INFO L137 encePairwiseOnDemand]: 322/325 looper letters, 62 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2023-08-30 03:07:55,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 432 flow [2023-08-30 03:07:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:07:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:07:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-30 03:07:55,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4276923076923077 [2023-08-30 03:07:55,877 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-30 03:07:55,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-30 03:07:55,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:07:55,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-30 03:07:55,878 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:07:55,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:55,880 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:55,880 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 208 flow. Second operand 3 states and 417 transitions. [2023-08-30 03:07:55,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 432 flow [2023-08-30 03:07:55,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:07:55,885 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 215 flow [2023-08-30 03:07:55,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-08-30 03:07:55,885 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -35 predicate places. [2023-08-30 03:07:55,885 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 215 flow [2023-08-30 03:07:55,886 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:07:55,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:07:55,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:07:55,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 03:07:55,886 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:07:55,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:07:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash 166873741, now seen corresponding path program 1 times [2023-08-30 03:07:55,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:07:55,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464526409] [2023-08-30 03:07:55,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:07:55,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:07:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:07:56,653 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:07:56,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:07:56,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464526409] [2023-08-30 03:07:56,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464526409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:07:56,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:07:56,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:07:56,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058742258] [2023-08-30 03:07:56,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:07:56,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:07:56,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:07:56,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:07:56,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:07:56,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 325 [2023-08-30 03:07:56,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:56,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:07:56,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 325 [2023-08-30 03:07:56,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:07:58,104 INFO L130 PetriNetUnfolder]: 9232/14599 cut-off events. [2023-08-30 03:07:58,105 INFO L131 PetriNetUnfolder]: For 7161/7421 co-relation queries the response was YES. [2023-08-30 03:07:58,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41254 conditions, 14599 events. 9232/14599 cut-off events. For 7161/7421 co-relation queries the response was YES. Maximal size of possible extension queue 1150. Compared 108403 event pairs, 2180 based on Foata normal form. 133/11283 useless extension candidates. Maximal degree in co-relation 41245. Up to 5481 conditions per place. [2023-08-30 03:07:58,166 INFO L137 encePairwiseOnDemand]: 321/325 looper letters, 93 selfloop transitions, 3 changer transitions 0/101 dead transitions. [2023-08-30 03:07:58,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 101 transitions, 600 flow [2023-08-30 03:07:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:07:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:07:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2023-08-30 03:07:58,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4330769230769231 [2023-08-30 03:07:58,168 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2023-08-30 03:07:58,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2023-08-30 03:07:58,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:07:58,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2023-08-30 03:07:58,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:58,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:58,171 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:58,171 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 215 flow. Second operand 4 states and 563 transitions. [2023-08-30 03:07:58,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 101 transitions, 600 flow [2023-08-30 03:07:58,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 101 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:07:58,181 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 226 flow [2023-08-30 03:07:58,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-08-30 03:07:58,182 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -32 predicate places. [2023-08-30 03:07:58,182 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 226 flow [2023-08-30 03:07:58,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:58,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:07:58,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:07:58,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 03:07:58,183 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:07:58,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:07:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 166900226, now seen corresponding path program 1 times [2023-08-30 03:07:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:07:58,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824931733] [2023-08-30 03:07:58,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:07:58,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:07:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:07:58,282 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:07:58,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:07:58,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824931733] [2023-08-30 03:07:58,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824931733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:07:58,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:07:58,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:07:58,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258387329] [2023-08-30 03:07:58,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:07:58,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:07:58,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:07:58,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:07:58,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:07:58,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 325 [2023-08-30 03:07:58,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:58,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:07:58,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 325 [2023-08-30 03:07:58,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:07:59,376 INFO L130 PetriNetUnfolder]: 7068/11098 cut-off events. [2023-08-30 03:07:59,376 INFO L131 PetriNetUnfolder]: For 4713/4745 co-relation queries the response was YES. [2023-08-30 03:07:59,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33186 conditions, 11098 events. 7068/11098 cut-off events. For 4713/4745 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 75343 event pairs, 2581 based on Foata normal form. 52/8906 useless extension candidates. Maximal degree in co-relation 33175. Up to 4895 conditions per place. [2023-08-30 03:07:59,420 INFO L137 encePairwiseOnDemand]: 308/325 looper letters, 58 selfloop transitions, 12 changer transitions 0/71 dead transitions. [2023-08-30 03:07:59,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 494 flow [2023-08-30 03:07:59,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:07:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:07:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2023-08-30 03:07:59,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39615384615384613 [2023-08-30 03:07:59,422 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2023-08-30 03:07:59,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2023-08-30 03:07:59,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:07:59,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2023-08-30 03:07:59,423 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:07:59,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:59,424 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:59,425 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 226 flow. Second operand 4 states and 515 transitions. [2023-08-30 03:07:59,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 494 flow [2023-08-30 03:07:59,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 471 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 03:07:59,430 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 321 flow [2023-08-30 03:07:59,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-30 03:07:59,431 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -30 predicate places. [2023-08-30 03:07:59,431 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 321 flow [2023-08-30 03:07:59,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:07:59,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:07:59,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:07:59,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 03:07:59,431 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:07:59,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:07:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1395981244, now seen corresponding path program 1 times [2023-08-30 03:07:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:07:59,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272038958] [2023-08-30 03:07:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:07:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:07:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:08:01,290 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:08:01,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:08:01,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272038958] [2023-08-30 03:08:01,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272038958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:08:01,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:08:01,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:08:01,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818163919] [2023-08-30 03:08:01,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:08:01,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:08:01,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:08:01,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:08:01,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:08:01,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 325 [2023-08-30 03:08:01,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 321 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:08:01,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:08:01,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 325 [2023-08-30 03:08:01,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:08:03,261 INFO L130 PetriNetUnfolder]: 8016/12602 cut-off events. [2023-08-30 03:08:03,262 INFO L131 PetriNetUnfolder]: For 9292/9328 co-relation queries the response was YES. [2023-08-30 03:08:03,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43195 conditions, 12602 events. 8016/12602 cut-off events. For 9292/9328 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 88791 event pairs, 2237 based on Foata normal form. 52/11124 useless extension candidates. Maximal degree in co-relation 43184. Up to 10487 conditions per place. [2023-08-30 03:08:03,319 INFO L137 encePairwiseOnDemand]: 313/325 looper letters, 107 selfloop transitions, 46 changer transitions 0/154 dead transitions. [2023-08-30 03:08:03,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 154 transitions, 1185 flow [2023-08-30 03:08:03,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 03:08:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 03:08:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1369 transitions. [2023-08-30 03:08:03,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35102564102564104 [2023-08-30 03:08:03,323 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1369 transitions. [2023-08-30 03:08:03,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1369 transitions. [2023-08-30 03:08:03,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:08:03,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1369 transitions. [2023-08-30 03:08:03,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 114.08333333333333) internal successors, (1369), 12 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:03,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 325.0) internal successors, (4225), 13 states have internal predecessors, (4225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:03,329 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 325.0) internal successors, (4225), 13 states have internal predecessors, (4225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:03,329 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 321 flow. Second operand 12 states and 1369 transitions. [2023-08-30 03:08:03,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 154 transitions, 1185 flow [2023-08-30 03:08:03,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 154 transitions, 1178 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 03:08:03,378 INFO L231 Difference]: Finished difference. Result has 76 places, 96 transitions, 808 flow [2023-08-30 03:08:03,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=808, PETRI_PLACES=76, PETRI_TRANSITIONS=96} [2023-08-30 03:08:03,379 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -13 predicate places. [2023-08-30 03:08:03,379 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 96 transitions, 808 flow [2023-08-30 03:08:03,379 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:08:03,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:08:03,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:08:03,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 03:08:03,380 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:08:03,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:08:03,380 INFO L85 PathProgramCache]: Analyzing trace with hash 878937645, now seen corresponding path program 1 times [2023-08-30 03:08:03,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:08:03,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663367620] [2023-08-30 03:08:03,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:08:03,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:08:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:08:03,655 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:08:03,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:08:03,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663367620] [2023-08-30 03:08:03,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663367620] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:08:03,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:08:03,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:08:03,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719107149] [2023-08-30 03:08:03,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:08:03,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:08:03,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:08:03,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:08:03,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:08:03,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 325 [2023-08-30 03:08:03,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 96 transitions, 808 flow. Second operand has 8 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:03,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:08:03,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 325 [2023-08-30 03:08:03,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:08:05,861 INFO L130 PetriNetUnfolder]: 10300/16236 cut-off events. [2023-08-30 03:08:05,861 INFO L131 PetriNetUnfolder]: For 23611/23827 co-relation queries the response was YES. [2023-08-30 03:08:05,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63236 conditions, 16236 events. 10300/16236 cut-off events. For 23611/23827 co-relation queries the response was YES. Maximal size of possible extension queue 1246. Compared 118421 event pairs, 4245 based on Foata normal form. 70/14947 useless extension candidates. Maximal degree in co-relation 63217. Up to 9776 conditions per place. [2023-08-30 03:08:05,952 INFO L137 encePairwiseOnDemand]: 317/325 looper letters, 151 selfloop transitions, 19 changer transitions 1/186 dead transitions. [2023-08-30 03:08:05,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 186 transitions, 1790 flow [2023-08-30 03:08:05,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:08:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:08:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 846 transitions. [2023-08-30 03:08:05,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3718681318681319 [2023-08-30 03:08:05,954 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 846 transitions. [2023-08-30 03:08:05,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 846 transitions. [2023-08-30 03:08:05,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:08:05,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 846 transitions. [2023-08-30 03:08:05,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:05,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:05,959 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:05,959 INFO L175 Difference]: Start difference. First operand has 76 places, 96 transitions, 808 flow. Second operand 7 states and 846 transitions. [2023-08-30 03:08:05,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 186 transitions, 1790 flow [2023-08-30 03:08:06,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 186 transitions, 1756 flow, removed 17 selfloop flow, removed 0 redundant places. [2023-08-30 03:08:06,500 INFO L231 Difference]: Finished difference. Result has 86 places, 112 transitions, 1016 flow [2023-08-30 03:08:06,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1016, PETRI_PLACES=86, PETRI_TRANSITIONS=112} [2023-08-30 03:08:06,500 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -3 predicate places. [2023-08-30 03:08:06,501 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 1016 flow [2023-08-30 03:08:06,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:06,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:08:06,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:08:06,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 03:08:06,501 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:08:06,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:08:06,502 INFO L85 PathProgramCache]: Analyzing trace with hash 878937589, now seen corresponding path program 1 times [2023-08-30 03:08:06,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:08:06,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497875785] [2023-08-30 03:08:06,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:08:06,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:08:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:08:06,637 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:08:06,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:08:06,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497875785] [2023-08-30 03:08:06,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497875785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:08:06,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:08:06,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:08:06,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627044396] [2023-08-30 03:08:06,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:08:06,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:08:06,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:08:06,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:08:06,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:08:06,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 325 [2023-08-30 03:08:06,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 1016 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:06,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:08:06,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 325 [2023-08-30 03:08:06,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:08:08,314 INFO L130 PetriNetUnfolder]: 7858/12600 cut-off events. [2023-08-30 03:08:08,315 INFO L131 PetriNetUnfolder]: For 22971/23031 co-relation queries the response was YES. [2023-08-30 03:08:08,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50186 conditions, 12600 events. 7858/12600 cut-off events. For 22971/23031 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 89802 event pairs, 2261 based on Foata normal form. 418/12481 useless extension candidates. Maximal degree in co-relation 50162. Up to 4503 conditions per place. [2023-08-30 03:08:08,379 INFO L137 encePairwiseOnDemand]: 308/325 looper letters, 117 selfloop transitions, 33 changer transitions 1/152 dead transitions. [2023-08-30 03:08:08,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 152 transitions, 1588 flow [2023-08-30 03:08:08,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:08:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:08:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2023-08-30 03:08:08,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3764102564102564 [2023-08-30 03:08:08,381 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 734 transitions. [2023-08-30 03:08:08,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 734 transitions. [2023-08-30 03:08:08,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:08:08,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 734 transitions. [2023-08-30 03:08:08,382 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:08:08,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:08,384 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:08,384 INFO L175 Difference]: Start difference. First operand has 86 places, 112 transitions, 1016 flow. Second operand 6 states and 734 transitions. [2023-08-30 03:08:08,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 152 transitions, 1588 flow [2023-08-30 03:08:08,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 152 transitions, 1576 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:08:08,640 INFO L231 Difference]: Finished difference. Result has 91 places, 119 transitions, 1223 flow [2023-08-30 03:08:08,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1223, PETRI_PLACES=91, PETRI_TRANSITIONS=119} [2023-08-30 03:08:08,641 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, 2 predicate places. [2023-08-30 03:08:08,641 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 119 transitions, 1223 flow [2023-08-30 03:08:08,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:08,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:08:08,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:08:08,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 03:08:08,642 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:08:08,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:08:08,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1460334627, now seen corresponding path program 1 times [2023-08-30 03:08:08,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:08:08,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675944656] [2023-08-30 03:08:08,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:08:08,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:08:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:08:08,813 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:08:08,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:08:08,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675944656] [2023-08-30 03:08:08,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675944656] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:08:08,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:08:08,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:08:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761569337] [2023-08-30 03:08:08,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:08:08,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:08:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:08:08,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:08:08,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:08:08,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 325 [2023-08-30 03:08:08,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 119 transitions, 1223 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:08:08,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:08:08,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 325 [2023-08-30 03:08:08,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:08:09,683 INFO L130 PetriNetUnfolder]: 3523/6481 cut-off events. [2023-08-30 03:08:09,683 INFO L131 PetriNetUnfolder]: For 18736/18777 co-relation queries the response was YES. [2023-08-30 03:08:09,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27996 conditions, 6481 events. 3523/6481 cut-off events. For 18736/18777 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 48639 event pairs, 676 based on Foata normal form. 130/6307 useless extension candidates. Maximal degree in co-relation 27971. Up to 5499 conditions per place. [2023-08-30 03:08:09,717 INFO L137 encePairwiseOnDemand]: 320/325 looper letters, 106 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2023-08-30 03:08:09,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 127 transitions, 1372 flow [2023-08-30 03:08:09,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:08:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:08:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-30 03:08:09,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4205128205128205 [2023-08-30 03:08:09,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-30 03:08:09,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-30 03:08:09,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:08:09,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-30 03:08:09,730 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:08:09,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:09,731 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:09,731 INFO L175 Difference]: Start difference. First operand has 91 places, 119 transitions, 1223 flow. Second operand 3 states and 410 transitions. [2023-08-30 03:08:09,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 127 transitions, 1372 flow [2023-08-30 03:08:09,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 127 transitions, 1314 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-30 03:08:09,897 INFO L231 Difference]: Finished difference. Result has 88 places, 104 transitions, 948 flow [2023-08-30 03:08:09,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=88, PETRI_TRANSITIONS=104} [2023-08-30 03:08:09,898 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -1 predicate places. [2023-08-30 03:08:09,898 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 104 transitions, 948 flow [2023-08-30 03:08:09,905 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:08:09,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:08:09,905 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:08:09,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 03:08:09,906 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:08:09,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:08:09,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1919543673, now seen corresponding path program 1 times [2023-08-30 03:08:09,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:08:09,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100876915] [2023-08-30 03:08:09,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:08:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:08:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:08:10,116 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:08:10,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:08:10,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100876915] [2023-08-30 03:08:10,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100876915] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:08:10,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:08:10,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:08:10,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927798423] [2023-08-30 03:08:10,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:08:10,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:08:10,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:08:10,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:08:10,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:08:10,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 325 [2023-08-30 03:08:10,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 104 transitions, 948 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:10,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:08:10,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 325 [2023-08-30 03:08:10,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:08:10,474 INFO L130 PetriNetUnfolder]: 1016/2137 cut-off events. [2023-08-30 03:08:10,474 INFO L131 PetriNetUnfolder]: For 4062/4076 co-relation queries the response was YES. [2023-08-30 03:08:10,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9040 conditions, 2137 events. 1016/2137 cut-off events. For 4062/4076 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14360 event pairs, 121 based on Foata normal form. 147/2220 useless extension candidates. Maximal degree in co-relation 9015. Up to 1096 conditions per place. [2023-08-30 03:08:10,483 INFO L137 encePairwiseOnDemand]: 320/325 looper letters, 103 selfloop transitions, 7 changer transitions 0/124 dead transitions. [2023-08-30 03:08:10,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 124 transitions, 1199 flow [2023-08-30 03:08:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:08:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:08:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2023-08-30 03:08:10,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176923076923077 [2023-08-30 03:08:10,485 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2023-08-30 03:08:10,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2023-08-30 03:08:10,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:08:10,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2023-08-30 03:08:10,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:10,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:10,487 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:10,487 INFO L175 Difference]: Start difference. First operand has 88 places, 104 transitions, 948 flow. Second operand 4 states and 543 transitions. [2023-08-30 03:08:10,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 124 transitions, 1199 flow [2023-08-30 03:08:10,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 124 transitions, 1152 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-30 03:08:10,500 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 732 flow [2023-08-30 03:08:10,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=732, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2023-08-30 03:08:10,501 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -2 predicate places. [2023-08-30 03:08:10,501 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 90 transitions, 732 flow [2023-08-30 03:08:10,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:10,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:08:10,502 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:08:10,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 03:08:10,502 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:08:10,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:08:10,502 INFO L85 PathProgramCache]: Analyzing trace with hash -169034061, now seen corresponding path program 1 times [2023-08-30 03:08:10,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:08:10,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931146380] [2023-08-30 03:08:10,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:08:10,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:08:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:08:10,732 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:08:10,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:08:10,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931146380] [2023-08-30 03:08:10,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931146380] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:08:10,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:08:10,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:08:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202555097] [2023-08-30 03:08:10,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:08:10,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:08:10,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:08:10,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:08:10,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:08:10,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 325 [2023-08-30 03:08:10,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 90 transitions, 732 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:10,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:08:10,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 325 [2023-08-30 03:08:10,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:08:10,953 INFO L130 PetriNetUnfolder]: 617/1224 cut-off events. [2023-08-30 03:08:10,953 INFO L131 PetriNetUnfolder]: For 2769/2779 co-relation queries the response was YES. [2023-08-30 03:08:10,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5165 conditions, 1224 events. 617/1224 cut-off events. For 2769/2779 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7451 event pairs, 85 based on Foata normal form. 63/1275 useless extension candidates. Maximal degree in co-relation 5141. Up to 545 conditions per place. [2023-08-30 03:08:10,958 INFO L137 encePairwiseOnDemand]: 320/325 looper letters, 71 selfloop transitions, 10 changer transitions 8/96 dead transitions. [2023-08-30 03:08:10,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 96 transitions, 867 flow [2023-08-30 03:08:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:08:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:08:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2023-08-30 03:08:10,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4055384615384615 [2023-08-30 03:08:10,960 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 659 transitions. [2023-08-30 03:08:10,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 659 transitions. [2023-08-30 03:08:10,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:08:10,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 659 transitions. [2023-08-30 03:08:10,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:10,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:10,963 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:10,963 INFO L175 Difference]: Start difference. First operand has 87 places, 90 transitions, 732 flow. Second operand 5 states and 659 transitions. [2023-08-30 03:08:10,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 96 transitions, 867 flow [2023-08-30 03:08:10,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 96 transitions, 791 flow, removed 12 selfloop flow, removed 12 redundant places. [2023-08-30 03:08:10,967 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 385 flow [2023-08-30 03:08:10,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=385, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2023-08-30 03:08:10,968 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -17 predicate places. [2023-08-30 03:08:10,968 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 385 flow [2023-08-30 03:08:10,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:08:10,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:08:10,968 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:08:10,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 03:08:10,969 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:08:10,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:08:10,969 INFO L85 PathProgramCache]: Analyzing trace with hash -792568031, now seen corresponding path program 1 times [2023-08-30 03:08:10,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:08:10,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975048130] [2023-08-30 03:08:10,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:08:10,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:08:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:08:11,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:08:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:08:11,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 03:08:11,120 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:08:11,120 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2023-08-30 03:08:11,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2023-08-30 03:08:11,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2023-08-30 03:08:11,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2023-08-30 03:08:11,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2023-08-30 03:08:11,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2023-08-30 03:08:11,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2023-08-30 03:08:11,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2023-08-30 03:08:11,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2023-08-30 03:08:11,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2023-08-30 03:08:11,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2023-08-30 03:08:11,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2023-08-30 03:08:11,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2023-08-30 03:08:11,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2023-08-30 03:08:11,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2023-08-30 03:08:11,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2023-08-30 03:08:11,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2023-08-30 03:08:11,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2023-08-30 03:08:11,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2023-08-30 03:08:11,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2023-08-30 03:08:11,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2023-08-30 03:08:11,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2023-08-30 03:08:11,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2023-08-30 03:08:11,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2023-08-30 03:08:11,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2023-08-30 03:08:11,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2023-08-30 03:08:11,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2023-08-30 03:08:11,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2023-08-30 03:08:11,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2023-08-30 03:08:11,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2023-08-30 03:08:11,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2023-08-30 03:08:11,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2023-08-30 03:08:11,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2023-08-30 03:08:11,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2023-08-30 03:08:11,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2023-08-30 03:08:11,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2023-08-30 03:08:11,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2023-08-30 03:08:11,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2023-08-30 03:08:11,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2023-08-30 03:08:11,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2023-08-30 03:08:11,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2023-08-30 03:08:11,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2023-08-30 03:08:11,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2023-08-30 03:08:11,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2023-08-30 03:08:11,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2023-08-30 03:08:11,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2023-08-30 03:08:11,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2023-08-30 03:08:11,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 85 remaining) [2023-08-30 03:08:11,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 85 remaining) [2023-08-30 03:08:11,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 85 remaining) [2023-08-30 03:08:11,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 85 remaining) [2023-08-30 03:08:11,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2023-08-30 03:08:11,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2023-08-30 03:08:11,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (31 of 85 remaining) [2023-08-30 03:08:11,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 85 remaining) [2023-08-30 03:08:11,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 85 remaining) [2023-08-30 03:08:11,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 85 remaining) [2023-08-30 03:08:11,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2023-08-30 03:08:11,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2023-08-30 03:08:11,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2023-08-30 03:08:11,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2023-08-30 03:08:11,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2023-08-30 03:08:11,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2023-08-30 03:08:11,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2023-08-30 03:08:11,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2023-08-30 03:08:11,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2023-08-30 03:08:11,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2023-08-30 03:08:11,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2023-08-30 03:08:11,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2023-08-30 03:08:11,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2023-08-30 03:08:11,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2023-08-30 03:08:11,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2023-08-30 03:08:11,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2023-08-30 03:08:11,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2023-08-30 03:08:11,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2023-08-30 03:08:11,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2023-08-30 03:08:11,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2023-08-30 03:08:11,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2023-08-30 03:08:11,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2023-08-30 03:08:11,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2023-08-30 03:08:11,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2023-08-30 03:08:11,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2023-08-30 03:08:11,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2023-08-30 03:08:11,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2023-08-30 03:08:11,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2023-08-30 03:08:11,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 03:08:11,132 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:08:11,136 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:08:11,136 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:08:11,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:08:11 BasicIcfg [2023-08-30 03:08:11,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:08:11,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:08:11,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:08:11,186 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:08:11,186 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:07:19" (3/4) ... [2023-08-30 03:08:11,188 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:08:11,188 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:08:11,189 INFO L158 Benchmark]: Toolchain (without parser) took 53832.92ms. Allocated memory was 73.4MB in the beginning and 4.0GB in the end (delta: 4.0GB). Free memory was 49.2MB in the beginning and 3.0GB in the end (delta: -3.0GB). Peak memory consumption was 977.4MB. Max. memory is 16.1GB. [2023-08-30 03:08:11,189 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 56.6MB. Free memory was 34.0MB in the beginning and 33.9MB in the end (delta: 32.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:08:11,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.89ms. Allocated memory is still 73.4MB. Free memory was 49.0MB in the beginning and 42.7MB in the end (delta: 6.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2023-08-30 03:08:11,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.53ms. Allocated memory is still 73.4MB. Free memory was 42.7MB in the beginning and 39.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:08:11,189 INFO L158 Benchmark]: Boogie Preprocessor took 46.38ms. Allocated memory is still 73.4MB. Free memory was 39.9MB in the beginning and 37.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 03:08:11,190 INFO L158 Benchmark]: RCFGBuilder took 1152.14ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 37.2MB in the beginning and 47.7MB in the end (delta: -10.4MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2023-08-30 03:08:11,191 INFO L158 Benchmark]: TraceAbstraction took 52073.57ms. Allocated memory was 107.0MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 46.9MB in the beginning and 3.0GB in the end (delta: -3.0GB). Peak memory consumption was 939.7MB. Max. memory is 16.1GB. [2023-08-30 03:08:11,191 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 4.0GB. Free memory is still 3.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:08:11,192 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.69ms. Allocated memory is still 56.6MB. Free memory was 34.0MB in the beginning and 33.9MB in the end (delta: 32.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.89ms. Allocated memory is still 73.4MB. Free memory was 49.0MB in the beginning and 42.7MB in the end (delta: 6.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.53ms. Allocated memory is still 73.4MB. Free memory was 42.7MB in the beginning and 39.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.38ms. Allocated memory is still 73.4MB. Free memory was 39.9MB in the beginning and 37.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1152.14ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 37.2MB in the beginning and 47.7MB in the end (delta: -10.4MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * TraceAbstraction took 52073.57ms. Allocated memory was 107.0MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 46.9MB in the beginning and 3.0GB in the end (delta: -3.0GB). Peak memory consumption was 939.7MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 4.0GB. Free memory is still 3.0GB. 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: 19.6s, 184 PlacesBefore, 89 PlacesAfterwards, 176 TransitionsBefore, 80 TransitionsAfterwards, 7138 CoEnabledTransitionPairs, 7 FixpointIterations, 69 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 146 TotalNumberOfCompositions, 37486 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10662, independent: 9994, independent conditional: 0, independent unconditional: 9994, dependent: 668, dependent conditional: 0, dependent unconditional: 668, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2736, independent: 2637, independent conditional: 0, independent unconditional: 2637, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10662, independent: 7357, independent conditional: 0, independent unconditional: 7357, dependent: 569, dependent conditional: 0, dependent unconditional: 569, unknown: 2736, unknown conditional: 0, unknown unconditional: 2736] , Statistics on independence cache: Total cache size (in pairs): 541, Positive cache size: 489, Positive conditional cache size: 0, Positive unconditional cache size: 489, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1985; [L836] FCALL, FORK 0 pthread_create(&t1985, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1985, ((void *)0), P0, ((void *)0))=-2, t1985={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L837] 0 pthread_t t1986; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1985={6:0}, t1986={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] EXPR 1 \read(y) [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L765] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L766] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L767] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L768] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L769] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L772] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L773] EXPR 1 \read(y) [L773] 1 __unbuffered_p0_EAX = y [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] EXPR 1 \read(y) [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] 1 y = y$flush_delayed ? y$mem_tmp : y [L775] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L838] FCALL, FORK 0 pthread_create(&t1986, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1986, ((void *)0), P1, ((void *)0))=-1, t1985={6:0}, t1986={7:0}, weak$$choice0=255, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L778] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] 0 pthread_t t1987; [L793] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 \read(y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L840] FCALL, FORK 0 pthread_create(&t1987, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1987, ((void *)0), P2, ((void *)0))=0, t1985={6:0}, t1986={7:0}, t1987={5:0}, weak$$choice0=255, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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, t1985={6:0}, t1986={7:0}, t1987={5:0}, weak$$choice0=255, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] EXPR 0 \read(y) [L856] 0 y$mem_tmp = y [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] EXPR 0 \read(y) [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L858] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L859] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L860] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L861] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L863] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L865] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L865] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L865] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L865] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 \read(y) [L866] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] 0 y = y$flush_delayed ? y$mem_tmp : y [L868] 0 y$flush_delayed = (_Bool)0 [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_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=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 833]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 840]: 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: 836]: 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: 51.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 19.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1634 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1170 mSDsluCounter, 444 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3807 IncrementalHoareTripleChecker+Invalid, 4109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 161 mSDtfsCounter, 3807 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1223occurred in iteration=15, InterpolantAutomatonStates: 76, 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, 6.0s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 2212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:08:11,219 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/safe009_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f20fd36bba02e157a8b8bf1ebc392e6f77e4774b666ec7e51005ea908400e881 --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:08:12,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:08:12,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:08:13,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:08:13,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:08:13,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:08:13,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:08:13,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:08:13,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:08:13,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:08:13,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:08:13,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:08:13,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:08:13,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:08:13,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:08:13,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:08:13,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:08:13,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:08:13,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:08:13,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:08:13,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:08:13,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:08:13,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:08:13,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:08:13,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:08:13,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:08:13,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:08:13,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:08:13,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:08:13,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:08:13,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:08:13,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:08:13,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:08:13,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:08:13,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:08:13,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:08:13,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:08:13,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:08:13,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:08:13,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:08:13,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:08:13,063 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:08:13,078 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:08:13,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:08:13,079 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:08:13,079 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:08:13,080 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:08:13,080 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:08:13,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:08:13,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:08:13,082 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:08:13,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:08:13,082 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:08:13,082 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:08:13,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:08:13,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:08:13,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:08:13,083 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:08:13,083 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:08:13,083 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:08:13,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:08:13,084 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:08:13,084 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 03:08:13,084 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 03:08:13,084 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:08:13,084 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:08:13,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:08:13,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:08:13,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:08:13,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:08:13,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:08:13,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:08:13,085 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 03:08:13,085 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 03:08:13,086 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:08:13,086 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:08:13,086 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:08:13,086 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 03:08:13,086 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:08:13,086 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 -> f20fd36bba02e157a8b8bf1ebc392e6f77e4774b666ec7e51005ea908400e881 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:08:13,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:08:13,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:08:13,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:08:13,314 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:08:13,314 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:08:13,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i [2023-08-30 03:08:14,236 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:08:14,482 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:08:14,483 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i [2023-08-30 03:08:14,491 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c59e9a5/3f518eaf66cd443d9d60bc4e0890a455/FLAG8c180e917 [2023-08-30 03:08:14,501 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c59e9a5/3f518eaf66cd443d9d60bc4e0890a455 [2023-08-30 03:08:14,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:08:14,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:08:14,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:08:14,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:08:14,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:08:14,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:08:14" (1/1) ... [2023-08-30 03:08:14,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d9db94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:08:14, skipping insertion in model container [2023-08-30 03:08:14,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:08:14" (1/1) ... [2023-08-30 03:08:14,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:08:14,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:08:14,629 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/safe009_power.oepc.i[995,1008] [2023-08-30 03:08:14,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:08:14,799 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:08:14,809 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/safe009_power.oepc.i[995,1008] [2023-08-30 03:08:14,852 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:08:14,904 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:08:14,904 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:08:14,908 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:08:14,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:08:14 WrapperNode [2023-08-30 03:08:14,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:08:14,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:08:14,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:08:14,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:08:14,914 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:08:14" (1/1) ... [2023-08-30 03:08:14,940 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:08:14" (1/1) ... [2023-08-30 03:08:14,974 INFO L138 Inliner]: procedures = 180, calls = 76, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2023-08-30 03:08:14,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:08:14,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:08:14,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:08:14,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:08:14,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:08:14" (1/1) ... [2023-08-30 03:08:14,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:08:14" (1/1) ... [2023-08-30 03:08:14,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:08:14" (1/1) ... [2023-08-30 03:08:14,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:08:14" (1/1) ... [2023-08-30 03:08:15,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:08:14" (1/1) ... [2023-08-30 03:08:15,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:08:14" (1/1) ... [2023-08-30 03:08:15,018 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:08:14" (1/1) ... [2023-08-30 03:08:15,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:08:14" (1/1) ... [2023-08-30 03:08:15,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:08:15,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:08:15,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:08:15,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:08:15,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:08:14" (1/1) ... [2023-08-30 03:08:15,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:08:15,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:08:15,053 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:08:15,061 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:08:15,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 03:08:15,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:08:15,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:08:15,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:08:15,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:08:15,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 03:08:15,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 03:08:15,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-30 03:08:15,083 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:08:15,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:08:15,083 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:08:15,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:08:15,083 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:08:15,084 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:08:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:08:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:08:15,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:08:15,085 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:08:15,289 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:08:15,292 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:08:15,795 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:08:16,421 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:08:16,422 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:08:16,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:08:16 BoogieIcfgContainer [2023-08-30 03:08:16,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:08:16,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:08:16,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:08:16,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:08:16,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:08:14" (1/3) ... [2023-08-30 03:08:16,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6e8eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:08:16, skipping insertion in model container [2023-08-30 03:08:16,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:08:14" (2/3) ... [2023-08-30 03:08:16,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6e8eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:08:16, skipping insertion in model container [2023-08-30 03:08:16,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:08:16" (3/3) ... [2023-08-30 03:08:16,429 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.oepc.i [2023-08-30 03:08:16,444 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:08:16,444 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2023-08-30 03:08:16,444 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:08:16,548 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:08:16,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 180 transitions, 375 flow [2023-08-30 03:08:16,660 INFO L130 PetriNetUnfolder]: 2/177 cut-off events. [2023-08-30 03:08:16,660 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:08:16,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 2/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 311 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2023-08-30 03:08:16,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 180 transitions, 375 flow [2023-08-30 03:08:16,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 177 transitions, 363 flow [2023-08-30 03:08:16,675 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:08:16,684 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 177 transitions, 363 flow [2023-08-30 03:08:16,687 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 177 transitions, 363 flow [2023-08-30 03:08:16,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 177 transitions, 363 flow [2023-08-30 03:08:16,741 INFO L130 PetriNetUnfolder]: 2/177 cut-off events. [2023-08-30 03:08:16,742 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:08:16,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 2/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 310 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2023-08-30 03:08:16,746 INFO L119 LiptonReduction]: Number of co-enabled transitions 7138 [2023-08-30 03:08:31,569 WARN L222 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 234 DAG size of output: 232 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-30 03:08:42,330 WARN L222 SmtUtils]: Spent 7.66s on a formula simplification. DAG size of input: 263 DAG size of output: 261 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-30 03:08:58,386 WARN L222 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 264 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-30 03:09:08,687 INFO L134 LiptonReduction]: Checked pairs total: 40990 [2023-08-30 03:09:08,688 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-08-30 03:09:08,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:09:08,699 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;@7842b103, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:09:08,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-08-30 03:09:08,700 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:09:08,700 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:09:08,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:08,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:09:08,701 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:09:08,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:08,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1171, now seen corresponding path program 1 times [2023-08-30 03:09:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:09:08,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442934013] [2023-08-30 03:09:08,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:08,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:09:08,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:09:08,718 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:09:08,721 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:09:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:08,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 03:09:08,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:09:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:08,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:09:08,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:09:08,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442934013] [2023-08-30 03:09:08,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442934013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:08,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:08,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:09:08,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667072920] [2023-08-30 03:09:08,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:08,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:09:08,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:09:08,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:09:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:09:08,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 321 [2023-08-30 03:09:08,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 169 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:08,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:08,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 321 [2023-08-30 03:09:08,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:12,088 INFO L130 PetriNetUnfolder]: 16294/23262 cut-off events. [2023-08-30 03:09:12,089 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-30 03:09:12,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46189 conditions, 23262 events. 16294/23262 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2236. Compared 160837 event pairs, 16294 based on Foata normal form. 0/9522 useless extension candidates. Maximal degree in co-relation 46178. Up to 22831 conditions per place. [2023-08-30 03:09:12,194 INFO L137 encePairwiseOnDemand]: 290/321 looper letters, 43 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2023-08-30 03:09:12,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 191 flow [2023-08-30 03:09:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:09:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:09:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 328 transitions. [2023-08-30 03:09:12,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5109034267912772 [2023-08-30 03:09:12,208 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 328 transitions. [2023-08-30 03:09:12,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 328 transitions. [2023-08-30 03:09:12,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:12,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 328 transitions. [2023-08-30 03:09:12,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:12,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:12,222 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:12,224 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 169 flow. Second operand 2 states and 328 transitions. [2023-08-30 03:09:12,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 191 flow [2023-08-30 03:09:12,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:09:12,230 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 102 flow [2023-08-30 03:09:12,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-08-30 03:09:12,234 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -33 predicate places. [2023-08-30 03:09:12,234 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 102 flow [2023-08-30 03:09:12,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:12,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:12,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:09:12,248 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:09:12,446 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:09:12,446 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:09:12,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1156398, now seen corresponding path program 1 times [2023-08-30 03:09:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:09:12,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252728817] [2023-08-30 03:09:12,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:12,448 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:09:12,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:09:12,450 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:09:12,452 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:09:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:12,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:09:12,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:09:12,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 03:09:12,630 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:09:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:12,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:09:12,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:09:12,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252728817] [2023-08-30 03:09:12,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252728817] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:12,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:12,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:09:12,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930746758] [2023-08-30 03:09:12,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:12,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:09:12,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:09:12,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:09:12,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:09:12,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 321 [2023-08-30 03:09:12,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:12,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:12,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 321 [2023-08-30 03:09:12,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:13,999 INFO L130 PetriNetUnfolder]: 5286/7741 cut-off events. [2023-08-30 03:09:14,000 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:09:14,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15357 conditions, 7741 events. 5286/7741 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 46935 event pairs, 5286 based on Foata normal form. 376/4673 useless extension candidates. Maximal degree in co-relation 15354. Up to 7555 conditions per place. [2023-08-30 03:09:14,035 INFO L137 encePairwiseOnDemand]: 310/321 looper letters, 33 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2023-08-30 03:09:14,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 38 transitions, 150 flow [2023-08-30 03:09:14,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:09:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:09:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-30 03:09:14,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43509865005192105 [2023-08-30 03:09:14,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-30 03:09:14,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-30 03:09:14,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:14,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-30 03:09:14,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:14,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:14,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:14,041 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 102 flow. Second operand 3 states and 419 transitions. [2023-08-30 03:09:14,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 38 transitions, 150 flow [2023-08-30 03:09:14,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 150 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:09:14,042 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 84 flow [2023-08-30 03:09:14,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-30 03:09:14,043 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -41 predicate places. [2023-08-30 03:09:14,043 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 84 flow [2023-08-30 03:09:14,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:14,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:14,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:09:14,053 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:09:14,251 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:09:14,251 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:09:14,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1156397, now seen corresponding path program 1 times [2023-08-30 03:09:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:09:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549802685] [2023-08-30 03:09:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:14,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:09:14,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:09:14,261 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:09:14,283 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:09:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:14,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:09:14,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:09:14,408 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-30 03:09:14,409 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:09:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:14,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:09:14,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:09:14,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549802685] [2023-08-30 03:09:14,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549802685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:14,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:14,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:09:14,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799297704] [2023-08-30 03:09:14,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:14,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:09:14,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:09:14,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:09:14,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:09:14,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 321 [2023-08-30 03:09:14,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:14,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:14,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 321 [2023-08-30 03:09:14,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:15,090 INFO L130 PetriNetUnfolder]: 2522/3696 cut-off events. [2023-08-30 03:09:15,091 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:09:15,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7421 conditions, 3696 events. 2522/3696 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 19352 event pairs, 1458 based on Foata normal form. 93/2689 useless extension candidates. Maximal degree in co-relation 7417. Up to 2569 conditions per place. [2023-08-30 03:09:15,102 INFO L137 encePairwiseOnDemand]: 309/321 looper letters, 39 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-30 03:09:15,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 176 flow [2023-08-30 03:09:15,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:09:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:09:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-30 03:09:15,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43302180685358255 [2023-08-30 03:09:15,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-30 03:09:15,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-30 03:09:15,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:15,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-30 03:09:15,105 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:09:15,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:15,107 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:15,107 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 84 flow. Second operand 3 states and 417 transitions. [2023-08-30 03:09:15,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 176 flow [2023-08-30 03:09:15,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:09:15,108 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 97 flow [2023-08-30 03:09:15,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-08-30 03:09:15,109 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -42 predicate places. [2023-08-30 03:09:15,109 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 97 flow [2023-08-30 03:09:15,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:15,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:15,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:15,116 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:09:15,316 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:09:15,318 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:09:15,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:15,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1697028897, now seen corresponding path program 1 times [2023-08-30 03:09:15,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:09:15,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847240455] [2023-08-30 03:09:15,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:15,320 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:09:15,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:09:15,321 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:09:15,321 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:09:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:15,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:09:15,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:09:15,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:09:15,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:09:15,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:09:15,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847240455] [2023-08-30 03:09:15,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847240455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:15,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:15,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:09:15,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181965823] [2023-08-30 03:09:15,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:15,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:09:15,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:09:15,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:09:15,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:09:15,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 321 [2023-08-30 03:09:15,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 97 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:09:15,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:15,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 321 [2023-08-30 03:09:15,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:15,821 INFO L130 PetriNetUnfolder]: 802/1364 cut-off events. [2023-08-30 03:09:15,821 INFO L131 PetriNetUnfolder]: For 59/71 co-relation queries the response was YES. [2023-08-30 03:09:15,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2980 conditions, 1364 events. 802/1364 cut-off events. For 59/71 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 7436 event pairs, 294 based on Foata normal form. 18/1137 useless extension candidates. Maximal degree in co-relation 2975. Up to 1228 conditions per place. [2023-08-30 03:09:15,825 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 41 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-08-30 03:09:15,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 219 flow [2023-08-30 03:09:15,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:09:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:09:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-30 03:09:15,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43094496365524404 [2023-08-30 03:09:15,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-30 03:09:15,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-30 03:09:15,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:15,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-30 03:09:15,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:15,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:15,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:15,830 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 97 flow. Second operand 3 states and 415 transitions. [2023-08-30 03:09:15,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 219 flow [2023-08-30 03:09:15,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:09:15,832 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 119 flow [2023-08-30 03:09:15,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, 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:09:15,832 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -41 predicate places. [2023-08-30 03:09:15,832 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 119 flow [2023-08-30 03:09:15,833 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:09:15,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:15,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:15,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 03:09:16,040 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:09:16,040 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:09:16,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:16,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2077695043, now seen corresponding path program 1 times [2023-08-30 03:09:16,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:09:16,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128194595] [2023-08-30 03:09:16,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:16,041 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:09:16,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:09:16,042 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:09:16,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 03:09:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:16,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:09:16,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:09:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:16,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:09:16,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:09:16,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128194595] [2023-08-30 03:09:16,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128194595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:16,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:16,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:09:16,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216999185] [2023-08-30 03:09:16,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:16,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:09:16,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:09:16,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:09:16,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:09:16,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 321 [2023-08-30 03:09:16,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:16,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:16,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 321 [2023-08-30 03:09:16,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:16,512 INFO L130 PetriNetUnfolder]: 198/407 cut-off events. [2023-08-30 03:09:16,512 INFO L131 PetriNetUnfolder]: For 61/63 co-relation queries the response was YES. [2023-08-30 03:09:16,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 407 events. 198/407 cut-off events. For 61/63 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1686 event pairs, 61 based on Foata normal form. 21/377 useless extension candidates. Maximal degree in co-relation 999. Up to 217 conditions per place. [2023-08-30 03:09:16,514 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 49 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2023-08-30 03:09:16,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 287 flow [2023-08-30 03:09:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:09:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:09:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-30 03:09:16,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42757009345794394 [2023-08-30 03:09:16,516 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-30 03:09:16,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-30 03:09:16,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:16,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-30 03:09:16,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:16,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:16,520 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:16,520 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 119 flow. Second operand 4 states and 549 transitions. [2023-08-30 03:09:16,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 287 flow [2023-08-30 03:09:16,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:09:16,522 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 155 flow [2023-08-30 03:09:16,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, 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:09:16,522 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -38 predicate places. [2023-08-30 03:09:16,523 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 155 flow [2023-08-30 03:09:16,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:16,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:16,523 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:09:16,539 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:09:16,731 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:09:16,731 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:09:16,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:16,732 INFO L85 PathProgramCache]: Analyzing trace with hash -534750528, now seen corresponding path program 1 times [2023-08-30 03:09:16,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:09:16,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114334657] [2023-08-30 03:09:16,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:16,733 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:09:16,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:09:16,734 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:09:16,736 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:09:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:16,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:09:16,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:09:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:16,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:09:16,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:09:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114334657] [2023-08-30 03:09:16,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114334657] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:16,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:16,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:09:16,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443421129] [2023-08-30 03:09:16,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:16,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:09:16,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:09:16,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:09:16,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:09:16,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 321 [2023-08-30 03:09:16,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:16,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:16,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 321 [2023-08-30 03:09:16,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:17,188 INFO L130 PetriNetUnfolder]: 114/224 cut-off events. [2023-08-30 03:09:17,188 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2023-08-30 03:09:17,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 224 events. 114/224 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 755 event pairs, 40 based on Foata normal form. 8/225 useless extension candidates. Maximal degree in co-relation 629. Up to 92 conditions per place. [2023-08-30 03:09:17,189 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 39 selfloop transitions, 10 changer transitions 1/53 dead transitions. [2023-08-30 03:09:17,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 271 flow [2023-08-30 03:09:17,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:09:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:09:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2023-08-30 03:09:17,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41495327102803736 [2023-08-30 03:09:17,191 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2023-08-30 03:09:17,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2023-08-30 03:09:17,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:17,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2023-08-30 03:09:17,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:17,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:17,195 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:17,195 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 155 flow. Second operand 5 states and 666 transitions. [2023-08-30 03:09:17,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 271 flow [2023-08-30 03:09:17,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 255 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 03:09:17,197 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-08-30 03:09:17,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, 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:09:17,197 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -43 predicate places. [2023-08-30 03:09:17,197 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-08-30 03:09:17,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:17,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:17,198 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:09:17,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 03:09:17,398 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:09:17,399 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:09:17,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash 207752714, now seen corresponding path program 1 times [2023-08-30 03:09:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:09:17,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639308998] [2023-08-30 03:09:17,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:17,400 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:09:17,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:09:17,401 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:09:17,402 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:09:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:17,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:09:17,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:09:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:17,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:09:17,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:09:17,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639308998] [2023-08-30 03:09:17,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639308998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:17,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:17,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:09:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790703745] [2023-08-30 03:09:17,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:17,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:09:17,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:09:17,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:09:17,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:09:17,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 321 [2023-08-30 03:09:17,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 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:09:17,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:17,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 321 [2023-08-30 03:09:17,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:17,946 INFO L130 PetriNetUnfolder]: 146/305 cut-off events. [2023-08-30 03:09:17,946 INFO L131 PetriNetUnfolder]: For 347/347 co-relation queries the response was YES. [2023-08-30 03:09:17,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 305 events. 146/305 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1203 event pairs, 23 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 817. Up to 204 conditions per place. [2023-08-30 03:09:17,948 INFO L137 encePairwiseOnDemand]: 317/321 looper letters, 42 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-30 03:09:17,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 277 flow [2023-08-30 03:09:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:09:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:09:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 522 transitions. [2023-08-30 03:09:17,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40654205607476634 [2023-08-30 03:09:17,950 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 522 transitions. [2023-08-30 03:09:17,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 522 transitions. [2023-08-30 03:09:17,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:17,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 522 transitions. [2023-08-30 03:09:17,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:17,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:17,954 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:17,955 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 4 states and 522 transitions. [2023-08-30 03:09:17,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 277 flow [2023-08-30 03:09:17,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 245 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-30 03:09:17,960 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 111 flow [2023-08-30 03:09:17,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-08-30 03:09:17,962 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -46 predicate places. [2023-08-30 03:09:17,962 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 111 flow [2023-08-30 03:09:17,962 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:09:17,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:17,963 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:09:17,976 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:09:18,176 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:09:18,177 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:09:18,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash 876504009, now seen corresponding path program 1 times [2023-08-30 03:09:18,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:09:18,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915134576] [2023-08-30 03:09:18,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:09:18,180 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:09:18,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:09:18,181 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:09:18,183 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:09:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:09:18,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 03:09:18,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:09:18,577 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:09:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:18,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:09:18,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:09:18,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915134576] [2023-08-30 03:09:18,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915134576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:18,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:18,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:09:18,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58888321] [2023-08-30 03:09:18,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:18,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:09:18,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:09:18,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:09:18,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:09:18,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 321 [2023-08-30 03:09:18,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 111 flow. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:18,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:18,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 321 [2023-08-30 03:09:18,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:19,146 INFO L130 PetriNetUnfolder]: 269/491 cut-off events. [2023-08-30 03:09:19,147 INFO L131 PetriNetUnfolder]: For 279/279 co-relation queries the response was YES. [2023-08-30 03:09:19,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 491 events. 269/491 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2053 event pairs, 23 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 1361. Up to 187 conditions per place. [2023-08-30 03:09:19,148 INFO L137 encePairwiseOnDemand]: 315/321 looper letters, 78 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2023-08-30 03:09:19,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 459 flow [2023-08-30 03:09:19,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:09:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:09:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2023-08-30 03:09:19,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3842159916926272 [2023-08-30 03:09:19,150 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2023-08-30 03:09:19,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2023-08-30 03:09:19,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:19,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2023-08-30 03:09:19,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:19,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:19,153 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:19,153 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 111 flow. Second operand 6 states and 740 transitions. [2023-08-30 03:09:19,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 459 flow [2023-08-30 03:09:19,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:09:19,155 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 131 flow [2023-08-30 03:09:19,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=131, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-08-30 03:09:19,156 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -42 predicate places. [2023-08-30 03:09:19,156 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 131 flow [2023-08-30 03:09:19,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:19,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:19,156 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:09:19,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-08-30 03:09:19,365 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:09:19,365 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:09:19,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash -109647351, now seen corresponding path program 2 times [2023-08-30 03:09:19,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:09:19,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788968102] [2023-08-30 03:09:19,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 03:09:19,366 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:09:19,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:09:19,367 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:09:19,369 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:09:19,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:09:19,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:09:19,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-30 03:09:19,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:09:19,727 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:09:19,785 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:09:19,996 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:09:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:20,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:09:20,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:09:20,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788968102] [2023-08-30 03:09:20,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788968102] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:20,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:20,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:09:20,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008437076] [2023-08-30 03:09:20,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:20,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:09:20,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:09:20,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:09:20,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:09:20,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 321 [2023-08-30 03:09:20,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:20,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:20,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 321 [2023-08-30 03:09:20,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:20,755 INFO L130 PetriNetUnfolder]: 287/592 cut-off events. [2023-08-30 03:09:20,755 INFO L131 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2023-08-30 03:09:20,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 592 events. 287/592 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2863 event pairs, 44 based on Foata normal form. 1/593 useless extension candidates. Maximal degree in co-relation 1782. Up to 318 conditions per place. [2023-08-30 03:09:20,758 INFO L137 encePairwiseOnDemand]: 313/321 looper letters, 61 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2023-08-30 03:09:20,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 408 flow [2023-08-30 03:09:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:09:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:09:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 719 transitions. [2023-08-30 03:09:20,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37331256490134995 [2023-08-30 03:09:20,761 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 719 transitions. [2023-08-30 03:09:20,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 719 transitions. [2023-08-30 03:09:20,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:20,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 719 transitions. [2023-08-30 03:09:20,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:20,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:20,766 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:20,766 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 131 flow. Second operand 6 states and 719 transitions. [2023-08-30 03:09:20,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 408 flow [2023-08-30 03:09:20,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 402 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:09:20,770 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 183 flow [2023-08-30 03:09:20,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-30 03:09:20,771 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -38 predicate places. [2023-08-30 03:09:20,771 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 183 flow [2023-08-30 03:09:20,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:20,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:20,772 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:09:20,790 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:09:20,983 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:09:20,983 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:09:20,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:20,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1274986865, now seen corresponding path program 3 times [2023-08-30 03:09:20,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:09:20,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84994222] [2023-08-30 03:09:20,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 03:09:20,984 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:09:20,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:09:20,985 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:09:20,987 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:09:21,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 03:09:21,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:09:21,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 03:09:21,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:09:21,385 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:09:21,467 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:09:21,564 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:09:21,774 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:09:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:09:21,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:09:21,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:09:21,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84994222] [2023-08-30 03:09:21,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84994222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:09:21,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:09:21,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:09:21,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561804664] [2023-08-30 03:09:21,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:09:21,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:09:21,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:09:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:09:21,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:09:22,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 321 [2023-08-30 03:09:22,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 183 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:22,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:09:22,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 321 [2023-08-30 03:09:22,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:09:22,654 INFO L130 PetriNetUnfolder]: 303/644 cut-off events. [2023-08-30 03:09:22,654 INFO L131 PetriNetUnfolder]: For 775/775 co-relation queries the response was YES. [2023-08-30 03:09:22,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2156 conditions, 644 events. 303/644 cut-off events. For 775/775 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3240 event pairs, 60 based on Foata normal form. 1/645 useless extension candidates. Maximal degree in co-relation 2146. Up to 306 conditions per place. [2023-08-30 03:09:22,656 INFO L137 encePairwiseOnDemand]: 314/321 looper letters, 62 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2023-08-30 03:09:22,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 466 flow [2023-08-30 03:09:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:09:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:09:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 719 transitions. [2023-08-30 03:09:22,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37331256490134995 [2023-08-30 03:09:22,658 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 719 transitions. [2023-08-30 03:09:22,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 719 transitions. [2023-08-30 03:09:22,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:09:22,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 719 transitions. [2023-08-30 03:09:22,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:22,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:22,662 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:22,662 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 183 flow. Second operand 6 states and 719 transitions. [2023-08-30 03:09:22,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 466 flow [2023-08-30 03:09:22,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 463 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:09:22,665 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 224 flow [2023-08-30 03:09:22,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-30 03:09:22,666 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -34 predicate places. [2023-08-30 03:09:22,666 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 224 flow [2023-08-30 03:09:22,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:09:22,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:09:22,666 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:09:22,677 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:09:22,877 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:09:22,878 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:09:22,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:09:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1925325949, now seen corresponding path program 4 times [2023-08-30 03:09:22,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:09:22,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607980003] [2023-08-30 03:09:22,878 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 03:09:22,879 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:09:22,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:09:22,879 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:09:22,880 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:09:23,097 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 03:09:23,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 03:09:23,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:09:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:09:23,329 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 03:09:23,330 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:09:23,330 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2023-08-30 03:09:23,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2023-08-30 03:09:23,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2023-08-30 03:09:23,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2023-08-30 03:09:23,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2023-08-30 03:09:23,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2023-08-30 03:09:23,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2023-08-30 03:09:23,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2023-08-30 03:09:23,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2023-08-30 03:09:23,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2023-08-30 03:09:23,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2023-08-30 03:09:23,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2023-08-30 03:09:23,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2023-08-30 03:09:23,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2023-08-30 03:09:23,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2023-08-30 03:09:23,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2023-08-30 03:09:23,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2023-08-30 03:09:23,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2023-08-30 03:09:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2023-08-30 03:09:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2023-08-30 03:09:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2023-08-30 03:09:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2023-08-30 03:09:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2023-08-30 03:09:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2023-08-30 03:09:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2023-08-30 03:09:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2023-08-30 03:09:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2023-08-30 03:09:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2023-08-30 03:09:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2023-08-30 03:09:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2023-08-30 03:09:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2023-08-30 03:09:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2023-08-30 03:09:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2023-08-30 03:09:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2023-08-30 03:09:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2023-08-30 03:09:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2023-08-30 03:09:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2023-08-30 03:09:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2023-08-30 03:09:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2023-08-30 03:09:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2023-08-30 03:09:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2023-08-30 03:09:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2023-08-30 03:09:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2023-08-30 03:09:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2023-08-30 03:09:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2023-08-30 03:09:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2023-08-30 03:09:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2023-08-30 03:09:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 85 remaining) [2023-08-30 03:09:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 85 remaining) [2023-08-30 03:09:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 85 remaining) [2023-08-30 03:09:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 85 remaining) [2023-08-30 03:09:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2023-08-30 03:09:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2023-08-30 03:09:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (31 of 85 remaining) [2023-08-30 03:09:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 85 remaining) [2023-08-30 03:09:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 85 remaining) [2023-08-30 03:09:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 85 remaining) [2023-08-30 03:09:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2023-08-30 03:09:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2023-08-30 03:09:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2023-08-30 03:09:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2023-08-30 03:09:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2023-08-30 03:09:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2023-08-30 03:09:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2023-08-30 03:09:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2023-08-30 03:09:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2023-08-30 03:09:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2023-08-30 03:09:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2023-08-30 03:09:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2023-08-30 03:09:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2023-08-30 03:09:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2023-08-30 03:09:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2023-08-30 03:09:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2023-08-30 03:09:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2023-08-30 03:09:23,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2023-08-30 03:09:23,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2023-08-30 03:09:23,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2023-08-30 03:09:23,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2023-08-30 03:09:23,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2023-08-30 03:09:23,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2023-08-30 03:09:23,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2023-08-30 03:09:23,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2023-08-30 03:09:23,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2023-08-30 03:09:23,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2023-08-30 03:09:23,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2023-08-30 03:09:23,358 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:09:23,555 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:09:23,556 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:09:23,560 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:09:23,560 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:09:23,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:09:23 BasicIcfg [2023-08-30 03:09:23,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:09:23,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:09:23,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:09:23,616 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:09:23,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:08:16" (3/4) ... [2023-08-30 03:09:23,618 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:09:23,618 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:09:23,618 INFO L158 Benchmark]: Toolchain (without parser) took 69114.70ms. Allocated memory was 88.1MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 64.6MB in the beginning and 1.0GB in the end (delta: -965.4MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-08-30 03:09:23,618 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 67.1MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:09:23,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.78ms. Allocated memory is still 88.1MB. Free memory was 64.3MB in the beginning and 62.3MB in the end (delta: 2.0MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2023-08-30 03:09:23,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.14ms. Allocated memory is still 88.1MB. Free memory was 62.3MB in the beginning and 59.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:09:23,619 INFO L158 Benchmark]: Boogie Preprocessor took 51.38ms. Allocated memory is still 88.1MB. Free memory was 59.5MB in the beginning and 56.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:09:23,619 INFO L158 Benchmark]: RCFGBuilder took 1396.46ms. Allocated memory was 88.1MB in the beginning and 134.2MB in the end (delta: 46.1MB). Free memory was 56.7MB in the beginning and 58.0MB in the end (delta: -1.4MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2023-08-30 03:09:23,619 INFO L158 Benchmark]: TraceAbstraction took 67190.25ms. Allocated memory was 134.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 56.9MB in the beginning and 1.0GB in the end (delta: -973.2MB). Peak memory consumption was 971.8MB. Max. memory is 16.1GB. [2023-08-30 03:09:23,619 INFO L158 Benchmark]: Witness Printer took 2.22ms. Allocated memory is still 2.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:09:23,620 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.13ms. Allocated memory is still 67.1MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.78ms. Allocated memory is still 88.1MB. Free memory was 64.3MB in the beginning and 62.3MB in the end (delta: 2.0MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.14ms. Allocated memory is still 88.1MB. Free memory was 62.3MB in the beginning and 59.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.38ms. Allocated memory is still 88.1MB. Free memory was 59.5MB in the beginning and 56.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1396.46ms. Allocated memory was 88.1MB in the beginning and 134.2MB in the end (delta: 46.1MB). Free memory was 56.7MB in the beginning and 58.0MB in the end (delta: -1.4MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. * TraceAbstraction took 67190.25ms. Allocated memory was 134.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 56.9MB in the beginning and 1.0GB in the end (delta: -973.2MB). Peak memory consumption was 971.8MB. Max. memory is 16.1GB. * Witness Printer took 2.22ms. Allocated memory is still 2.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.0s, 185 PlacesBefore, 89 PlacesAfterwards, 177 TransitionsBefore, 80 TransitionsAfterwards, 7138 CoEnabledTransitionPairs, 8 FixpointIterations, 64 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 141 TotalNumberOfCompositions, 40990 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11818, independent: 11066, independent conditional: 0, independent unconditional: 11066, dependent: 752, dependent conditional: 0, dependent unconditional: 752, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2766, independent: 2669, independent conditional: 0, independent unconditional: 2669, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11818, independent: 8397, independent conditional: 0, independent unconditional: 8397, dependent: 655, dependent conditional: 0, dependent unconditional: 655, unknown: 2766, unknown conditional: 0, unknown unconditional: 2766] , Statistics on independence cache: Total cache size (in pairs): 587, Positive cache size: 534, Positive conditional cache size: 0, Positive unconditional cache size: 534, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1985; [L836] FCALL, FORK 0 pthread_create(&t1985, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1985, ((void *)0), P0, ((void *)0))=-1, t1985={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L837] 0 pthread_t t1986; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1985={15:0}, t1986={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L838] FCALL, FORK 0 pthread_create(&t1986, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1986, ((void *)0), P1, ((void *)0))=0, t1985={15:0}, t1986={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] 0 pthread_t t1987; [L840] FCALL, FORK 0 pthread_create(&t1987, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1987, ((void *)0), P2, ((void *)0))=1, t1985={15:0}, t1986={5:0}, t1987={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] EXPR 1 \read(y) [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L765] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L766] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L767] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L768] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L769] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L772] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L773] EXPR 1 \read(y) [L773] 1 __unbuffered_p0_EAX = y [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] EXPR 1 \read(y) [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] 1 y = y$flush_delayed ? y$mem_tmp : y [L775] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L778] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L790] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L793] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 \read(y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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, t1985={15:0}, t1986={5:0}, t1987={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] EXPR 0 \read(y) [L856] 0 y$mem_tmp = y [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] EXPR 0 \read(y) [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L858] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L859] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L860] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L861] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L863] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L865] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L865] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L865] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L865] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 \read(y) [L866] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] 0 y = y$flush_delayed ? y$mem_tmp : y [L868] 0 y$flush_delayed = (_Bool)0 [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 833]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: 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: 838]: 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: 836]: 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: 67.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 52.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 992 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 653 mSDsluCounter, 535 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 310 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1530 IncrementalHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 225 mSDtfsCounter, 1530 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=10, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 1643 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1485 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:09:23,649 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