./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:16:42,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:16:42,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:16:42,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:16:42,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:16:42,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:16:42,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:16:42,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:16:42,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:16:42,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:16:42,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:16:42,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:16:42,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:16:42,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:16:42,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:16:42,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:16:42,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:16:42,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:16:42,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:16:42,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:16:42,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:16:42,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:16:42,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:16:42,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:16:42,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:16:42,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:16:42,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:16:42,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:16:42,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:16:42,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:16:42,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:16:42,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:16:42,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:16:42,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:16:42,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:16:42,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:16:42,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:16:42,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:16:42,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:16:42,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:16:42,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:16:42,497 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:16:42,525 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:16:42,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:16:42,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:16:42,527 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:16:42,527 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:16:42,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:16:42,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:16:42,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:16:42,529 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:16:42,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:16:42,530 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:16:42,530 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:16:42,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:16:42,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:16:42,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:16:42,531 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:16:42,531 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:16:42,531 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:16:42,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:16:42,531 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:16:42,532 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:16:42,532 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:16:42,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:16:42,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:16:42,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:16:42,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:16:42,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:16:42,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:16:42,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:16:42,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:16:42,533 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:16:42,534 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:16:42,534 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:16:42,534 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:16:42,534 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 -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:16:42,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:16:42,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:16:42,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:16:42,856 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:16:42,856 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:16:42,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-29 20:16:43,922 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:16:44,137 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:16:44,137 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-29 20:16:44,148 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/006025cfb/17727014d72d4ac79597054c28a16f2f/FLAG41faed2af [2023-08-29 20:16:44,165 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/006025cfb/17727014d72d4ac79597054c28a16f2f [2023-08-29 20:16:44,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:16:44,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:16:44,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:16:44,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:16:44,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:16:44,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:16:44" (1/1) ... [2023-08-29 20:16:44,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43eff25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44, skipping insertion in model container [2023-08-29 20:16:44,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:16:44" (1/1) ... [2023-08-29 20:16:44,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:16:44,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:16:44,396 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-08-29 20:16:44,609 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:16:44,618 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:16:44,651 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-08-29 20:16:44,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:16:44,726 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:16:44,727 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:16:44,732 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:16:44,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44 WrapperNode [2023-08-29 20:16:44,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:16:44,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:16:44,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:16:44,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:16:44,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44" (1/1) ... [2023-08-29 20:16:44,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44" (1/1) ... [2023-08-29 20:16:44,785 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2023-08-29 20:16:44,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:16:44,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:16:44,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:16:44,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:16:44,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44" (1/1) ... [2023-08-29 20:16:44,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44" (1/1) ... [2023-08-29 20:16:44,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44" (1/1) ... [2023-08-29 20:16:44,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44" (1/1) ... [2023-08-29 20:16:44,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44" (1/1) ... [2023-08-29 20:16:44,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44" (1/1) ... [2023-08-29 20:16:44,817 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44" (1/1) ... [2023-08-29 20:16:44,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44" (1/1) ... [2023-08-29 20:16:44,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:16:44,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:16:44,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:16:44,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:16:44,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44" (1/1) ... [2023-08-29 20:16:44,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:16:44,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:16:44,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:16:44,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:16:44,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:16:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:16:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:16:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:16:44,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:16:44,914 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:16:44,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:16:44,914 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:16:44,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:16:44,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:16:44,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:16:44,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:16:44,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:16:44,916 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:16:45,063 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:16:45,065 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:16:45,405 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:16:45,537 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:16:45,537 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:16:45,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:45 BoogieIcfgContainer [2023-08-29 20:16:45,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:16:45,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:16:45,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:16:45,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:16:45,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:16:44" (1/3) ... [2023-08-29 20:16:45,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772278e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:16:45, skipping insertion in model container [2023-08-29 20:16:45,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:44" (2/3) ... [2023-08-29 20:16:45,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772278e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:16:45, skipping insertion in model container [2023-08-29 20:16:45,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:45" (3/3) ... [2023-08-29 20:16:45,548 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-29 20:16:45,563 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:16:45,564 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:16:45,564 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:16:45,608 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:16:45,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2023-08-29 20:16:45,694 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2023-08-29 20:16:45,694 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:16:45,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-29 20:16:45,698 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow [2023-08-29 20:16:45,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow [2023-08-29 20:16:45,706 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:16:45,717 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 96 transitions, 198 flow [2023-08-29 20:16:45,720 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 96 transitions, 198 flow [2023-08-29 20:16:45,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 198 flow [2023-08-29 20:16:45,753 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2023-08-29 20:16:45,753 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:16:45,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-29 20:16:45,755 INFO L119 LiptonReduction]: Number of co-enabled transitions 1232 [2023-08-29 20:16:48,979 INFO L134 LiptonReduction]: Checked pairs total: 3577 [2023-08-29 20:16:48,980 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-29 20:16:48,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:16:48,995 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;@47e2e49c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:16:48,995 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:16:48,996 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:16:48,996 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:16:48,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:48,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:16:48,997 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:49,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:49,001 INFO L85 PathProgramCache]: Analyzing trace with hash 445, now seen corresponding path program 1 times [2023-08-29 20:16:49,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:16:49,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409923132] [2023-08-29 20:16:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:49,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:16:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:49,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-29 20:16:49,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:16:49,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409923132] [2023-08-29 20:16:49,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409923132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:49,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:49,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:16:49,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489995255] [2023-08-29 20:16:49,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:49,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:16:49,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:16:49,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:16:49,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:16:49,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 195 [2023-08-29 20:16:49,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:49,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:49,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 195 [2023-08-29 20:16:49,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:49,283 INFO L130 PetriNetUnfolder]: 264/459 cut-off events. [2023-08-29 20:16:49,284 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 20:16:49,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 459 events. 264/459 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1901 event pairs, 264 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 915. Up to 451 conditions per place. [2023-08-29 20:16:49,290 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-08-29 20:16:49,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2023-08-29 20:16:49,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:16:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:16:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2023-08-29 20:16:49,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051282051282051 [2023-08-29 20:16:49,305 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2023-08-29 20:16:49,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2023-08-29 20:16:49,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:49,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2023-08-29 20:16:49,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:49,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:49,319 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:49,321 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 197 transitions. [2023-08-29 20:16:49,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2023-08-29 20:16:49,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:16:49,324 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-08-29 20:16:49,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-08-29 20:16:49,329 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-29 20:16:49,329 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-08-29 20:16:49,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:49,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:49,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:16:49,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:16:49,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:49,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:49,339 INFO L85 PathProgramCache]: Analyzing trace with hash 438757, now seen corresponding path program 1 times [2023-08-29 20:16:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:16:49,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190074893] [2023-08-29 20:16:49,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:16:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:16:49,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:16:49,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190074893] [2023-08-29 20:16:49,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190074893] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:49,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:49,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:16:49,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146405910] [2023-08-29 20:16:49,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:49,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:16:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:16:49,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:16:49,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:16:49,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 195 [2023-08-29 20:16:49,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:49,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:49,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 195 [2023-08-29 20:16:49,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:49,709 INFO L130 PetriNetUnfolder]: 204/392 cut-off events. [2023-08-29 20:16:49,709 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:16:49,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 392 events. 204/392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1822 event pairs, 24 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 755. Up to 292 conditions per place. [2023-08-29 20:16:49,712 INFO L137 encePairwiseOnDemand]: 192/195 looper letters, 25 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2023-08-29 20:16:49,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 126 flow [2023-08-29 20:16:49,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:16:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:16:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-08-29 20:16:49,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2023-08-29 20:16:49,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-08-29 20:16:49,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-08-29 20:16:49,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:49,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-08-29 20:16:49,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:49,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:49,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:49,718 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 288 transitions. [2023-08-29 20:16:49,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 126 flow [2023-08-29 20:16:49,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:16:49,719 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-08-29 20:16:49,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-29 20:16:49,720 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-29 20:16:49,720 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-08-29 20:16:49,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:49,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:49,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:49,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:16:49,721 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:49,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1516569661, now seen corresponding path program 1 times [2023-08-29 20:16:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:16:49,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12197868] [2023-08-29 20:16:49,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:49,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:16:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:16:50,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:16:50,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12197868] [2023-08-29 20:16:50,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12197868] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:50,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:50,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:16:50,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134194395] [2023-08-29 20:16:50,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:50,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:16:50,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:16:50,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:16:50,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:16:50,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 195 [2023-08-29 20:16:50,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:50,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:50,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 195 [2023-08-29 20:16:50,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:50,107 INFO L130 PetriNetUnfolder]: 197/343 cut-off events. [2023-08-29 20:16:50,107 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-08-29 20:16:50,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 343 events. 197/343 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1270 event pairs, 61 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 732. Up to 245 conditions per place. [2023-08-29 20:16:50,111 INFO L137 encePairwiseOnDemand]: 192/195 looper letters, 22 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-08-29 20:16:50,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 108 flow [2023-08-29 20:16:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:16:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:16:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-29 20:16:50,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47863247863247865 [2023-08-29 20:16:50,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-29 20:16:50,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-29 20:16:50,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:50,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-29 20:16:50,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:50,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:50,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:50,118 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 3 states and 280 transitions. [2023-08-29 20:16:50,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 108 flow [2023-08-29 20:16:50,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:16:50,119 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 48 flow [2023-08-29 20:16:50,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-29 20:16:50,120 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-29 20:16:50,123 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 48 flow [2023-08-29 20:16:50,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:50,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:50,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:50,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:16:50,124 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:50,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash -230980413, now seen corresponding path program 1 times [2023-08-29 20:16:50,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:16:50,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756578575] [2023-08-29 20:16:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:50,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:16:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:16:50,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:16:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756578575] [2023-08-29 20:16:50,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756578575] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:50,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:50,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:16:50,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418797577] [2023-08-29 20:16:50,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:50,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:16:50,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:16:50,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:16:50,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:16:50,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 195 [2023-08-29 20:16:50,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 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-29 20:16:50,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:50,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 195 [2023-08-29 20:16:50,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:50,567 INFO L130 PetriNetUnfolder]: 191/345 cut-off events. [2023-08-29 20:16:50,568 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-29 20:16:50,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 345 events. 191/345 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1351 event pairs, 44 based on Foata normal form. 24/369 useless extension candidates. Maximal degree in co-relation 748. Up to 237 conditions per place. [2023-08-29 20:16:50,570 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 22 selfloop transitions, 3 changer transitions 9/35 dead transitions. [2023-08-29 20:16:50,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 153 flow [2023-08-29 20:16:50,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:16:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:16:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 415 transitions. [2023-08-29 20:16:50,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4256410256410256 [2023-08-29 20:16:50,573 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 415 transitions. [2023-08-29 20:16:50,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 415 transitions. [2023-08-29 20:16:50,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:50,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 415 transitions. [2023-08-29 20:16:50,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:50,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:50,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:50,577 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 48 flow. Second operand 5 states and 415 transitions. [2023-08-29 20:16:50,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 153 flow [2023-08-29 20:16:50,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:16:50,578 INFO L231 Difference]: Finished difference. Result has 31 places, 18 transitions, 56 flow [2023-08-29 20:16:50,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2023-08-29 20:16:50,579 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-29 20:16:50,579 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 56 flow [2023-08-29 20:16:50,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 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-29 20:16:50,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:50,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:50,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:16:50,580 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:50,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1427301732, now seen corresponding path program 1 times [2023-08-29 20:16:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:16:50,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301063862] [2023-08-29 20:16:50,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:50,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:16:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:50,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-29 20:16:50,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:16:50,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301063862] [2023-08-29 20:16:50,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301063862] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:50,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:50,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:16:50,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618456478] [2023-08-29 20:16:50,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:50,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:16:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:16:50,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:16:50,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:16:50,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 195 [2023-08-29 20:16:50,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:50,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:50,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 195 [2023-08-29 20:16:50,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:50,819 INFO L130 PetriNetUnfolder]: 73/164 cut-off events. [2023-08-29 20:16:50,820 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-08-29 20:16:50,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 164 events. 73/164 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 589 event pairs, 15 based on Foata normal form. 20/183 useless extension candidates. Maximal degree in co-relation 368. Up to 88 conditions per place. [2023-08-29 20:16:50,821 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 22 selfloop transitions, 3 changer transitions 15/42 dead transitions. [2023-08-29 20:16:50,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 189 flow [2023-08-29 20:16:50,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:16:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:16:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2023-08-29 20:16:50,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2023-08-29 20:16:50,823 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 442 transitions. [2023-08-29 20:16:50,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 442 transitions. [2023-08-29 20:16:50,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:50,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 442 transitions. [2023-08-29 20:16:50,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:50,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:50,827 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:50,827 INFO L175 Difference]: Start difference. First operand has 31 places, 18 transitions, 56 flow. Second operand 5 states and 442 transitions. [2023-08-29 20:16:50,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 42 transitions, 189 flow [2023-08-29 20:16:50,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 42 transitions, 179 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-29 20:16:50,828 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 75 flow [2023-08-29 20:16:50,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2023-08-29 20:16:50,829 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-08-29 20:16:50,829 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 75 flow [2023-08-29 20:16:50,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:50,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:50,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:50,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:16:50,830 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:50,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:50,831 INFO L85 PathProgramCache]: Analyzing trace with hash -869954312, now seen corresponding path program 1 times [2023-08-29 20:16:50,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:16:50,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802768714] [2023-08-29 20:16:50,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:50,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:16:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:16:51,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:16:51,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802768714] [2023-08-29 20:16:51,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802768714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:51,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:51,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:16:51,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568274241] [2023-08-29 20:16:51,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:51,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:16:51,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:16:51,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:16:51,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:16:51,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 195 [2023-08-29 20:16:51,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:51,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:51,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 195 [2023-08-29 20:16:51,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:51,197 INFO L130 PetriNetUnfolder]: 24/70 cut-off events. [2023-08-29 20:16:51,197 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-29 20:16:51,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 70 events. 24/70 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 181 event pairs, 10 based on Foata normal form. 8/77 useless extension candidates. Maximal degree in co-relation 191. Up to 29 conditions per place. [2023-08-29 20:16:51,198 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 20 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2023-08-29 20:16:51,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 184 flow [2023-08-29 20:16:51,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:16:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:16:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 515 transitions. [2023-08-29 20:16:51,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44017094017094016 [2023-08-29 20:16:51,201 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 515 transitions. [2023-08-29 20:16:51,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 515 transitions. [2023-08-29 20:16:51,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:51,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 515 transitions. [2023-08-29 20:16:51,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:51,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:51,207 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:51,208 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 75 flow. Second operand 6 states and 515 transitions. [2023-08-29 20:16:51,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 184 flow [2023-08-29 20:16:51,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 162 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-29 20:16:51,210 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 78 flow [2023-08-29 20:16:51,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-08-29 20:16:51,213 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-08-29 20:16:51,213 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 78 flow [2023-08-29 20:16:51,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:51,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:51,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:51,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:16:51,214 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:51,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash 685699148, now seen corresponding path program 1 times [2023-08-29 20:16:51,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:16:51,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980333447] [2023-08-29 20:16:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:51,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:16:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:16:51,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:16:51,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980333447] [2023-08-29 20:16:51,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980333447] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:51,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:51,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:16:51,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202749616] [2023-08-29 20:16:51,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:51,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:16:51,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:16:51,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:16:51,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:16:51,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 195 [2023-08-29 20:16:51,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 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-29 20:16:51,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:51,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 195 [2023-08-29 20:16:51,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:51,931 INFO L130 PetriNetUnfolder]: 19/71 cut-off events. [2023-08-29 20:16:51,931 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-08-29 20:16:51,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 71 events. 19/71 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 183 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 192. Up to 25 conditions per place. [2023-08-29 20:16:51,931 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 33 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2023-08-29 20:16:51,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 242 flow [2023-08-29 20:16:51,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:16:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:16:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 603 transitions. [2023-08-29 20:16:51,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44175824175824174 [2023-08-29 20:16:51,934 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 603 transitions. [2023-08-29 20:16:51,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 603 transitions. [2023-08-29 20:16:51,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:51,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 603 transitions. [2023-08-29 20:16:51,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.14285714285714) internal successors, (603), 7 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:51,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:51,938 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:51,939 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 78 flow. Second operand 7 states and 603 transitions. [2023-08-29 20:16:51,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 242 flow [2023-08-29 20:16:51,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 210 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-29 20:16:51,942 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 86 flow [2023-08-29 20:16:51,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=86, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-08-29 20:16:51,943 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-08-29 20:16:51,943 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 86 flow [2023-08-29 20:16:51,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 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-29 20:16:51,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:51,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:51,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:16:51,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:51,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1337065508, now seen corresponding path program 2 times [2023-08-29 20:16:51,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:16:51,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905288841] [2023-08-29 20:16:51,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:51,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:16:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:16:52,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:16:52,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905288841] [2023-08-29 20:16:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905288841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:52,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:52,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:16:52,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561149354] [2023-08-29 20:16:52,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:52,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:16:52,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:16:52,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:16:52,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:16:52,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 195 [2023-08-29 20:16:52,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:52,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:52,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 195 [2023-08-29 20:16:52,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:52,238 INFO L130 PetriNetUnfolder]: 37/110 cut-off events. [2023-08-29 20:16:52,238 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-08-29 20:16:52,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 110 events. 37/110 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 329 event pairs, 5 based on Foata normal form. 1/111 useless extension candidates. Maximal degree in co-relation 325. Up to 55 conditions per place. [2023-08-29 20:16:52,239 INFO L137 encePairwiseOnDemand]: 188/195 looper letters, 34 selfloop transitions, 9 changer transitions 0/43 dead transitions. [2023-08-29 20:16:52,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 254 flow [2023-08-29 20:16:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:16:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:16:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2023-08-29 20:16:52,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482051282051282 [2023-08-29 20:16:52,242 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 437 transitions. [2023-08-29 20:16:52,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 437 transitions. [2023-08-29 20:16:52,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:52,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 437 transitions. [2023-08-29 20:16:52,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:52,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:52,245 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:52,245 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 86 flow. Second operand 5 states and 437 transitions. [2023-08-29 20:16:52,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 254 flow [2023-08-29 20:16:52,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 241 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:16:52,247 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 141 flow [2023-08-29 20:16:52,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-29 20:16:52,248 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2023-08-29 20:16:52,248 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 141 flow [2023-08-29 20:16:52,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:52,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:52,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:52,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:16:52,249 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:52,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:52,249 INFO L85 PathProgramCache]: Analyzing trace with hash 705307356, now seen corresponding path program 3 times [2023-08-29 20:16:52,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:16:52,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619159309] [2023-08-29 20:16:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:52,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:16:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:16:52,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:16:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:16:52,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:16:52,338 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:16:52,339 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:16:52,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:16:52,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:16:52,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:16:52,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:16:52,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:16:52,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:16:52,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:16:52,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:16:52,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:16:52,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:16:52,346 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:52,351 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:16:52,351 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:16:52,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:16:52 BasicIcfg [2023-08-29 20:16:52,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:16:52,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:16:52,399 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:16:52,399 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:16:52,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:45" (3/4) ... [2023-08-29 20:16:52,405 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:16:52,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:16:52,405 INFO L158 Benchmark]: Toolchain (without parser) took 8236.83ms. Allocated memory was 69.2MB in the beginning and 157.3MB in the end (delta: 88.1MB). Free memory was 45.8MB in the beginning and 92.4MB in the end (delta: -46.6MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2023-08-29 20:16:52,406 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 50.3MB. Free memory was 28.8MB in the beginning and 28.7MB in the end (delta: 54.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:16:52,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.53ms. Allocated memory is still 69.2MB. Free memory was 45.6MB in the beginning and 40.2MB in the end (delta: 5.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-29 20:16:52,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.44ms. Allocated memory is still 69.2MB. Free memory was 40.2MB in the beginning and 37.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:16:52,407 INFO L158 Benchmark]: Boogie Preprocessor took 36.44ms. Allocated memory is still 69.2MB. Free memory was 37.9MB in the beginning and 36.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:16:52,407 INFO L158 Benchmark]: RCFGBuilder took 716.43ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 36.0MB in the beginning and 58.1MB in the end (delta: -22.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-08-29 20:16:52,407 INFO L158 Benchmark]: TraceAbstraction took 6856.03ms. Allocated memory was 83.9MB in the beginning and 157.3MB in the end (delta: 73.4MB). Free memory was 56.9MB in the beginning and 92.4MB in the end (delta: -35.5MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2023-08-29 20:16:52,408 INFO L158 Benchmark]: Witness Printer took 6.05ms. Allocated memory is still 157.3MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:16:52,413 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 50.3MB. Free memory was 28.8MB in the beginning and 28.7MB in the end (delta: 54.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.53ms. Allocated memory is still 69.2MB. Free memory was 45.6MB in the beginning and 40.2MB in the end (delta: 5.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.44ms. Allocated memory is still 69.2MB. Free memory was 40.2MB in the beginning and 37.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.44ms. Allocated memory is still 69.2MB. Free memory was 37.9MB in the beginning and 36.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 716.43ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 36.0MB in the beginning and 58.1MB in the end (delta: -22.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6856.03ms. Allocated memory was 83.9MB in the beginning and 157.3MB in the end (delta: 73.4MB). Free memory was 56.9MB in the beginning and 92.4MB in the end (delta: -35.5MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Witness Printer took 6.05ms. Allocated memory is still 157.3MB. Free memory is still 92.4MB. 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.3s, 101 PlacesBefore, 31 PlacesAfterwards, 96 TransitionsBefore, 25 TransitionsAfterwards, 1232 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 3577 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1724, independent: 1570, independent conditional: 0, independent unconditional: 1570, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 682, independent: 651, independent conditional: 0, independent unconditional: 651, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1724, independent: 919, independent conditional: 0, independent unconditional: 919, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 682, unknown conditional: 0, unknown unconditional: 682] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t305, ((void *)0), P0, ((void *)0))=-1, t305={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L814] 0 pthread_t t306; [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t306, ((void *)0), P1, ((void *)0))=0, t305={5:0}, t306={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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 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) [L779] 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)) [L780] 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)) [L781] 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)) [L782] 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)) [L783] 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)) [L784] 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)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - 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: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 815]: 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 5 procedures, 117 locations, 10 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: 6.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 604 IncrementalHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 36 mSDtfsCounter, 604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=8, InterpolantAutomatonStates: 36, 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, 1.7s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:16:52,445 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:16:54,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:16:54,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:16:54,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:16:54,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:16:54,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:16:54,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:16:54,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:16:54,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:16:54,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:16:54,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:16:54,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:16:54,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:16:54,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:16:54,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:16:54,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:16:54,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:16:54,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:16:54,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:16:54,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:16:54,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:16:54,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:16:54,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:16:54,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:16:54,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:16:54,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:16:54,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:16:54,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:16:54,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:16:54,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:16:54,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:16:54,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:16:54,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:16:54,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:16:54,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:16:54,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:16:54,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:16:54,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:16:54,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:16:54,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:16:54,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:16:54,410 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:16:54,448 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:16:54,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:16:54,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:16:54,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:16:54,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:16:54,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:16:54,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:16:54,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:16:54,451 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:16:54,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:16:54,452 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:16:54,453 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:16:54,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:16:54,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:16:54,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:16:54,454 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:16:54,454 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:16:54,454 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:16:54,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:16:54,454 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:16:54,455 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:16:54,455 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:16:54,455 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:16:54,455 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:16:54,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:16:54,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:16:54,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:16:54,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:16:54,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:16:54,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:16:54,457 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:16:54,457 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:16:54,458 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:16:54,458 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:16:54,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:16:54,458 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:16:54,459 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:16:54,459 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 -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:16:54,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:16:54,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:16:54,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:16:54,808 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:16:54,809 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:16:54,810 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-29 20:16:55,943 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:16:56,126 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:16:56,127 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-29 20:16:56,138 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf781079/556e045f82094fcbabab2c91e0f44a0d/FLAG098e6e17c [2023-08-29 20:16:56,151 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf781079/556e045f82094fcbabab2c91e0f44a0d [2023-08-29 20:16:56,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:16:56,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:16:56,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:16:56,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:16:56,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:16:56,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:16:56" (1/1) ... [2023-08-29 20:16:56,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d13ff40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56, skipping insertion in model container [2023-08-29 20:16:56,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:16:56" (1/1) ... [2023-08-29 20:16:56,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:16:56,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:16:56,354 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-08-29 20:16:56,496 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:16:56,517 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:16:56,532 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-08-29 20:16:56,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:16:56,628 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:16:56,629 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:16:56,634 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:16:56,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56 WrapperNode [2023-08-29 20:16:56,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:16:56,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:16:56,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:16:56,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:16:56,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56" (1/1) ... [2023-08-29 20:16:56,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56" (1/1) ... [2023-08-29 20:16:56,712 INFO L138 Inliner]: procedures = 178, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2023-08-29 20:16:56,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:16:56,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:16:56,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:16:56,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:16:56,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56" (1/1) ... [2023-08-29 20:16:56,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56" (1/1) ... [2023-08-29 20:16:56,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56" (1/1) ... [2023-08-29 20:16:56,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56" (1/1) ... [2023-08-29 20:16:56,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56" (1/1) ... [2023-08-29 20:16:56,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56" (1/1) ... [2023-08-29 20:16:56,759 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56" (1/1) ... [2023-08-29 20:16:56,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56" (1/1) ... [2023-08-29 20:16:56,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:16:56,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:16:56,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:16:56,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:16:56,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56" (1/1) ... [2023-08-29 20:16:56,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:16:56,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:16:56,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:16:56,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:16:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:16:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:16:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:16:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:16:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:16:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:16:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:16:56,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:16:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:16:56,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:16:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:16:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:16:56,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:16:56,831 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:16:56,988 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:16:56,989 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:16:57,274 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:16:57,419 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:16:57,424 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:16:57,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:57 BoogieIcfgContainer [2023-08-29 20:16:57,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:16:57,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:16:57,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:16:57,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:16:57,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:16:56" (1/3) ... [2023-08-29 20:16:57,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2128a30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:16:57, skipping insertion in model container [2023-08-29 20:16:57,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:56" (2/3) ... [2023-08-29 20:16:57,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2128a30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:16:57, skipping insertion in model container [2023-08-29 20:16:57,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:57" (3/3) ... [2023-08-29 20:16:57,433 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-29 20:16:57,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:16:57,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:16:57,447 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:16:57,516 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:16:57,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 99 transitions, 208 flow [2023-08-29 20:16:57,609 INFO L130 PetriNetUnfolder]: 2/97 cut-off events. [2023-08-29 20:16:57,610 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:16:57,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-29 20:16:57,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 99 transitions, 208 flow [2023-08-29 20:16:57,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 97 transitions, 200 flow [2023-08-29 20:16:57,623 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:16:57,642 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 97 transitions, 200 flow [2023-08-29 20:16:57,647 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 97 transitions, 200 flow [2023-08-29 20:16:57,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 200 flow [2023-08-29 20:16:57,680 INFO L130 PetriNetUnfolder]: 2/97 cut-off events. [2023-08-29 20:16:57,680 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:16:57,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-29 20:16:57,683 INFO L119 LiptonReduction]: Number of co-enabled transitions 1232 [2023-08-29 20:17:02,707 INFO L134 LiptonReduction]: Checked pairs total: 3278 [2023-08-29 20:17:02,707 INFO L136 LiptonReduction]: Total number of compositions: 102 [2023-08-29 20:17:02,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:17:02,739 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;@5b8ba0c8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:17:02,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:17:02,770 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:17:02,770 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:17:02,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:02,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:17:02,771 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:17:02,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash 453, now seen corresponding path program 1 times [2023-08-29 20:17:02,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:17:02,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54137330] [2023-08-29 20:17:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:02,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:02,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:17:02,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:17:02,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:17:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:02,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:17:02,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:17:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:17:02,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:17:02,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:17:02,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54137330] [2023-08-29 20:17:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54137330] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:02,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:02,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:17:02,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638150657] [2023-08-29 20:17:02,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:02,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:17:02,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:17:02,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:17:02,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:17:02,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-08-29 20:17:02,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:02,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:02,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-08-29 20:17:02,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:03,049 INFO L130 PetriNetUnfolder]: 224/391 cut-off events. [2023-08-29 20:17:03,049 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-29 20:17:03,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 391 events. 224/391 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1571 event pairs, 224 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 782. Up to 386 conditions per place. [2023-08-29 20:17:03,053 INFO L137 encePairwiseOnDemand]: 197/201 looper letters, 17 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-08-29 20:17:03,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 78 flow [2023-08-29 20:17:03,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:17:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:17:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2023-08-29 20:17:03,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4900497512437811 [2023-08-29 20:17:03,079 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2023-08-29 20:17:03,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2023-08-29 20:17:03,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:03,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2023-08-29 20:17:03,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,089 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,090 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 2 states and 197 transitions. [2023-08-29 20:17:03,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 78 flow [2023-08-29 20:17:03,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:17:03,093 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 42 flow [2023-08-29 20:17:03,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-08-29 20:17:03,097 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2023-08-29 20:17:03,098 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 42 flow [2023-08-29 20:17:03,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:03,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:17:03,110 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-29 20:17:03,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:03,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:17:03,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:03,308 INFO L85 PathProgramCache]: Analyzing trace with hash 444641, now seen corresponding path program 1 times [2023-08-29 20:17:03,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:17:03,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270329833] [2023-08-29 20:17:03,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:03,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:03,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:17:03,310 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:17:03,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:17:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:03,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:17:03,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:17:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:17:03,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:17:03,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:17:03,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270329833] [2023-08-29 20:17:03,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270329833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:03,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:03,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:17:03,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580926067] [2023-08-29 20:17:03,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:03,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:17:03,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:17:03,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:17:03,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:17:03,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-08-29 20:17:03,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:03,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-08-29 20:17:03,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:03,522 INFO L130 PetriNetUnfolder]: 173/335 cut-off events. [2023-08-29 20:17:03,522 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:17:03,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 335 events. 173/335 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1522 event pairs, 20 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 647. Up to 250 conditions per place. [2023-08-29 20:17:03,526 INFO L137 encePairwiseOnDemand]: 198/201 looper letters, 23 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2023-08-29 20:17:03,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 29 transitions, 118 flow [2023-08-29 20:17:03,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:17:03,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:17:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-08-29 20:17:03,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4792703150912106 [2023-08-29 20:17:03,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-08-29 20:17:03,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-08-29 20:17:03,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:03,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-08-29 20:17:03,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,535 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 42 flow. Second operand 3 states and 289 transitions. [2023-08-29 20:17:03,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 29 transitions, 118 flow [2023-08-29 20:17:03,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:17:03,536 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-08-29 20:17:03,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-08-29 20:17:03,537 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2023-08-29 20:17:03,537 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-08-29 20:17:03,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:03,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:03,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-29 20:17:03,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:03,745 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:17:03,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:03,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1628308823, now seen corresponding path program 1 times [2023-08-29 20:17:03,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:17:03,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982942665] [2023-08-29 20:17:03,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:03,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:03,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:17:03,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:17:03,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:17:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:03,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:17:03,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:17:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:17:03,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:17:03,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:17:03,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982942665] [2023-08-29 20:17:03,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982942665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:03,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:03,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:17:03,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573829384] [2023-08-29 20:17:03,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:03,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:17:03,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:17:03,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:17:03,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:17:03,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 201 [2023-08-29 20:17:03,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:03,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 201 [2023-08-29 20:17:03,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:03,941 INFO L130 PetriNetUnfolder]: 69/154 cut-off events. [2023-08-29 20:17:03,941 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 20:17:03,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 154 events. 69/154 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 566 event pairs, 27 based on Foata normal form. 20/162 useless extension candidates. Maximal degree in co-relation 331. Up to 61 conditions per place. [2023-08-29 20:17:03,943 INFO L137 encePairwiseOnDemand]: 196/201 looper letters, 27 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2023-08-29 20:17:03,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 146 flow [2023-08-29 20:17:03,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:17:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:17:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 366 transitions. [2023-08-29 20:17:03,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4552238805970149 [2023-08-29 20:17:03,946 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 366 transitions. [2023-08-29 20:17:03,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 366 transitions. [2023-08-29 20:17:03,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:03,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 366 transitions. [2023-08-29 20:17:03,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,950 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,950 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 4 states and 366 transitions. [2023-08-29 20:17:03,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 146 flow [2023-08-29 20:17:03,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:17:03,951 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 64 flow [2023-08-29 20:17:03,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-08-29 20:17:03,952 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2023-08-29 20:17:03,953 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 64 flow [2023-08-29 20:17:03,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:03,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:03,967 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 (4)] Ended with exit code 0 [2023-08-29 20:17:04,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:04,163 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:17:04,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash 214724658, now seen corresponding path program 1 times [2023-08-29 20:17:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:17:04,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841905450] [2023-08-29 20:17:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:04,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:17:04,169 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:17:04,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 20:17:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:04,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:17:04,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:17:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:17:04,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:17:04,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:17:04,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841905450] [2023-08-29 20:17:04,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841905450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:04,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:04,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:17:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944574283] [2023-08-29 20:17:04,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:04,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:17:04,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:17:04,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:17:04,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:17:04,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 201 [2023-08-29 20:17:04,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:04,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:04,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 201 [2023-08-29 20:17:04,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:04,425 INFO L130 PetriNetUnfolder]: 24/70 cut-off events. [2023-08-29 20:17:04,425 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-29 20:17:04,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 70 events. 24/70 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 176 event pairs, 10 based on Foata normal form. 8/76 useless extension candidates. Maximal degree in co-relation 186. Up to 29 conditions per place. [2023-08-29 20:17:04,426 INFO L137 encePairwiseOnDemand]: 196/201 looper letters, 18 selfloop transitions, 6 changer transitions 1/27 dead transitions. [2023-08-29 20:17:04,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 135 flow [2023-08-29 20:17:04,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:17:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:17:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2023-08-29 20:17:04,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43980099502487563 [2023-08-29 20:17:04,429 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 442 transitions. [2023-08-29 20:17:04,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 442 transitions. [2023-08-29 20:17:04,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:04,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 442 transitions. [2023-08-29 20:17:04,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:04,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:04,433 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:04,433 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 64 flow. Second operand 5 states and 442 transitions. [2023-08-29 20:17:04,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 135 flow [2023-08-29 20:17:04,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 126 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:17:04,435 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 80 flow [2023-08-29 20:17:04,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2023-08-29 20:17:04,437 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-08-29 20:17:04,437 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 80 flow [2023-08-29 20:17:04,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:04,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:04,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:04,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-29 20:17:04,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:04,650 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:17:04,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:04,650 INFO L85 PathProgramCache]: Analyzing trace with hash 312206453, now seen corresponding path program 1 times [2023-08-29 20:17:04,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:17:04,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900337509] [2023-08-29 20:17:04,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:04,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:04,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:17:04,652 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:17:04,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:17:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:04,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-29 20:17:04,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:17:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:17:04,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:17:04,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:17:04,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900337509] [2023-08-29 20:17:04,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900337509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:04,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:04,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:17:04,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551183950] [2023-08-29 20:17:04,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:04,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:17:04,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:17:04,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:17:04,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:17:04,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 201 [2023-08-29 20:17:04,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:04,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:04,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 201 [2023-08-29 20:17:04,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:05,047 INFO L130 PetriNetUnfolder]: 19/69 cut-off events. [2023-08-29 20:17:05,047 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2023-08-29 20:17:05,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 69 events. 19/69 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 178 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 200. Up to 25 conditions per place. [2023-08-29 20:17:05,048 INFO L137 encePairwiseOnDemand]: 195/201 looper letters, 31 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2023-08-29 20:17:05,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 244 flow [2023-08-29 20:17:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:17:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:17:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 608 transitions. [2023-08-29 20:17:05,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43212508884150674 [2023-08-29 20:17:05,051 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 608 transitions. [2023-08-29 20:17:05,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 608 transitions. [2023-08-29 20:17:05,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:05,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 608 transitions. [2023-08-29 20:17:05,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:05,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:05,056 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:05,056 INFO L175 Difference]: Start difference. First operand has 32 places, 19 transitions, 80 flow. Second operand 7 states and 608 transitions. [2023-08-29 20:17:05,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 244 flow [2023-08-29 20:17:05,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 178 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-29 20:17:05,058 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 74 flow [2023-08-29 20:17:05,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=74, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2023-08-29 20:17:05,059 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-29 20:17:05,059 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 74 flow [2023-08-29 20:17:05,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:05,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:05,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:05,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:17:05,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:05,269 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:17:05,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:05,270 INFO L85 PathProgramCache]: Analyzing trace with hash -857028805, now seen corresponding path program 2 times [2023-08-29 20:17:05,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:17:05,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342920803] [2023-08-29 20:17:05,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:17:05,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:05,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:17:05,271 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:17:05,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:17:05,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:17:05,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:17:05,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:17:05,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:17:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:17:05,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:17:05,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:17:05,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342920803] [2023-08-29 20:17:05,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342920803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:05,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:05,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:17:05,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959565517] [2023-08-29 20:17:05,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:05,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:17:05,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:17:05,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:17:05,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:17:05,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 201 [2023-08-29 20:17:05,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:05,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:05,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 201 [2023-08-29 20:17:05,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:05,482 INFO L130 PetriNetUnfolder]: 31/109 cut-off events. [2023-08-29 20:17:05,482 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-08-29 20:17:05,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 109 events. 31/109 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 369 event pairs, 13 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 288. Up to 46 conditions per place. [2023-08-29 20:17:05,483 INFO L137 encePairwiseOnDemand]: 198/201 looper letters, 34 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-29 20:17:05,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 207 flow [2023-08-29 20:17:05,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:17:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:17:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2023-08-29 20:17:05,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4539800995024876 [2023-08-29 20:17:05,485 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 365 transitions. [2023-08-29 20:17:05,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 365 transitions. [2023-08-29 20:17:05,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:05,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 365 transitions. [2023-08-29 20:17:05,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.25) internal successors, (365), 4 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-29 20:17:05,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:05,488 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:05,488 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 74 flow. Second operand 4 states and 365 transitions. [2023-08-29 20:17:05,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 207 flow [2023-08-29 20:17:05,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:17:05,489 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 81 flow [2023-08-29 20:17:05,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2023-08-29 20:17:05,490 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-08-29 20:17:05,490 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 81 flow [2023-08-29 20:17:05,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:05,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:05,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:05,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:17:05,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:05,704 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:17:05,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:05,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1207623681, now seen corresponding path program 1 times [2023-08-29 20:17:05,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:17:05,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786851274] [2023-08-29 20:17:05,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:05,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:05,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:17:05,706 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:17:05,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 20:17:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:05,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 20:17:05,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:17:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:17:05,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:17:05,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:17:05,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786851274] [2023-08-29 20:17:05,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786851274] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:05,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:05,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:17:05,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801911994] [2023-08-29 20:17:05,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:05,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:17:05,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:17:05,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:17:05,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:17:06,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 201 [2023-08-29 20:17:06,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:06,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:06,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 201 [2023-08-29 20:17:06,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:06,219 INFO L130 PetriNetUnfolder]: 26/93 cut-off events. [2023-08-29 20:17:06,223 INFO L131 PetriNetUnfolder]: For 34/36 co-relation queries the response was YES. [2023-08-29 20:17:06,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 93 events. 26/93 cut-off events. For 34/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 310 event pairs, 14 based on Foata normal form. 4/96 useless extension candidates. Maximal degree in co-relation 252. Up to 83 conditions per place. [2023-08-29 20:17:06,224 INFO L137 encePairwiseOnDemand]: 198/201 looper letters, 15 selfloop transitions, 2 changer transitions 5/24 dead transitions. [2023-08-29 20:17:06,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 24 transitions, 131 flow [2023-08-29 20:17:06,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:17:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:17:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 322 transitions. [2023-08-29 20:17:06,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40049751243781095 [2023-08-29 20:17:06,226 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 322 transitions. [2023-08-29 20:17:06,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 322 transitions. [2023-08-29 20:17:06,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:06,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 322 transitions. [2023-08-29 20:17:06,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:06,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:06,229 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:06,229 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 81 flow. Second operand 4 states and 322 transitions. [2023-08-29 20:17:06,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 24 transitions, 131 flow [2023-08-29 20:17:06,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 24 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:17:06,233 INFO L231 Difference]: Finished difference. Result has 36 places, 18 transitions, 66 flow [2023-08-29 20:17:06,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=36, PETRI_TRANSITIONS=18} [2023-08-29 20:17:06,233 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2023-08-29 20:17:06,233 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 18 transitions, 66 flow [2023-08-29 20:17:06,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:06,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:06,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:06,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 20:17:06,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:06,447 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:17:06,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:06,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2005475639, now seen corresponding path program 3 times [2023-08-29 20:17:06,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:17:06,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897453022] [2023-08-29 20:17:06,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:17:06,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:06,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:17:06,449 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:17:06,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:17:06,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:17:06,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:17:06,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:17:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:17:06,613 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:17:06,613 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:17:06,614 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:17:06,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:17:06,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:17:06,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:17:06,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:17:06,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:17:06,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:17:06,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:17:06,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:17:06,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:17:06,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:17:06,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:17:06,830 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-29 20:17:06,835 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:17:06,835 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:17:06,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:17:06 BasicIcfg [2023-08-29 20:17:06,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:17:06,877 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:17:06,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:17:06,877 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:17:06,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:57" (3/4) ... [2023-08-29 20:17:06,879 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:17:06,879 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:17:06,880 INFO L158 Benchmark]: Toolchain (without parser) took 10724.87ms. Allocated memory was 73.4MB in the beginning and 109.1MB in the end (delta: 35.7MB). Free memory was 39.6MB in the beginning and 45.3MB in the end (delta: -5.7MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2023-08-29 20:17:06,880 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory is still 29.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:17:06,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.29ms. Allocated memory is still 73.4MB. Free memory was 39.4MB in the beginning and 33.3MB in the end (delta: 6.1MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2023-08-29 20:17:06,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.27ms. Allocated memory is still 73.4MB. Free memory was 33.0MB in the beginning and 52.5MB in the end (delta: -19.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:17:06,881 INFO L158 Benchmark]: Boogie Preprocessor took 49.57ms. Allocated memory is still 73.4MB. Free memory was 52.5MB in the beginning and 50.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:17:06,882 INFO L158 Benchmark]: RCFGBuilder took 662.52ms. Allocated memory is still 73.4MB. Free memory was 50.4MB in the beginning and 33.5MB in the end (delta: 16.8MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2023-08-29 20:17:06,882 INFO L158 Benchmark]: TraceAbstraction took 9448.12ms. Allocated memory was 73.4MB in the beginning and 109.1MB in the end (delta: 35.7MB). Free memory was 32.9MB in the beginning and 45.3MB in the end (delta: -12.4MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2023-08-29 20:17:06,882 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 109.1MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:17:06,884 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory is still 29.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.29ms. Allocated memory is still 73.4MB. Free memory was 39.4MB in the beginning and 33.3MB in the end (delta: 6.1MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.27ms. Allocated memory is still 73.4MB. Free memory was 33.0MB in the beginning and 52.5MB in the end (delta: -19.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.57ms. Allocated memory is still 73.4MB. Free memory was 52.5MB in the beginning and 50.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 662.52ms. Allocated memory is still 73.4MB. Free memory was 50.4MB in the beginning and 33.5MB in the end (delta: 16.8MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9448.12ms. Allocated memory was 73.4MB in the beginning and 109.1MB in the end (delta: 35.7MB). Free memory was 32.9MB in the beginning and 45.3MB in the end (delta: -12.4MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 109.1MB. Free memory is still 45.3MB. 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.1s, 102 PlacesBefore, 30 PlacesAfterwards, 97 TransitionsBefore, 23 TransitionsAfterwards, 1232 CoEnabledTransitionPairs, 6 FixpointIterations, 50 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, 3278 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1753, independent: 1626, independent conditional: 0, independent unconditional: 1626, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 676, independent: 641, independent conditional: 0, independent unconditional: 641, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1753, independent: 985, independent conditional: 0, independent unconditional: 985, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 676, unknown conditional: 0, unknown unconditional: 676] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t305, ((void *)0), P0, ((void *)0))=-1, t305={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L814] 0 pthread_t t306; [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t306, ((void *)0), P1, ((void *)0))=0, t305={3:0}, t306={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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 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) [L779] 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)) [L780] 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)) [L781] 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)) [L782] 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)) [L783] 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)) [L784] 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)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={3:0}, t306={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={3:0}, t306={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - 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: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 815]: 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 5 procedures, 118 locations, 10 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: 9.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 477 IncrementalHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 39 mSDtfsCounter, 477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=6, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 63 ConstructedInterpolants, 13 QuantifiedInterpolants, 534 SizeOfPredicates, 3 NumberOfNonLiveVariables, 657 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:17:06,905 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