./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.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/mix026_pso.opt_rmo.opt.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 a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 --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 02:50:09,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:50:09,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:50:09,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:50:09,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:50:09,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:50:09,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:50:09,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:50:09,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:50:09,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:50:09,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:50:09,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:50:09,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:50:09,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:50:09,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:50:09,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:50:09,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:50:09,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:50:09,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:50:09,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:50:09,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:50:09,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:50:09,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:50:09,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:50:09,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:50:09,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:50:09,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:50:09,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:50:09,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:50:09,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:50:09,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:50:09,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:50:09,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:50:09,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:50:09,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:50:09,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:50:09,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:50:09,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:50:09,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:50:09,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:50:09,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:50:09,343 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:50:09,360 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:50:09,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:50:09,361 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:50:09,362 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:50:09,362 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:50:09,362 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:50:09,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:50:09,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:50:09,363 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:50:09,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:50:09,364 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:50:09,364 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:50:09,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:50:09,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:50:09,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:50:09,365 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:50:09,365 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:50:09,365 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:50:09,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:50:09,366 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:50:09,366 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:50:09,366 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:50:09,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:50:09,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:50:09,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:50:09,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:50:09,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:50:09,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:50:09,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:50:09,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:50:09,367 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:50:09,368 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:50:09,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:50:09,368 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:50:09,368 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 -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 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 02:50:09,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:50:09,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:50:09,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:50:09,650 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:50:09,650 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:50:09,651 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-08-30 02:50:10,607 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:50:10,795 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:50:10,795 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-08-30 02:50:10,804 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd74b369d/2d3dddf9e4b3494cadf20764fd012012/FLAG2c611d7d6 [2023-08-30 02:50:10,813 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd74b369d/2d3dddf9e4b3494cadf20764fd012012 [2023-08-30 02:50:10,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:50:10,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:50:10,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:50:10,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:50:10,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:50:10,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:50:10" (1/1) ... [2023-08-30 02:50:10,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7da1fd94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:10, skipping insertion in model container [2023-08-30 02:50:10,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:50:10" (1/1) ... [2023-08-30 02:50:10,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:50:10,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:50:11,008 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/mix026_pso.opt_rmo.opt.i[956,969] [2023-08-30 02:50:11,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:50:11,180 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:50:11,188 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/mix026_pso.opt_rmo.opt.i[956,969] [2023-08-30 02:50:11,224 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:50:11,248 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:50:11,248 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:50:11,252 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:50:11,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:11 WrapperNode [2023-08-30 02:50:11,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:50:11,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:50:11,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:50:11,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:50:11,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:11" (1/1) ... [2023-08-30 02:50:11,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:11" (1/1) ... [2023-08-30 02:50:11,306 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 02:50:11,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:50:11,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:50:11,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:50:11,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:50:11,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:11" (1/1) ... [2023-08-30 02:50:11,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:11" (1/1) ... [2023-08-30 02:50:11,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:11" (1/1) ... [2023-08-30 02:50:11,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:11" (1/1) ... [2023-08-30 02:50:11,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:11" (1/1) ... [2023-08-30 02:50:11,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:11" (1/1) ... [2023-08-30 02:50:11,332 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:11" (1/1) ... [2023-08-30 02:50:11,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:11" (1/1) ... [2023-08-30 02:50:11,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:50:11,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:50:11,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:50:11,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:50:11,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:11" (1/1) ... [2023-08-30 02:50:11,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:50:11,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:50:11,390 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 02:50:11,403 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 02:50:11,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:50:11,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:50:11,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:50:11,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:50:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:50:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:50:11,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:50:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:50:11,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:50:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:50:11,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:50:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:50:11,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:50:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:50:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:50:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:50:11,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:50:11,426 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 02:50:11,543 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:50:11,544 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:50:11,809 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:50:11,894 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:50:11,894 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:50:11,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:11 BoogieIcfgContainer [2023-08-30 02:50:11,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:50:11,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:50:11,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:50:11,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:50:11,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:50:10" (1/3) ... [2023-08-30 02:50:11,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2646fdde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:50:11, skipping insertion in model container [2023-08-30 02:50:11,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:11" (2/3) ... [2023-08-30 02:50:11,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2646fdde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:50:11, skipping insertion in model container [2023-08-30 02:50:11,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:11" (3/3) ... [2023-08-30 02:50:11,901 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2023-08-30 02:50:11,911 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:50:11,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:50:11,911 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:50:11,963 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:50:11,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2023-08-30 02:50:12,025 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-30 02:50:12,027 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:12,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:50:12,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2023-08-30 02:50:12,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2023-08-30 02:50:12,041 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:50:12,050 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-30 02:50:12,055 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-30 02:50:12,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 286 flow [2023-08-30 02:50:12,092 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-30 02:50:12,092 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:12,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:50:12,094 INFO L119 LiptonReduction]: Number of co-enabled transitions 3172 [2023-08-30 02:50:15,826 INFO L134 LiptonReduction]: Checked pairs total: 8505 [2023-08-30 02:50:15,826 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-08-30 02:50:15,835 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:50:15,839 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;@57bed20c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:50:15,840 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:50:15,841 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:50:15,846 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:15,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:15,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:50:15,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:15,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:15,851 INFO L85 PathProgramCache]: Analyzing trace with hash 590, now seen corresponding path program 1 times [2023-08-30 02:50:15,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:15,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261988671] [2023-08-30 02:50:15,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:15,963 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 02:50:15,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:15,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261988671] [2023-08-30 02:50:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261988671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:15,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:15,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:50:15,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219617840] [2023-08-30 02:50:15,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:15,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:50:15,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:15,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:50:15,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:50:15,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 282 [2023-08-30 02:50:15,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:15,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:15,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 282 [2023-08-30 02:50:15,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:16,720 INFO L130 PetriNetUnfolder]: 5049/7097 cut-off events. [2023-08-30 02:50:16,720 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2023-08-30 02:50:16,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14135 conditions, 7097 events. 5049/7097 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 37298 event pairs, 5049 based on Foata normal form. 0/6064 useless extension candidates. Maximal degree in co-relation 14123. Up to 6881 conditions per place. [2023-08-30 02:50:16,752 INFO L137 encePairwiseOnDemand]: 273/282 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-30 02:50:16,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-30 02:50:16,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:50:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:50:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2023-08-30 02:50:16,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159574468085106 [2023-08-30 02:50:16,761 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 291 transitions. [2023-08-30 02:50:16,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions. [2023-08-30 02:50:16,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:16,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions. [2023-08-30 02:50:16,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:16,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 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 02:50:16,768 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 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 02:50:16,769 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 291 transitions. [2023-08-30 02:50:16,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-30 02:50:16,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:50:16,773 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-30 02:50:16,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-30 02:50:16,776 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-30 02:50:16,776 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-30 02:50:16,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:16,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:16,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:16,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:50:16,777 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:16,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:16,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1685983495, now seen corresponding path program 1 times [2023-08-30 02:50:16,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:16,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217994623] [2023-08-30 02:50:16,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:16,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:17,001 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 02:50:17,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:17,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217994623] [2023-08-30 02:50:17,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217994623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:17,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:17,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:50:17,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701356464] [2023-08-30 02:50:17,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:17,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:50:17,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:17,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:50:17,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:50:17,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 282 [2023-08-30 02:50:17,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:17,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:17,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 282 [2023-08-30 02:50:17,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:17,460 INFO L130 PetriNetUnfolder]: 3975/5855 cut-off events. [2023-08-30 02:50:17,460 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:17,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11432 conditions, 5855 events. 3975/5855 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 33632 event pairs, 753 based on Foata normal form. 0/5422 useless extension candidates. Maximal degree in co-relation 11429. Up to 4303 conditions per place. [2023-08-30 02:50:17,486 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-08-30 02:50:17,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 182 flow [2023-08-30 02:50:17,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:50:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:50:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-30 02:50:17,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 02:50:17,491 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-30 02:50:17,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-30 02:50:17,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:17,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-30 02:50:17,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:17,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:17,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:17,498 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 423 transitions. [2023-08-30 02:50:17,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 182 flow [2023-08-30 02:50:17,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:50:17,499 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-30 02:50:17,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-30 02:50:17,500 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-30 02:50:17,500 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-30 02:50:17,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:17,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:17,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:17,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:50:17,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:17,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:17,503 INFO L85 PathProgramCache]: Analyzing trace with hash 515766718, now seen corresponding path program 1 times [2023-08-30 02:50:17,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:17,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283372168] [2023-08-30 02:50:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:17,793 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 02:50:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283372168] [2023-08-30 02:50:17,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283372168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:17,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:17,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:50:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494653877] [2023-08-30 02:50:17,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:17,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:50:17,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:17,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:50:17,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:50:17,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 282 [2023-08-30 02:50:17,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:17,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:17,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 282 [2023-08-30 02:50:17,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:19,098 INFO L130 PetriNetUnfolder]: 14435/19592 cut-off events. [2023-08-30 02:50:19,098 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2023-08-30 02:50:19,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40251 conditions, 19592 events. 14435/19592 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 102093 event pairs, 5075 based on Foata normal form. 0/19132 useless extension candidates. Maximal degree in co-relation 40247. Up to 12481 conditions per place. [2023-08-30 02:50:19,172 INFO L137 encePairwiseOnDemand]: 273/282 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-08-30 02:50:19,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 232 flow [2023-08-30 02:50:19,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:50:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:50:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-30 02:50:19,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48226950354609927 [2023-08-30 02:50:19,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-30 02:50:19,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-30 02:50:19,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:19,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-30 02:50:19,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:19,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:19,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:19,178 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 408 transitions. [2023-08-30 02:50:19,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 232 flow [2023-08-30 02:50:19,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:50:19,180 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 126 flow [2023-08-30 02:50:19,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-08-30 02:50:19,180 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2023-08-30 02:50:19,181 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 126 flow [2023-08-30 02:50:19,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:19,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:19,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:19,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:50:19,182 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:19,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:19,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1191103456, now seen corresponding path program 1 times [2023-08-30 02:50:19,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:19,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687154984] [2023-08-30 02:50:19,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:19,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:19,287 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 02:50:19,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:19,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687154984] [2023-08-30 02:50:19,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687154984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:19,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:19,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:50:19,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030236458] [2023-08-30 02:50:19,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:19,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:50:19,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:19,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:50:19,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:50:19,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 282 [2023-08-30 02:50:19,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:19,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:19,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 282 [2023-08-30 02:50:19,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:20,425 INFO L130 PetriNetUnfolder]: 11030/15697 cut-off events. [2023-08-30 02:50:20,425 INFO L131 PetriNetUnfolder]: For 5654/5704 co-relation queries the response was YES. [2023-08-30 02:50:20,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37640 conditions, 15697 events. 11030/15697 cut-off events. For 5654/5704 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 89694 event pairs, 3603 based on Foata normal form. 148/15693 useless extension candidates. Maximal degree in co-relation 37635. Up to 9690 conditions per place. [2023-08-30 02:50:20,504 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 40 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-08-30 02:50:20,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 252 flow [2023-08-30 02:50:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:50:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:50:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-30 02:50:20,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.491725768321513 [2023-08-30 02:50:20,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-30 02:50:20,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-30 02:50:20,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:20,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-30 02:50:20,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:20,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:20,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:20,509 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 126 flow. Second operand 3 states and 416 transitions. [2023-08-30 02:50:20,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 252 flow [2023-08-30 02:50:20,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:50:20,528 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 121 flow [2023-08-30 02:50:20,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-08-30 02:50:20,529 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2023-08-30 02:50:20,544 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 121 flow [2023-08-30 02:50:20,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:20,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:20,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:20,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:50:20,545 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:20,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1191099996, now seen corresponding path program 1 times [2023-08-30 02:50:20,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:20,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197222934] [2023-08-30 02:50:20,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:20,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:20,942 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 02:50:20,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:20,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197222934] [2023-08-30 02:50:20,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197222934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:20,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:20,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:50:20,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902116727] [2023-08-30 02:50:20,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:20,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:50:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:20,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:50:20,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:50:21,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 282 [2023-08-30 02:50:21,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 121 flow. Second operand has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:21,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:21,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 282 [2023-08-30 02:50:21,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:21,983 INFO L130 PetriNetUnfolder]: 8048/11666 cut-off events. [2023-08-30 02:50:21,984 INFO L131 PetriNetUnfolder]: For 2643/3033 co-relation queries the response was YES. [2023-08-30 02:50:21,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27376 conditions, 11666 events. 8048/11666 cut-off events. For 2643/3033 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 68554 event pairs, 1515 based on Foata normal form. 660/12005 useless extension candidates. Maximal degree in co-relation 27370. Up to 7224 conditions per place. [2023-08-30 02:50:22,016 INFO L137 encePairwiseOnDemand]: 276/282 looper letters, 37 selfloop transitions, 4 changer transitions 15/64 dead transitions. [2023-08-30 02:50:22,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 307 flow [2023-08-30 02:50:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:50:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:50:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 813 transitions. [2023-08-30 02:50:22,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41185410334346506 [2023-08-30 02:50:22,019 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 813 transitions. [2023-08-30 02:50:22,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 813 transitions. [2023-08-30 02:50:22,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:22,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 813 transitions. [2023-08-30 02:50:22,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:22,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:22,023 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:22,024 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 121 flow. Second operand 7 states and 813 transitions. [2023-08-30 02:50:22,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 307 flow [2023-08-30 02:50:22,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:50:22,036 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 113 flow [2023-08-30 02:50:22,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=113, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-08-30 02:50:22,037 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-08-30 02:50:22,037 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 113 flow [2023-08-30 02:50:22,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:22,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:22,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:22,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:50:22,038 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:22,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:22,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1727546844, now seen corresponding path program 1 times [2023-08-30 02:50:22,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:22,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731754308] [2023-08-30 02:50:22,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:22,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:22,194 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 02:50:22,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:22,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731754308] [2023-08-30 02:50:22,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731754308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:22,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:22,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:50:22,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130738562] [2023-08-30 02:50:22,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:22,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:50:22,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:22,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:50:22,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:50:22,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 282 [2023-08-30 02:50:22,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:22,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:22,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 282 [2023-08-30 02:50:22,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:22,640 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][68], [Black: 164#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 47#L756true, Black: 170#(= ~__unbuffered_p3_EAX~0 0), 155#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 181#true, P0Thread1of1ForFork2InUse, 78#L2true, P3Thread1of1ForFork1InUse, 13#L839true, 68#P2EXITtrue, 121#L784true, 178#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)))]) [2023-08-30 02:50:22,641 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:50:22,641 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:50:22,641 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:50:22,641 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:50:22,684 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][68], [Black: 164#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 41#P1EXITtrue, 47#L756true, Black: 170#(= ~__unbuffered_p3_EAX~0 0), 155#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 181#true, P0Thread1of1ForFork2InUse, 78#L2true, P3Thread1of1ForFork1InUse, 13#L839true, 68#P2EXITtrue, 178#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)))]) [2023-08-30 02:50:22,685 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:50:22,685 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:50:22,685 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:50:22,685 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:50:22,686 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][68], [Black: 164#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 86#L874true, 47#L756true, Black: 170#(= ~__unbuffered_p3_EAX~0 0), 155#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 181#true, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 13#L839true, 68#P2EXITtrue, 121#L784true, 178#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)))]) [2023-08-30 02:50:22,686 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:50:22,686 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:50:22,686 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:50:22,686 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:50:22,687 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([539] L874-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_12 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~main$tmp_guard1~0_12 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= v_~__unbuffered_p0_EAX~0_12 0) (= 2 v_~__unbuffered_p3_EAX~0_12) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][71], [73#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 164#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 80#L832true, 47#L756true, Black: 170#(= ~__unbuffered_p3_EAX~0 0), 155#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 181#true, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 68#P2EXITtrue, 121#L784true, 178#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)))]) [2023-08-30 02:50:22,687 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:50:22,687 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:50:22,687 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:50:22,687 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:50:22,714 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][68], [Black: 164#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 41#P1EXITtrue, 86#L874true, 47#L756true, Black: 170#(= ~__unbuffered_p3_EAX~0 0), 155#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 181#true, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 13#L839true, 68#P2EXITtrue, 178#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)))]) [2023-08-30 02:50:22,715 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 02:50:22,716 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:50:22,716 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:50:22,717 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:50:22,718 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([539] L874-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_12 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~main$tmp_guard1~0_12 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= v_~__unbuffered_p0_EAX~0_12 0) (= 2 v_~__unbuffered_p3_EAX~0_12) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][71], [73#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 164#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 41#P1EXITtrue, 80#L832true, 47#L756true, Black: 170#(= ~__unbuffered_p3_EAX~0 0), 155#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 181#true, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 68#P2EXITtrue, 178#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)))]) [2023-08-30 02:50:22,718 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 02:50:22,718 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:50:22,718 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:50:22,718 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:50:22,783 INFO L130 PetriNetUnfolder]: 5043/7557 cut-off events. [2023-08-30 02:50:22,783 INFO L131 PetriNetUnfolder]: For 1527/1613 co-relation queries the response was YES. [2023-08-30 02:50:22,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17111 conditions, 7557 events. 5043/7557 cut-off events. For 1527/1613 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 45204 event pairs, 939 based on Foata normal form. 573/7865 useless extension candidates. Maximal degree in co-relation 17105. Up to 4920 conditions per place. [2023-08-30 02:50:22,809 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 60 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2023-08-30 02:50:22,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 381 flow [2023-08-30 02:50:22,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:50:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:50:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2023-08-30 02:50:22,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47801418439716314 [2023-08-30 02:50:22,812 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2023-08-30 02:50:22,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2023-08-30 02:50:22,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:22,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2023-08-30 02:50:22,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:22,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:22,817 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:22,817 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 113 flow. Second operand 5 states and 674 transitions. [2023-08-30 02:50:22,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 78 transitions, 381 flow [2023-08-30 02:50:22,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 369 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:50:22,819 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 181 flow [2023-08-30 02:50:22,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2023-08-30 02:50:22,821 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2023-08-30 02:50:22,821 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 181 flow [2023-08-30 02:50:22,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:22,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:22,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:22,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:50:22,823 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:22,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:22,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2106840045, now seen corresponding path program 1 times [2023-08-30 02:50:22,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:22,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030733864] [2023-08-30 02:50:22,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:22,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:23,021 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 02:50:23,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:23,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030733864] [2023-08-30 02:50:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030733864] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:23,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:23,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:50:23,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258954059] [2023-08-30 02:50:23,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:23,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:50:23,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:23,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:50:23,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:50:23,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 282 [2023-08-30 02:50:23,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:23,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:23,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 282 [2023-08-30 02:50:23,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:23,662 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][75], [Black: 164#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 47#L756true, Black: 170#(= ~__unbuffered_p3_EAX~0 0), 155#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 181#true, 78#L2true, 199#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 13#L839true, Black: 183#(= ~__unbuffered_cnt~0 0), Black: 186#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 68#P2EXITtrue, Black: 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 121#L784true, 178#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)))]) [2023-08-30 02:50:23,662 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:50:23,662 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:50:23,663 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:50:23,663 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:50:23,703 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][97], [Black: 164#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 41#P1EXITtrue, 47#L756true, Black: 170#(= ~__unbuffered_p3_EAX~0 0), 155#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 181#true, 195#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 78#L2true, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 13#L839true, Black: 183#(= ~__unbuffered_cnt~0 0), 68#P2EXITtrue, Black: 186#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 184#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 178#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)))]) [2023-08-30 02:50:23,704 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:50:23,704 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:50:23,704 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:50:23,704 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:50:23,752 INFO L130 PetriNetUnfolder]: 4007/6228 cut-off events. [2023-08-30 02:50:23,753 INFO L131 PetriNetUnfolder]: For 3562/3606 co-relation queries the response was YES. [2023-08-30 02:50:23,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18733 conditions, 6228 events. 4007/6228 cut-off events. For 3562/3606 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 38201 event pairs, 416 based on Foata normal form. 401/6461 useless extension candidates. Maximal degree in co-relation 18724. Up to 2168 conditions per place. [2023-08-30 02:50:23,782 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 82 selfloop transitions, 19 changer transitions 0/109 dead transitions. [2023-08-30 02:50:23,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 109 transitions, 621 flow [2023-08-30 02:50:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:50:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:50:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 945 transitions. [2023-08-30 02:50:23,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2023-08-30 02:50:23,786 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 945 transitions. [2023-08-30 02:50:23,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 945 transitions. [2023-08-30 02:50:23,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:23,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 945 transitions. [2023-08-30 02:50:23,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:23,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:23,790 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:23,790 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 181 flow. Second operand 7 states and 945 transitions. [2023-08-30 02:50:23,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 109 transitions, 621 flow [2023-08-30 02:50:23,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 109 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:50:23,806 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 310 flow [2023-08-30 02:50:23,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2023-08-30 02:50:23,807 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-30 02:50:23,807 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 310 flow [2023-08-30 02:50:23,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:23,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:23,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:23,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:50:23,808 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:23,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:23,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2034397257, now seen corresponding path program 1 times [2023-08-30 02:50:23,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:23,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619312669] [2023-08-30 02:50:23,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:23,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:50:23,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:23,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619312669] [2023-08-30 02:50:23,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619312669] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:23,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:23,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:50:23,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706689814] [2023-08-30 02:50:23,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:23,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:50:23,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:23,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:50:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:50:23,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 282 [2023-08-30 02:50:23,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:23,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:23,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 282 [2023-08-30 02:50:23,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:24,922 INFO L130 PetriNetUnfolder]: 7948/11832 cut-off events. [2023-08-30 02:50:24,922 INFO L131 PetriNetUnfolder]: For 25664/25664 co-relation queries the response was YES. [2023-08-30 02:50:24,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44646 conditions, 11832 events. 7948/11832 cut-off events. For 25664/25664 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 70368 event pairs, 745 based on Foata normal form. 46/11878 useless extension candidates. Maximal degree in co-relation 44634. Up to 4451 conditions per place. [2023-08-30 02:50:24,956 INFO L137 encePairwiseOnDemand]: 273/282 looper letters, 109 selfloop transitions, 15 changer transitions 66/190 dead transitions. [2023-08-30 02:50:24,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 190 transitions, 1624 flow [2023-08-30 02:50:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:50:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:50:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions. [2023-08-30 02:50:24,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4734042553191489 [2023-08-30 02:50:24,959 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 801 transitions. [2023-08-30 02:50:24,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 801 transitions. [2023-08-30 02:50:24,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:24,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 801 transitions. [2023-08-30 02:50:24,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:24,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:24,963 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:24,963 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 310 flow. Second operand 6 states and 801 transitions. [2023-08-30 02:50:24,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 190 transitions, 1624 flow [2023-08-30 02:50:25,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 190 transitions, 1404 flow, removed 77 selfloop flow, removed 3 redundant places. [2023-08-30 02:50:25,244 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 268 flow [2023-08-30 02:50:25,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-08-30 02:50:25,244 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2023-08-30 02:50:25,244 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 268 flow [2023-08-30 02:50:25,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:25,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:25,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:25,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:50:25,245 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:25,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:25,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1219847817, now seen corresponding path program 2 times [2023-08-30 02:50:25,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:25,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138599656] [2023-08-30 02:50:25,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:25,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:25,379 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 02:50:25,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:25,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138599656] [2023-08-30 02:50:25,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138599656] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:25,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:25,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:50:25,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080509041] [2023-08-30 02:50:25,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:25,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:50:25,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:25,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:50:25,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:50:25,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 282 [2023-08-30 02:50:25,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:25,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:25,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 282 [2023-08-30 02:50:25,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:25,759 INFO L130 PetriNetUnfolder]: 2430/4012 cut-off events. [2023-08-30 02:50:25,759 INFO L131 PetriNetUnfolder]: For 6490/6545 co-relation queries the response was YES. [2023-08-30 02:50:25,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13416 conditions, 4012 events. 2430/4012 cut-off events. For 6490/6545 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 24198 event pairs, 346 based on Foata normal form. 278/4210 useless extension candidates. Maximal degree in co-relation 13402. Up to 1247 conditions per place. [2023-08-30 02:50:25,773 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 77 selfloop transitions, 18 changer transitions 17/126 dead transitions. [2023-08-30 02:50:25,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 126 transitions, 870 flow [2023-08-30 02:50:25,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:50:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:50:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 946 transitions. [2023-08-30 02:50:25,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47922998986828774 [2023-08-30 02:50:25,775 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 946 transitions. [2023-08-30 02:50:25,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 946 transitions. [2023-08-30 02:50:25,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:25,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 946 transitions. [2023-08-30 02:50:25,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:25,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:25,780 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:25,780 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 268 flow. Second operand 7 states and 946 transitions. [2023-08-30 02:50:25,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 126 transitions, 870 flow [2023-08-30 02:50:25,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 126 transitions, 832 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-30 02:50:25,800 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 392 flow [2023-08-30 02:50:25,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=392, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2023-08-30 02:50:25,800 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-08-30 02:50:25,800 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 392 flow [2023-08-30 02:50:25,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:25,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:25,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:25,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:50:25,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:25,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:25,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1460662343, now seen corresponding path program 1 times [2023-08-30 02:50:25,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:25,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124917698] [2023-08-30 02:50:25,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:25,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:26,128 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 02:50:26,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:26,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124917698] [2023-08-30 02:50:26,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124917698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:26,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:26,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:50:26,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258230669] [2023-08-30 02:50:26,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:26,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:50:26,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:26,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:50:26,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:50:26,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 282 [2023-08-30 02:50:26,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:26,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:26,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 282 [2023-08-30 02:50:26,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:26,831 INFO L130 PetriNetUnfolder]: 5007/7784 cut-off events. [2023-08-30 02:50:26,831 INFO L131 PetriNetUnfolder]: For 18450/18450 co-relation queries the response was YES. [2023-08-30 02:50:26,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30221 conditions, 7784 events. 5007/7784 cut-off events. For 18450/18450 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 45812 event pairs, 518 based on Foata normal form. 13/7797 useless extension candidates. Maximal degree in co-relation 30206. Up to 3105 conditions per place. [2023-08-30 02:50:26,856 INFO L137 encePairwiseOnDemand]: 269/282 looper letters, 138 selfloop transitions, 42 changer transitions 47/227 dead transitions. [2023-08-30 02:50:26,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 227 transitions, 2032 flow [2023-08-30 02:50:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:50:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:50:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 921 transitions. [2023-08-30 02:50:26,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46656534954407297 [2023-08-30 02:50:26,859 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 921 transitions. [2023-08-30 02:50:26,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 921 transitions. [2023-08-30 02:50:26,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:26,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 921 transitions. [2023-08-30 02:50:26,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.57142857142858) internal successors, (921), 7 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:26,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:26,863 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:26,864 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 392 flow. Second operand 7 states and 921 transitions. [2023-08-30 02:50:26,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 227 transitions, 2032 flow [2023-08-30 02:50:26,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 227 transitions, 1707 flow, removed 132 selfloop flow, removed 2 redundant places. [2023-08-30 02:50:26,992 INFO L231 Difference]: Finished difference. Result has 70 places, 87 transitions, 686 flow [2023-08-30 02:50:26,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=686, PETRI_PLACES=70, PETRI_TRANSITIONS=87} [2023-08-30 02:50:26,993 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2023-08-30 02:50:26,993 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 87 transitions, 686 flow [2023-08-30 02:50:26,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:26,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:26,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:26,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:50:26,994 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:26,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2131742090, now seen corresponding path program 1 times [2023-08-30 02:50:26,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:26,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407785227] [2023-08-30 02:50:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:26,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:27,157 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 02:50:27,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:27,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407785227] [2023-08-30 02:50:27,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407785227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:27,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:27,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:50:27,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883011255] [2023-08-30 02:50:27,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:27,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:50:27,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:27,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:50:27,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:50:27,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 282 [2023-08-30 02:50:27,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 87 transitions, 686 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:27,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:27,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 282 [2023-08-30 02:50:27,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:27,773 INFO L130 PetriNetUnfolder]: 4374/6897 cut-off events. [2023-08-30 02:50:27,773 INFO L131 PetriNetUnfolder]: For 19126/19126 co-relation queries the response was YES. [2023-08-30 02:50:27,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30016 conditions, 6897 events. 4374/6897 cut-off events. For 19126/19126 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 40571 event pairs, 771 based on Foata normal form. 13/6910 useless extension candidates. Maximal degree in co-relation 29995. Up to 2774 conditions per place. [2023-08-30 02:50:27,799 INFO L137 encePairwiseOnDemand]: 273/282 looper letters, 110 selfloop transitions, 29 changer transitions 57/196 dead transitions. [2023-08-30 02:50:27,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 196 transitions, 1782 flow [2023-08-30 02:50:27,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:50:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:50:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 798 transitions. [2023-08-30 02:50:27,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716312056737589 [2023-08-30 02:50:27,802 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 798 transitions. [2023-08-30 02:50:27,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 798 transitions. [2023-08-30 02:50:27,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:27,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 798 transitions. [2023-08-30 02:50:27,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:27,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:27,806 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:27,806 INFO L175 Difference]: Start difference. First operand has 70 places, 87 transitions, 686 flow. Second operand 6 states and 798 transitions. [2023-08-30 02:50:27,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 196 transitions, 1782 flow [2023-08-30 02:50:27,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 196 transitions, 1750 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-30 02:50:27,918 INFO L231 Difference]: Finished difference. Result has 72 places, 76 transitions, 642 flow [2023-08-30 02:50:27,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=642, PETRI_PLACES=72, PETRI_TRANSITIONS=76} [2023-08-30 02:50:27,920 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2023-08-30 02:50:27,920 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 76 transitions, 642 flow [2023-08-30 02:50:27,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:27,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:27,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:27,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:50:27,921 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:27,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:27,922 INFO L85 PathProgramCache]: Analyzing trace with hash 543826186, now seen corresponding path program 2 times [2023-08-30 02:50:27,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:27,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847993938] [2023-08-30 02:50:27,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:27,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:28,093 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 02:50:28,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:28,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847993938] [2023-08-30 02:50:28,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847993938] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:28,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:28,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:50:28,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860162001] [2023-08-30 02:50:28,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:28,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:50:28,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:28,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:50:28,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:50:28,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 282 [2023-08-30 02:50:28,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 76 transitions, 642 flow. Second operand has 7 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:28,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:28,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 282 [2023-08-30 02:50:28,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:28,546 INFO L130 PetriNetUnfolder]: 2613/4326 cut-off events. [2023-08-30 02:50:28,546 INFO L131 PetriNetUnfolder]: For 13181/13357 co-relation queries the response was YES. [2023-08-30 02:50:28,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18015 conditions, 4326 events. 2613/4326 cut-off events. For 13181/13357 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 26908 event pairs, 305 based on Foata normal form. 167/4395 useless extension candidates. Maximal degree in co-relation 17994. Up to 1642 conditions per place. [2023-08-30 02:50:28,562 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 65 selfloop transitions, 17 changer transitions 73/168 dead transitions. [2023-08-30 02:50:28,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 168 transitions, 1598 flow [2023-08-30 02:50:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:50:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:50:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1057 transitions. [2023-08-30 02:50:28,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46852836879432624 [2023-08-30 02:50:28,565 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1057 transitions. [2023-08-30 02:50:28,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1057 transitions. [2023-08-30 02:50:28,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:28,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1057 transitions. [2023-08-30 02:50:28,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.125) internal successors, (1057), 8 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:28,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 282.0) internal successors, (2538), 9 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:28,570 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 282.0) internal successors, (2538), 9 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:28,570 INFO L175 Difference]: Start difference. First operand has 72 places, 76 transitions, 642 flow. Second operand 8 states and 1057 transitions. [2023-08-30 02:50:28,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 168 transitions, 1598 flow [2023-08-30 02:50:28,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 168 transitions, 1473 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-30 02:50:28,672 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 438 flow [2023-08-30 02:50:28,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=438, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2023-08-30 02:50:28,672 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2023-08-30 02:50:28,672 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 438 flow [2023-08-30 02:50:28,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:28,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:28,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:28,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:50:28,673 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:28,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:28,674 INFO L85 PathProgramCache]: Analyzing trace with hash -137631043, now seen corresponding path program 1 times [2023-08-30 02:50:28,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:28,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196285100] [2023-08-30 02:50:28,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:28,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:28,834 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 02:50:28,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:28,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196285100] [2023-08-30 02:50:28,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196285100] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:28,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:28,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:50:28,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894972651] [2023-08-30 02:50:28,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:28,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:50:28,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:28,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:50:28,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:50:28,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 282 [2023-08-30 02:50:28,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 438 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:28,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:28,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 282 [2023-08-30 02:50:28,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:29,174 INFO L130 PetriNetUnfolder]: 2006/3308 cut-off events. [2023-08-30 02:50:29,174 INFO L131 PetriNetUnfolder]: For 10286/10286 co-relation queries the response was YES. [2023-08-30 02:50:29,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14828 conditions, 3308 events. 2006/3308 cut-off events. For 10286/10286 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 18395 event pairs, 613 based on Foata normal form. 1/3309 useless extension candidates. Maximal degree in co-relation 14806. Up to 2014 conditions per place. [2023-08-30 02:50:29,188 INFO L137 encePairwiseOnDemand]: 276/282 looper letters, 39 selfloop transitions, 3 changer transitions 57/99 dead transitions. [2023-08-30 02:50:29,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 933 flow [2023-08-30 02:50:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:50:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:50:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-30 02:50:29,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2023-08-30 02:50:29,191 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-30 02:50:29,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-30 02:50:29,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:29,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-30 02:50:29,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:29,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:29,194 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:29,194 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 438 flow. Second operand 4 states and 528 transitions. [2023-08-30 02:50:29,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 933 flow [2023-08-30 02:50:29,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 99 transitions, 790 flow, removed 36 selfloop flow, removed 11 redundant places. [2023-08-30 02:50:29,233 INFO L231 Difference]: Finished difference. Result has 66 places, 38 transitions, 215 flow [2023-08-30 02:50:29,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=66, PETRI_TRANSITIONS=38} [2023-08-30 02:50:29,233 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2023-08-30 02:50:29,233 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 38 transitions, 215 flow [2023-08-30 02:50:29,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:29,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:29,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:29,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:50:29,234 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:29,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:29,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1261778697, now seen corresponding path program 2 times [2023-08-30 02:50:29,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:29,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644353047] [2023-08-30 02:50:29,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:29,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:29,555 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 02:50:29,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:29,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644353047] [2023-08-30 02:50:29,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644353047] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:29,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:29,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:50:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405472186] [2023-08-30 02:50:29,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:29,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:50:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:29,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:50:29,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:50:29,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 282 [2023-08-30 02:50:29,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 38 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:29,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:29,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 282 [2023-08-30 02:50:29,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:29,748 INFO L130 PetriNetUnfolder]: 388/695 cut-off events. [2023-08-30 02:50:29,748 INFO L131 PetriNetUnfolder]: For 1390/1390 co-relation queries the response was YES. [2023-08-30 02:50:29,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2679 conditions, 695 events. 388/695 cut-off events. For 1390/1390 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3022 event pairs, 68 based on Foata normal form. 1/696 useless extension candidates. Maximal degree in co-relation 2662. Up to 354 conditions per place. [2023-08-30 02:50:29,750 INFO L137 encePairwiseOnDemand]: 274/282 looper letters, 53 selfloop transitions, 9 changer transitions 35/97 dead transitions. [2023-08-30 02:50:29,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 97 transitions, 748 flow [2023-08-30 02:50:29,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:50:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:50:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 974 transitions. [2023-08-30 02:50:29,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4317375886524823 [2023-08-30 02:50:29,752 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 974 transitions. [2023-08-30 02:50:29,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 974 transitions. [2023-08-30 02:50:29,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:29,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 974 transitions. [2023-08-30 02:50:29,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.75) internal successors, (974), 8 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:29,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 282.0) internal successors, (2538), 9 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:29,756 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 282.0) internal successors, (2538), 9 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:29,756 INFO L175 Difference]: Start difference. First operand has 66 places, 38 transitions, 215 flow. Second operand 8 states and 974 transitions. [2023-08-30 02:50:29,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 97 transitions, 748 flow [2023-08-30 02:50:29,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 696 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-08-30 02:50:29,761 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 251 flow [2023-08-30 02:50:29,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=251, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2023-08-30 02:50:29,762 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-08-30 02:50:29,762 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 251 flow [2023-08-30 02:50:29,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:29,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:29,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:29,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:50:29,763 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:29,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1154213619, now seen corresponding path program 3 times [2023-08-30 02:50:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:29,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054183333] [2023-08-30 02:50:29,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:29,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:30,424 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 02:50:30,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:30,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054183333] [2023-08-30 02:50:30,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054183333] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:30,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:30,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:50:30,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199549088] [2023-08-30 02:50:30,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:30,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:50:30,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:30,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:50:30,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:50:30,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 282 [2023-08-30 02:50:30,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 251 flow. Second operand has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:30,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:30,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 282 [2023-08-30 02:50:30,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:30,597 INFO L130 PetriNetUnfolder]: 249/472 cut-off events. [2023-08-30 02:50:30,597 INFO L131 PetriNetUnfolder]: For 1075/1076 co-relation queries the response was YES. [2023-08-30 02:50:30,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1898 conditions, 472 events. 249/472 cut-off events. For 1075/1076 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1901 event pairs, 107 based on Foata normal form. 1/462 useless extension candidates. Maximal degree in co-relation 1881. Up to 164 conditions per place. [2023-08-30 02:50:30,598 INFO L137 encePairwiseOnDemand]: 277/282 looper letters, 38 selfloop transitions, 4 changer transitions 37/83 dead transitions. [2023-08-30 02:50:30,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 83 transitions, 626 flow [2023-08-30 02:50:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:50:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:50:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 777 transitions. [2023-08-30 02:50:30,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4592198581560284 [2023-08-30 02:50:30,601 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 777 transitions. [2023-08-30 02:50:30,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 777 transitions. [2023-08-30 02:50:30,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:30,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 777 transitions. [2023-08-30 02:50:30,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:30,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:30,604 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:30,604 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 251 flow. Second operand 6 states and 777 transitions. [2023-08-30 02:50:30,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 83 transitions, 626 flow [2023-08-30 02:50:30,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 83 transitions, 616 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 02:50:30,607 INFO L231 Difference]: Finished difference. Result has 67 places, 40 transitions, 228 flow [2023-08-30 02:50:30,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=67, PETRI_TRANSITIONS=40} [2023-08-30 02:50:30,608 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-08-30 02:50:30,608 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 40 transitions, 228 flow [2023-08-30 02:50:30,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:30,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:30,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:30,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:50:30,609 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:30,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1373984201, now seen corresponding path program 4 times [2023-08-30 02:50:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:30,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18136793] [2023-08-30 02:50:30,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:30,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:50:30,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:50:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:50:30,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:50:30,741 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:50:30,742 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:50:30,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:50:30,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:50:30,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:50:30,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:50:30,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:50:30,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:50:30,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:50:30,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:50:30,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:50:30,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:50:30,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:50:30,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:50:30,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:50:30,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:50:30,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:50:30,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:50:30,747 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:30,751 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:50:30,751 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:50:30,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:50:30 BasicIcfg [2023-08-30 02:50:30,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:50:30,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:50:30,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:50:30,805 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:50:30,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:11" (3/4) ... [2023-08-30 02:50:30,807 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:50:30,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:50:30,807 INFO L158 Benchmark]: Toolchain (without parser) took 19991.64ms. Allocated memory was 69.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 39.8MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-08-30 02:50:30,808 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 52.4MB. Free memory is still 30.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:50:30,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.43ms. Allocated memory is still 69.2MB. Free memory was 39.4MB in the beginning and 33.7MB in the end (delta: 5.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2023-08-30 02:50:30,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.44ms. Allocated memory is still 69.2MB. Free memory was 33.7MB in the beginning and 31.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:50:30,808 INFO L158 Benchmark]: Boogie Preprocessor took 49.61ms. Allocated memory is still 69.2MB. Free memory was 31.3MB in the beginning and 29.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:50:30,809 INFO L158 Benchmark]: RCFGBuilder took 538.78ms. Allocated memory is still 69.2MB. Free memory was 29.2MB in the beginning and 33.9MB in the end (delta: -4.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2023-08-30 02:50:30,809 INFO L158 Benchmark]: TraceAbstraction took 18907.22ms. Allocated memory was 69.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 33.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-08-30 02:50:30,809 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 2.3GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:50:30,810 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 52.4MB. Free memory is still 30.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.43ms. Allocated memory is still 69.2MB. Free memory was 39.4MB in the beginning and 33.7MB in the end (delta: 5.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.44ms. Allocated memory is still 69.2MB. Free memory was 33.7MB in the beginning and 31.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.61ms. Allocated memory is still 69.2MB. Free memory was 31.3MB in the beginning and 29.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 538.78ms. Allocated memory is still 69.2MB. Free memory was 29.2MB in the beginning and 33.9MB in the end (delta: -4.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18907.22ms. Allocated memory was 69.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 33.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 2.3GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 148 PlacesBefore, 51 PlacesAfterwards, 137 TransitionsBefore, 39 TransitionsAfterwards, 3172 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 141 TotalNumberOfCompositions, 8505 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3603, independent: 3390, independent conditional: 0, independent unconditional: 3390, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1644, independent: 1608, independent conditional: 0, independent unconditional: 1608, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3603, independent: 1782, independent conditional: 0, independent unconditional: 1782, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 1644, unknown conditional: 0, unknown unconditional: 1644] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t693, ((void *)0), P0, ((void *)0))=-3, t693={5:0}, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t694, ((void *)0), P1, ((void *)0))=-2, t693={5:0}, t694={6:0}, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t695, ((void *)0), P2, ((void *)0))=-1, t693={5:0}, t694={6:0}, t695={7:0}, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=0, z=0] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t696, ((void *)0), P3, ((void *)0))=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L811] 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) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 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 [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 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 [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 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=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: 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 9 procedures, 176 locations, 16 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: 18.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 833 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 714 mSDsluCounter, 253 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2229 IncrementalHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 48 mSDtfsCounter, 2229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=686occurred in iteration=10, InterpolantAutomatonStates: 82, 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.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 2167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:50:30,832 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/mix026_pso.opt_rmo.opt.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 a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 --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 02:50:32,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:50:32,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:50:32,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:50:32,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:50:32,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:50:32,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:50:32,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:50:32,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:50:32,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:50:32,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:50:32,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:50:32,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:50:32,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:50:32,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:50:32,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:50:32,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:50:32,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:50:32,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:50:32,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:50:32,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:50:32,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:50:32,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:50:32,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:50:32,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:50:32,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:50:32,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:50:32,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:50:32,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:50:32,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:50:32,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:50:32,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:50:32,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:50:32,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:50:32,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:50:32,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:50:32,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:50:32,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:50:32,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:50:32,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:50:32,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:50:32,722 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:50:32,746 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:50:32,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:50:32,747 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:50:32,748 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:50:32,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:50:32,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:50:32,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:50:32,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:50:32,749 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:50:32,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:50:32,750 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:50:32,750 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:50:32,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:50:32,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:50:32,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:50:32,751 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:50:32,751 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:50:32,751 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:50:32,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:50:32,751 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:50:32,751 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:50:32,751 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:50:32,752 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:50:32,752 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:50:32,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:50:32,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:50:32,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:50:32,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:50:32,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:50:32,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:50:32,753 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:50:32,753 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:50:32,753 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:50:32,753 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:50:32,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:50:32,754 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:50:32,754 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:50:32,754 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 -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 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 02:50:33,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:50:33,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:50:33,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:50:33,022 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:50:33,022 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:50:33,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-08-30 02:50:34,052 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:50:34,290 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:50:34,292 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-08-30 02:50:34,305 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d70710b/915a575df9c049ee9805fcf4f4e5d08e/FLAG981415e71 [2023-08-30 02:50:34,317 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d70710b/915a575df9c049ee9805fcf4f4e5d08e [2023-08-30 02:50:34,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:50:34,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:50:34,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:50:34,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:50:34,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:50:34,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:50:34" (1/1) ... [2023-08-30 02:50:34,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d47c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34, skipping insertion in model container [2023-08-30 02:50:34,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:50:34" (1/1) ... [2023-08-30 02:50:34,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:50:34,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:50:34,510 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/mix026_pso.opt_rmo.opt.i[956,969] [2023-08-30 02:50:34,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:50:34,648 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:50:34,656 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/mix026_pso.opt_rmo.opt.i[956,969] [2023-08-30 02:50:34,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:50:34,707 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:50:34,707 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:50:34,712 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:50:34,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34 WrapperNode [2023-08-30 02:50:34,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:50:34,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:50:34,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:50:34,713 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:50:34,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34" (1/1) ... [2023-08-30 02:50:34,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34" (1/1) ... [2023-08-30 02:50:34,771 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-30 02:50:34,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:50:34,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:50:34,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:50:34,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:50:34,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34" (1/1) ... [2023-08-30 02:50:34,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34" (1/1) ... [2023-08-30 02:50:34,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34" (1/1) ... [2023-08-30 02:50:34,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34" (1/1) ... [2023-08-30 02:50:34,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34" (1/1) ... [2023-08-30 02:50:34,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34" (1/1) ... [2023-08-30 02:50:34,798 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34" (1/1) ... [2023-08-30 02:50:34,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34" (1/1) ... [2023-08-30 02:50:34,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:50:34,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:50:34,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:50:34,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:50:34,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34" (1/1) ... [2023-08-30 02:50:34,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:50:34,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:50:34,838 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 02:50:34,850 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 02:50:34,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:50:34,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:50:34,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:50:34,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:50:34,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:50:34,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:50:34,890 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:50:34,891 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:50:34,891 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:50:34,891 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:50:34,891 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:50:34,891 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:50:34,891 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:50:34,891 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:50:34,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:50:34,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:50:34,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:50:34,893 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 02:50:35,042 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:50:35,043 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:50:35,352 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:50:35,452 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:50:35,452 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:50:35,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:35 BoogieIcfgContainer [2023-08-30 02:50:35,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:50:35,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:50:35,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:50:35,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:50:35,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:50:34" (1/3) ... [2023-08-30 02:50:35,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6175d9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:50:35, skipping insertion in model container [2023-08-30 02:50:35,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:34" (2/3) ... [2023-08-30 02:50:35,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6175d9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:50:35, skipping insertion in model container [2023-08-30 02:50:35,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:35" (3/3) ... [2023-08-30 02:50:35,461 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2023-08-30 02:50:35,471 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:50:35,472 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:50:35,472 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:50:35,524 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:50:35,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-08-30 02:50:35,616 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-30 02:50:35,616 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:35,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:50:35,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-08-30 02:50:35,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 138 transitions, 288 flow [2023-08-30 02:50:35,628 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:50:35,637 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-30 02:50:35,639 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-30 02:50:35,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 288 flow [2023-08-30 02:50:35,673 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-30 02:50:35,674 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:35,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:50:35,677 INFO L119 LiptonReduction]: Number of co-enabled transitions 3172 [2023-08-30 02:50:41,548 INFO L134 LiptonReduction]: Checked pairs total: 8457 [2023-08-30 02:50:41,548 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-08-30 02:50:41,560 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:50:41,564 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;@6487984a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:50:41,564 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:50:41,565 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:50:41,565 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:41,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:41,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:50:41,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:41,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash 594, now seen corresponding path program 1 times [2023-08-30 02:50:41,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:50:41,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611064545] [2023-08-30 02:50:41,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:41,577 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 02:50:41,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:50:41,580 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 02:50:41,584 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 02:50:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:41,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:50:41,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:50:41,677 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 02:50:41,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:50:41,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:50:41,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611064545] [2023-08-30 02:50:41,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611064545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:41,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:41,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:50:41,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941799197] [2023-08-30 02:50:41,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:41,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:50:41,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:50:41,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:50:41,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:50:41,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 284 [2023-08-30 02:50:41,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:41,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:41,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 284 [2023-08-30 02:50:41,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:42,344 INFO L130 PetriNetUnfolder]: 5049/7097 cut-off events. [2023-08-30 02:50:42,345 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2023-08-30 02:50:42,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14135 conditions, 7097 events. 5049/7097 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 37307 event pairs, 5049 based on Foata normal form. 0/6064 useless extension candidates. Maximal degree in co-relation 14123. Up to 6881 conditions per place. [2023-08-30 02:50:42,377 INFO L137 encePairwiseOnDemand]: 275/284 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-30 02:50:42,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-30 02:50:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:50:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:50:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2023-08-30 02:50:42,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158450704225352 [2023-08-30 02:50:42,387 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 293 transitions. [2023-08-30 02:50:42,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 293 transitions. [2023-08-30 02:50:42,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:42,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 293 transitions. [2023-08-30 02:50:42,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:42,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:42,400 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:42,401 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 293 transitions. [2023-08-30 02:50:42,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-30 02:50:42,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:50:42,408 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-30 02:50:42,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-30 02:50:42,412 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-30 02:50:42,412 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-30 02:50:42,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:42,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:42,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:42,420 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 02:50:42,620 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 02:50:42,620 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:42,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1038461178, now seen corresponding path program 1 times [2023-08-30 02:50:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:50:42,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841740436] [2023-08-30 02:50:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:42,622 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 02:50:42,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:50:42,624 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 02:50:42,625 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 02:50:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:42,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:50:42,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:50:42,721 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 02:50:42,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:50:42,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:50:42,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841740436] [2023-08-30 02:50:42,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841740436] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:42,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:42,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:50:42,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340015234] [2023-08-30 02:50:42,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:42,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:50:42,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:50:42,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:50:42,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:50:42,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 284 [2023-08-30 02:50:42,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:42,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:42,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 284 [2023-08-30 02:50:42,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:43,163 INFO L130 PetriNetUnfolder]: 3975/5855 cut-off events. [2023-08-30 02:50:43,163 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:43,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11432 conditions, 5855 events. 3975/5855 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 33639 event pairs, 753 based on Foata normal form. 0/5422 useless extension candidates. Maximal degree in co-relation 11429. Up to 4303 conditions per place. [2023-08-30 02:50:43,195 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-08-30 02:50:43,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 182 flow [2023-08-30 02:50:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:50:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:50:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-30 02:50:43,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 02:50:43,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-30 02:50:43,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-30 02:50:43,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:43,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-30 02:50:43,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:43,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:43,202 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:43,202 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 426 transitions. [2023-08-30 02:50:43,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 182 flow [2023-08-30 02:50:43,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:50:43,203 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-30 02:50:43,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-30 02:50:43,203 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-30 02:50:43,204 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-30 02:50:43,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:43,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:43,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:43,215 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 02:50:43,416 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 02:50:43,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:43,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash 351151153, now seen corresponding path program 1 times [2023-08-30 02:50:43,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:50:43,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942299081] [2023-08-30 02:50:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:43,418 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 02:50:43,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:50:43,424 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 02:50:43,426 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 02:50:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:43,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:50:43,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:50:43,563 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 02:50:43,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:50:43,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:50:43,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942299081] [2023-08-30 02:50:43,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942299081] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:43,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:43,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:50:43,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264611315] [2023-08-30 02:50:43,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:43,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:50:43,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:50:43,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:50:43,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:50:43,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 284 [2023-08-30 02:50:43,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 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 02:50:43,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:43,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 284 [2023-08-30 02:50:43,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:44,057 INFO L130 PetriNetUnfolder]: 2757/4007 cut-off events. [2023-08-30 02:50:44,057 INFO L131 PetriNetUnfolder]: For 264/264 co-relation queries the response was YES. [2023-08-30 02:50:44,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8368 conditions, 4007 events. 2757/4007 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 20721 event pairs, 542 based on Foata normal form. 192/4037 useless extension candidates. Maximal degree in co-relation 8364. Up to 3074 conditions per place. [2023-08-30 02:50:44,075 INFO L137 encePairwiseOnDemand]: 277/284 looper letters, 36 selfloop transitions, 5 changer transitions 23/68 dead transitions. [2023-08-30 02:50:44,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 288 flow [2023-08-30 02:50:44,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:50:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:50:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 681 transitions. [2023-08-30 02:50:44,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4795774647887324 [2023-08-30 02:50:44,077 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 681 transitions. [2023-08-30 02:50:44,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 681 transitions. [2023-08-30 02:50:44,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:44,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 681 transitions. [2023-08-30 02:50:44,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:44,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:44,082 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:44,083 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 681 transitions. [2023-08-30 02:50:44,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 288 flow [2023-08-30 02:50:44,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:50:44,085 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 109 flow [2023-08-30 02:50:44,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-30 02:50:44,086 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-08-30 02:50:44,086 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 109 flow [2023-08-30 02:50:44,087 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 02:50:44,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:44,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:44,113 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 02:50:44,297 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 02:50:44,297 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:44,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1245405239, now seen corresponding path program 1 times [2023-08-30 02:50:44,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:50:44,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739359730] [2023-08-30 02:50:44,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:44,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:50:44,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:50:44,311 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 02:50:44,314 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 02:50:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:44,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:50:44,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:50:44,439 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 02:50:44,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:50:44,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:50:44,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739359730] [2023-08-30 02:50:44,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739359730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:44,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:44,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:50:44,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950432694] [2023-08-30 02:50:44,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:44,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:50:44,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:50:44,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:50:44,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:50:44,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 284 [2023-08-30 02:50:44,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:44,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:44,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 284 [2023-08-30 02:50:44,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:44,800 INFO L130 PetriNetUnfolder]: 1407/2198 cut-off events. [2023-08-30 02:50:44,800 INFO L131 PetriNetUnfolder]: For 884/884 co-relation queries the response was YES. [2023-08-30 02:50:44,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5967 conditions, 2198 events. 1407/2198 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11031 event pairs, 231 based on Foata normal form. 138/2265 useless extension candidates. Maximal degree in co-relation 5960. Up to 1054 conditions per place. [2023-08-30 02:50:44,807 INFO L137 encePairwiseOnDemand]: 277/284 looper letters, 47 selfloop transitions, 9 changer transitions 23/83 dead transitions. [2023-08-30 02:50:44,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 429 flow [2023-08-30 02:50:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:50:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:50:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 819 transitions. [2023-08-30 02:50:44,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48063380281690143 [2023-08-30 02:50:44,810 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 819 transitions. [2023-08-30 02:50:44,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 819 transitions. [2023-08-30 02:50:44,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:44,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 819 transitions. [2023-08-30 02:50:44,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:44,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:44,814 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:44,814 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 109 flow. Second operand 6 states and 819 transitions. [2023-08-30 02:50:44,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 429 flow [2023-08-30 02:50:44,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:50:44,819 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 174 flow [2023-08-30 02:50:44,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-08-30 02:50:44,819 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-30 02:50:44,820 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 174 flow [2023-08-30 02:50:44,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:44,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:44,820 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 02:50:44,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:50:45,029 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 02:50:45,029 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:45,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:45,030 INFO L85 PathProgramCache]: Analyzing trace with hash 28915234, now seen corresponding path program 1 times [2023-08-30 02:50:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:50:45,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035494974] [2023-08-30 02:50:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:45,030 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 02:50:45,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:50:45,031 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 02:50:45,032 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 02:50:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:45,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:50:45,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:50:45,149 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 02:50:45,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:50:45,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:50:45,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035494974] [2023-08-30 02:50:45,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035494974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:45,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:45,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:50:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529847635] [2023-08-30 02:50:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:45,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:50:45,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:50:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:50:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:50:45,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 284 [2023-08-30 02:50:45,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:45,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:45,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 284 [2023-08-30 02:50:45,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:45,452 INFO L130 PetriNetUnfolder]: 759/1244 cut-off events. [2023-08-30 02:50:45,452 INFO L131 PetriNetUnfolder]: For 1297/1297 co-relation queries the response was YES. [2023-08-30 02:50:45,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3902 conditions, 1244 events. 759/1244 cut-off events. For 1297/1297 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5714 event pairs, 169 based on Foata normal form. 57/1275 useless extension candidates. Maximal degree in co-relation 3893. Up to 419 conditions per place. [2023-08-30 02:50:45,457 INFO L137 encePairwiseOnDemand]: 277/284 looper letters, 56 selfloop transitions, 13 changer transitions 23/96 dead transitions. [2023-08-30 02:50:45,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 590 flow [2023-08-30 02:50:45,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:50:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:50:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 955 transitions. [2023-08-30 02:50:45,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48038229376257546 [2023-08-30 02:50:45,459 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 955 transitions. [2023-08-30 02:50:45,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 955 transitions. [2023-08-30 02:50:45,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:45,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 955 transitions. [2023-08-30 02:50:45,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.42857142857142) internal successors, (955), 7 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:45,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:45,464 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:45,464 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 174 flow. Second operand 7 states and 955 transitions. [2023-08-30 02:50:45,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 590 flow [2023-08-30 02:50:45,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 96 transitions, 528 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-30 02:50:45,473 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 224 flow [2023-08-30 02:50:45,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-30 02:50:45,474 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-08-30 02:50:45,474 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 224 flow [2023-08-30 02:50:45,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:45,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:45,475 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 02:50:45,484 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 02:50:45,682 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 02:50:45,682 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:45,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:45,682 INFO L85 PathProgramCache]: Analyzing trace with hash 750601709, now seen corresponding path program 1 times [2023-08-30 02:50:45,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:50:45,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939261039] [2023-08-30 02:50:45,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:45,683 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 02:50:45,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:50:45,684 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 02:50:45,686 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 02:50:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:45,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:50:45,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:50:45,840 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 02:50:45,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:50:45,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:50:45,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939261039] [2023-08-30 02:50:45,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939261039] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:45,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:45,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:50:45,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799177486] [2023-08-30 02:50:45,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:45,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:50:45,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:50:45,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:50:45,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:50:45,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 284 [2023-08-30 02:50:45,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:45,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:45,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 284 [2023-08-30 02:50:45,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:46,212 INFO L130 PetriNetUnfolder]: 625/1010 cut-off events. [2023-08-30 02:50:46,212 INFO L131 PetriNetUnfolder]: For 1004/1004 co-relation queries the response was YES. [2023-08-30 02:50:46,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3042 conditions, 1010 events. 625/1010 cut-off events. For 1004/1004 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4449 event pairs, 164 based on Foata normal form. 12/1007 useless extension candidates. Maximal degree in co-relation 3032. Up to 400 conditions per place. [2023-08-30 02:50:46,216 INFO L137 encePairwiseOnDemand]: 277/284 looper letters, 52 selfloop transitions, 17 changer transitions 12/85 dead transitions. [2023-08-30 02:50:46,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 534 flow [2023-08-30 02:50:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:50:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:50:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1067 transitions. [2023-08-30 02:50:46,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46963028169014087 [2023-08-30 02:50:46,219 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1067 transitions. [2023-08-30 02:50:46,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1067 transitions. [2023-08-30 02:50:46,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:46,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1067 transitions. [2023-08-30 02:50:46,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.375) internal successors, (1067), 8 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:46,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 284.0) internal successors, (2556), 9 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:46,223 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 284.0) internal successors, (2556), 9 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:46,223 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 224 flow. Second operand 8 states and 1067 transitions. [2023-08-30 02:50:46,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 534 flow [2023-08-30 02:50:46,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 472 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-30 02:50:46,239 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 218 flow [2023-08-30 02:50:46,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-30 02:50:46,240 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-30 02:50:46,241 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 218 flow [2023-08-30 02:50:46,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:46,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:46,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:46,251 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 02:50:46,448 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 02:50:46,449 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:46,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:46,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1016984109, now seen corresponding path program 1 times [2023-08-30 02:50:46,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:50:46,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505099733] [2023-08-30 02:50:46,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:46,450 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 02:50:46,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:50:46,451 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 02:50:46,453 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 02:50:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:46,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:50:46,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:50:46,575 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 02:50:46,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:50:46,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:50:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505099733] [2023-08-30 02:50:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505099733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:46,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:46,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:50:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141802667] [2023-08-30 02:50:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:46,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:50:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:50:46,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:50:46,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:50:46,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 284 [2023-08-30 02:50:46,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:46,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:46,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 284 [2023-08-30 02:50:46,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:46,754 INFO L130 PetriNetUnfolder]: 879/1480 cut-off events. [2023-08-30 02:50:46,754 INFO L131 PetriNetUnfolder]: For 2029/2029 co-relation queries the response was YES. [2023-08-30 02:50:46,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4357 conditions, 1480 events. 879/1480 cut-off events. For 2029/2029 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7558 event pairs, 145 based on Foata normal form. 0/1475 useless extension candidates. Maximal degree in co-relation 4346. Up to 777 conditions per place. [2023-08-30 02:50:46,760 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 82 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-30 02:50:46,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 87 transitions, 663 flow [2023-08-30 02:50:46,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:50:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:50:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2023-08-30 02:50:46,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.488556338028169 [2023-08-30 02:50:46,762 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2023-08-30 02:50:46,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2023-08-30 02:50:46,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:46,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2023-08-30 02:50:46,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:46,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:46,777 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:46,777 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 218 flow. Second operand 4 states and 555 transitions. [2023-08-30 02:50:46,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 87 transitions, 663 flow [2023-08-30 02:50:46,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 522 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-30 02:50:46,787 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 167 flow [2023-08-30 02:50:46,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-30 02:50:46,788 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-08-30 02:50:46,788 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 167 flow [2023-08-30 02:50:46,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:46,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:46,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:46,796 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 02:50:46,989 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 02:50:46,989 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:46,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:46,989 INFO L85 PathProgramCache]: Analyzing trace with hash 423413173, now seen corresponding path program 2 times [2023-08-30 02:50:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:50:46,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932897589] [2023-08-30 02:50:46,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:50:46,990 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 02:50:46,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:50:46,991 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 02:50:46,993 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 02:50:47,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:50:47,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:50:47,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:50:47,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:50:47,112 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 02:50:47,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:50:47,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:50:47,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932897589] [2023-08-30 02:50:47,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932897589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:47,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:47,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:50:47,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962284030] [2023-08-30 02:50:47,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:47,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:50:47,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:50:47,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:50:47,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:50:47,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 284 [2023-08-30 02:50:47,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:47,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:47,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 284 [2023-08-30 02:50:47,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:47,385 INFO L130 PetriNetUnfolder]: 1515/2361 cut-off events. [2023-08-30 02:50:47,385 INFO L131 PetriNetUnfolder]: For 1861/1861 co-relation queries the response was YES. [2023-08-30 02:50:47,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6735 conditions, 2361 events. 1515/2361 cut-off events. For 1861/1861 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12472 event pairs, 164 based on Foata normal form. 1/2328 useless extension candidates. Maximal degree in co-relation 6725. Up to 1266 conditions per place. [2023-08-30 02:50:47,395 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 83 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2023-08-30 02:50:47,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 89 transitions, 544 flow [2023-08-30 02:50:47,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:50:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:50:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-30 02:50:47,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894366197183099 [2023-08-30 02:50:47,397 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-30 02:50:47,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-30 02:50:47,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:47,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-30 02:50:47,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:47,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:47,400 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:47,400 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 167 flow. Second operand 4 states and 556 transitions. [2023-08-30 02:50:47,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 89 transitions, 544 flow [2023-08-30 02:50:47,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:50:47,416 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 179 flow [2023-08-30 02:50:47,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-30 02:50:47,417 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-30 02:50:47,417 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 179 flow [2023-08-30 02:50:47,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:47,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:47,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:47,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:50:47,625 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 02:50:47,626 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:47,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1428479267, now seen corresponding path program 3 times [2023-08-30 02:50:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:50:47,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759578838] [2023-08-30 02:50:47,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:50:47,627 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 02:50:47,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:50:47,630 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 02:50:47,632 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 02:50:47,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:50:47,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:50:47,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 02:50:47,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:50:47,994 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 02:50:47,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:50:47,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:50:47,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759578838] [2023-08-30 02:50:47,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759578838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:47,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:47,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:50:47,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296023607] [2023-08-30 02:50:47,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:47,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:50:47,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:50:47,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:50:47,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:50:48,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 284 [2023-08-30 02:50:48,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:48,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:48,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 284 [2023-08-30 02:50:48,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:48,405 INFO L130 PetriNetUnfolder]: 1441/2410 cut-off events. [2023-08-30 02:50:48,405 INFO L131 PetriNetUnfolder]: For 2403/2404 co-relation queries the response was YES. [2023-08-30 02:50:48,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7267 conditions, 2410 events. 1441/2410 cut-off events. For 2403/2404 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13513 event pairs, 190 based on Foata normal form. 1/2356 useless extension candidates. Maximal degree in co-relation 7255. Up to 872 conditions per place. [2023-08-30 02:50:48,415 INFO L137 encePairwiseOnDemand]: 278/284 looper letters, 87 selfloop transitions, 6 changer transitions 0/99 dead transitions. [2023-08-30 02:50:48,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 99 transitions, 633 flow [2023-08-30 02:50:48,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:50:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:50:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 919 transitions. [2023-08-30 02:50:48,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46227364185110664 [2023-08-30 02:50:48,418 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 919 transitions. [2023-08-30 02:50:48,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 919 transitions. [2023-08-30 02:50:48,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:48,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 919 transitions. [2023-08-30 02:50:48,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:48,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:48,421 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:48,421 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 179 flow. Second operand 7 states and 919 transitions. [2023-08-30 02:50:48,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 99 transitions, 633 flow [2023-08-30 02:50:48,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 99 transitions, 630 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:50:48,438 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 202 flow [2023-08-30 02:50:48,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2023-08-30 02:50:48,438 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-30 02:50:48,439 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 202 flow [2023-08-30 02:50:48,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:48,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:48,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:48,447 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 (10)] Ended with exit code 0 [2023-08-30 02:50:48,647 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 02:50:48,647 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:48,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1899197229, now seen corresponding path program 4 times [2023-08-30 02:50:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:50:48,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481929107] [2023-08-30 02:50:48,648 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:50:48,648 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 02:50:48,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:50:48,649 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 02:50:48,652 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 02:50:48,740 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:50:48,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:50:48,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:50:48,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:50:48,754 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 02:50:48,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:50:48,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:50:48,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481929107] [2023-08-30 02:50:48,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481929107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:48,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:48,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:50:48,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153770705] [2023-08-30 02:50:48,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:48,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:50:48,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:50:48,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:50:48,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:50:48,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 284 [2023-08-30 02:50:48,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:48,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:48,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 284 [2023-08-30 02:50:48,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:49,048 INFO L130 PetriNetUnfolder]: 2398/4029 cut-off events. [2023-08-30 02:50:49,048 INFO L131 PetriNetUnfolder]: For 4693/4694 co-relation queries the response was YES. [2023-08-30 02:50:49,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13130 conditions, 4029 events. 2398/4029 cut-off events. For 4693/4694 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 25288 event pairs, 773 based on Foata normal form. 1/3918 useless extension candidates. Maximal degree in co-relation 13116. Up to 2035 conditions per place. [2023-08-30 02:50:49,065 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 67 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-08-30 02:50:49,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 484 flow [2023-08-30 02:50:49,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:50:49,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:50:49,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-30 02:50:49,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49295774647887325 [2023-08-30 02:50:49,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-30 02:50:49,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-30 02:50:49,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:49,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-30 02:50:49,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:49,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:49,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:49,070 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 202 flow. Second operand 3 states and 420 transitions. [2023-08-30 02:50:49,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 484 flow [2023-08-30 02:50:49,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 476 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:50:49,116 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 208 flow [2023-08-30 02:50:49,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-08-30 02:50:49,116 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-30 02:50:49,117 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 208 flow [2023-08-30 02:50:49,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:49,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:49,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:49,125 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 02:50:49,324 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 02:50:49,325 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:49,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:49,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1831594645, now seen corresponding path program 5 times [2023-08-30 02:50:49,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:50:49,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154180457] [2023-08-30 02:50:49,326 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 02:50:49,326 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 02:50:49,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:50:49,327 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 02:50:49,329 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 02:50:49,432 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:50:49,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:50:49,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:50:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:50:49,568 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:50:49,569 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:50:49,569 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:50:49,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:50:49,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:50:49,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:50:49,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:50:49,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:50:49,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:50:49,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:50:49,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:50:49,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:50:49,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:50:49,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:50:49,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:50:49,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:50:49,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:50:49,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:50:49,614 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 (12)] Ended with exit code 0 [2023-08-30 02:50:49,801 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 02:50:49,801 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:49,805 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:50:49,805 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:50:49,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:50:49 BasicIcfg [2023-08-30 02:50:49,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:50:49,881 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:50:49,881 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:50:49,881 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:50:49,881 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:35" (3/4) ... [2023-08-30 02:50:49,883 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:50:49,883 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:50:49,884 INFO L158 Benchmark]: Toolchain (without parser) took 15563.80ms. Allocated memory was 73.4MB in the beginning and 679.5MB in the end (delta: 606.1MB). Free memory was 50.0MB in the beginning and 317.5MB in the end (delta: -267.5MB). Peak memory consumption was 340.2MB. Max. memory is 16.1GB. [2023-08-30 02:50:49,884 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.4MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:50:49,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.95ms. Allocated memory is still 73.4MB. Free memory was 49.8MB in the beginning and 42.5MB in the end (delta: 7.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-08-30 02:50:49,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.73ms. Allocated memory is still 73.4MB. Free memory was 42.5MB in the beginning and 39.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:50:49,885 INFO L158 Benchmark]: Boogie Preprocessor took 40.49ms. Allocated memory is still 73.4MB. Free memory was 39.9MB in the beginning and 37.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:50:49,885 INFO L158 Benchmark]: RCFGBuilder took 639.02ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 37.8MB in the beginning and 53.3MB in the end (delta: -15.5MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2023-08-30 02:50:49,885 INFO L158 Benchmark]: TraceAbstraction took 14424.64ms. Allocated memory was 88.1MB in the beginning and 679.5MB in the end (delta: 591.4MB). Free memory was 52.7MB in the beginning and 318.5MB in the end (delta: -265.8MB). Peak memory consumption was 325.1MB. Max. memory is 16.1GB. [2023-08-30 02:50:49,885 INFO L158 Benchmark]: Witness Printer took 2.35ms. Allocated memory is still 679.5MB. Free memory was 318.5MB in the beginning and 317.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:50:49,886 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 56.6MB. Free memory was 34.4MB in the beginning and 34.4MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.95ms. Allocated memory is still 73.4MB. Free memory was 49.8MB in the beginning and 42.5MB in the end (delta: 7.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.73ms. Allocated memory is still 73.4MB. Free memory was 42.5MB in the beginning and 39.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.49ms. Allocated memory is still 73.4MB. Free memory was 39.9MB in the beginning and 37.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 639.02ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 37.8MB in the beginning and 53.3MB in the end (delta: -15.5MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14424.64ms. Allocated memory was 88.1MB in the beginning and 679.5MB in the end (delta: 591.4MB). Free memory was 52.7MB in the beginning and 318.5MB in the end (delta: -265.8MB). Peak memory consumption was 325.1MB. Max. memory is 16.1GB. * Witness Printer took 2.35ms. Allocated memory is still 679.5MB. Free memory was 318.5MB in the beginning and 317.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 149 PlacesBefore, 51 PlacesAfterwards, 138 TransitionsBefore, 39 TransitionsAfterwards, 3172 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 8457 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3772, independent: 3562, independent conditional: 0, independent unconditional: 3562, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1683, independent: 1648, independent conditional: 0, independent unconditional: 1648, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3772, independent: 1914, independent conditional: 0, independent unconditional: 1914, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 1683, unknown conditional: 0, unknown unconditional: 1683] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 175, Positive conditional cache size: 0, Positive unconditional cache size: 175, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t693, ((void *)0), P0, ((void *)0))=0, t693={11:0}, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t694, ((void *)0), P1, ((void *)0))=1, t693={11:0}, t694={15:0}, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t695, ((void *)0), P2, ((void *)0))=2, t693={11:0}, t694={15:0}, t695={7:0}, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=0, z=0] [L862] 0 pthread_t t696; [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t696, ((void *)0), P3, ((void *)0))=3, t693={11:0}, t694={15:0}, t695={7:0}, t696={-2147483637:0}, weak$$choice0=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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$$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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L811] 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) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 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 [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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$$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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 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 [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 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=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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, t693={11:0}, t694={15:0}, t695={7:0}, t696={-2147483637: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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: 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 9 procedures, 177 locations, 16 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: 14.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 404 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1696 IncrementalHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 17 mSDtfsCounter, 1696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=5, InterpolantAutomatonStates: 49, 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.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 651 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1475 ConjunctsInSsa, 63 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 02:50:49,904 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