./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/rfi001_power.oepc_pso.oepc_rmo.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 67d0d28278c33bd8f728db1165a077a9d9ba1963e0d97b66e361587c8715de93 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:25:42,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:25:42,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:25:42,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:25:42,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:25:42,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:25:42,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:25:42,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:25:42,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:25:42,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:25:42,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:25:42,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:25:42,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:25:42,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:25:42,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:25:42,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:25:42,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:25:42,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:25:42,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:25:42,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:25:42,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:25:42,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:25:42,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:25:42,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:25:42,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:25:42,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:25:42,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:25:42,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:25:42,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:25:42,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:25:42,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:25:42,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:25:42,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:25:42,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:25:42,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:25:42,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:25:42,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:25:42,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:25:42,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:25:42,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:25:42,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:25:42,712 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:25:42,737 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:25:42,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:25:42,738 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:25:42,738 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:25:42,739 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:25:42,739 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:25:42,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:25:42,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:25:42,740 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:25:42,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:25:42,741 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:25:42,741 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:25:42,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:25:42,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:25:42,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:25:42,741 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:25:42,741 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:25:42,742 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:25:42,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:25:42,743 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:25:42,743 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:25:42,746 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:25:42,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:25:42,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:25:42,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:25:42,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:25:42,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:25:42,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:25:42,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:25:42,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:25:42,748 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:25:42,749 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:25:42,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:25:42,749 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:25:42,749 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 -> 67d0d28278c33bd8f728db1165a077a9d9ba1963e0d97b66e361587c8715de93 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 -> BEFORE [2023-08-31 23:25:42,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:25:43,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:25:43,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:25:43,014 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:25:43,014 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:25:43,015 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:25:43,829 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:25:44,076 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:25:44,077 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:25:44,090 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e514c5b/9540c980721749548042706e2cdce33a/FLAG322bce933 [2023-08-31 23:25:44,098 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e514c5b/9540c980721749548042706e2cdce33a [2023-08-31 23:25:44,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:25:44,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:25:44,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:25:44,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:25:44,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:25:44,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:25:44" (1/1) ... [2023-08-31 23:25:44,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82c3dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44, skipping insertion in model container [2023-08-31 23:25:44,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:25:44" (1/1) ... [2023-08-31 23:25:44,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:25:44,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:25:44,238 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/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:25:44,399 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:25:44,407 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:25:44,417 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/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:25:44,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:25:44,481 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:25:44,481 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:25:44,485 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:25:44,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44 WrapperNode [2023-08-31 23:25:44,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:25:44,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:25:44,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:25:44,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:25:44,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44" (1/1) ... [2023-08-31 23:25:44,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44" (1/1) ... [2023-08-31 23:25:44,532 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2023-08-31 23:25:44,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:25:44,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:25:44,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:25:44,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:25:44,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44" (1/1) ... [2023-08-31 23:25:44,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44" (1/1) ... [2023-08-31 23:25:44,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44" (1/1) ... [2023-08-31 23:25:44,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44" (1/1) ... [2023-08-31 23:25:44,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44" (1/1) ... [2023-08-31 23:25:44,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44" (1/1) ... [2023-08-31 23:25:44,570 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44" (1/1) ... [2023-08-31 23:25:44,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44" (1/1) ... [2023-08-31 23:25:44,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:25:44,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:25:44,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:25:44,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:25:44,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44" (1/1) ... [2023-08-31 23:25:44,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:25:44,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:25:44,604 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-31 23:25:44,622 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-31 23:25:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:25:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:25:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:25:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:25:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:25:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:25:44,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:25:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:25:44,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:25:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:25:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:25:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:25:44,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:25:44,634 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:25:44,720 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:25:44,731 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:25:45,032 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:25:45,137 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:25:45,137 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:25:45,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:25:45 BoogieIcfgContainer [2023-08-31 23:25:45,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:25:45,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:25:45,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:25:45,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:25:45,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:25:44" (1/3) ... [2023-08-31 23:25:45,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3abc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:25:45, skipping insertion in model container [2023-08-31 23:25:45,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:44" (2/3) ... [2023-08-31 23:25:45,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3abc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:25:45, skipping insertion in model container [2023-08-31 23:25:45,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:25:45" (3/3) ... [2023-08-31 23:25:45,145 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:25:45,155 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:25:45,155 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-31 23:25:45,156 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:25:45,206 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:25:45,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 99 transitions, 208 flow [2023-08-31 23:25:45,272 INFO L130 PetriNetUnfolder]: 2/97 cut-off events. [2023-08-31 23:25:45,273 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:45,277 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 63 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-31 23:25:45,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 99 transitions, 208 flow [2023-08-31 23:25:45,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 97 transitions, 200 flow [2023-08-31 23:25:45,287 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:25:45,297 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 97 transitions, 200 flow [2023-08-31 23:25:45,300 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 97 transitions, 200 flow [2023-08-31 23:25:45,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 200 flow [2023-08-31 23:25:45,326 INFO L130 PetriNetUnfolder]: 2/97 cut-off events. [2023-08-31 23:25:45,326 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:45,327 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 63 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-31 23:25:45,328 INFO L119 LiptonReduction]: Number of co-enabled transitions 1308 [2023-08-31 23:25:48,063 INFO L134 LiptonReduction]: Checked pairs total: 3412 [2023-08-31 23:25:48,063 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-31 23:25:48,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:25:48,084 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;@4d3666ab, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:25:48,084 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-31 23:25:48,086 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:25:48,086 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:48,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:48,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:25:48,087 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:25:48,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash 448, now seen corresponding path program 1 times [2023-08-31 23:25:48,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:48,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620444363] [2023-08-31 23:25:48,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:48,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:25:48,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:48,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620444363] [2023-08-31 23:25:48,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620444363] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:48,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:48,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:25:48,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533597704] [2023-08-31 23:25:48,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:48,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:25:48,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:48,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:25:48,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:25:48,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 195 [2023-08-31 23:25:48,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 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-31 23:25:48,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:48,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 195 [2023-08-31 23:25:48,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:48,312 INFO L130 PetriNetUnfolder]: 304/529 cut-off events. [2023-08-31 23:25:48,313 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 23:25:48,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 529 events. 304/529 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2265 event pairs, 304 based on Foata normal form. 25/432 useless extension candidates. Maximal degree in co-relation 1050. Up to 516 conditions per place. [2023-08-31 23:25:48,316 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 19 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-08-31 23:25:48,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 86 flow [2023-08-31 23:25:48,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:25:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:25:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2023-08-31 23:25:48,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2023-08-31 23:25:48,325 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 200 transitions. [2023-08-31 23:25:48,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 200 transitions. [2023-08-31 23:25:48,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:48,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 200 transitions. [2023-08-31 23:25:48,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:48,331 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-31 23:25:48,332 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-31 23:25:48,333 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 2 states and 200 transitions. [2023-08-31 23:25:48,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 86 flow [2023-08-31 23:25:48,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:48,335 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 46 flow [2023-08-31 23:25:48,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-08-31 23:25:48,338 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-08-31 23:25:48,338 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 46 flow [2023-08-31 23:25:48,339 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-31 23:25:48,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:48,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:25:48,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:25:48,339 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-31 23:25:48,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash 439867, now seen corresponding path program 1 times [2023-08-31 23:25:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:48,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306064228] [2023-08-31 23:25:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:48,517 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-31 23:25:48,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:48,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306064228] [2023-08-31 23:25:48,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306064228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:48,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:48,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:25:48,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911793778] [2023-08-31 23:25:48,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:48,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:25:48,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:48,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:25:48,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:25:48,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 195 [2023-08-31 23:25:48,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 46 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-31 23:25:48,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:48,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 195 [2023-08-31 23:25:48,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:48,612 INFO L130 PetriNetUnfolder]: 235/449 cut-off events. [2023-08-31 23:25:48,613 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:48,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 449 events. 235/449 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2119 event pairs, 28 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 863. Up to 334 conditions per place. [2023-08-31 23:25:48,617 INFO L137 encePairwiseOnDemand]: 192/195 looper letters, 25 selfloop transitions, 2 changer transitions 4/33 dead transitions. [2023-08-31 23:25:48,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 134 flow [2023-08-31 23:25:48,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:25:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:25:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-08-31 23:25:48,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008547008547009 [2023-08-31 23:25:48,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-08-31 23:25:48,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-08-31 23:25:48,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:48,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-08-31 23:25:48,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:48,622 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-31 23:25:48,622 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-31 23:25:48,622 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 46 flow. Second operand 3 states and 293 transitions. [2023-08-31 23:25:48,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 134 flow [2023-08-31 23:25:48,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:25:48,623 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 44 flow [2023-08-31 23:25:48,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-08-31 23:25:48,624 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2023-08-31 23:25:48,624 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 44 flow [2023-08-31 23:25:48,624 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-31 23:25:48,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:48,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:48,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:25:48,625 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:25:48,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:48,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2027440828, now seen corresponding path program 1 times [2023-08-31 23:25:48,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:48,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153256028] [2023-08-31 23:25:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:48,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-31 23:25:48,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:48,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153256028] [2023-08-31 23:25:48,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153256028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:48,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:48,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:25:48,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919041324] [2023-08-31 23:25:48,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:48,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:25:48,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:48,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:25:48,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:25:48,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 195 [2023-08-31 23:25:48,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:48,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:48,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 195 [2023-08-31 23:25:48,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:48,970 INFO L130 PetriNetUnfolder]: 173/303 cut-off events. [2023-08-31 23:25:48,971 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2023-08-31 23:25:48,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 303 events. 173/303 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1088 event pairs, 80 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 648. Up to 297 conditions per place. [2023-08-31 23:25:48,972 INFO L137 encePairwiseOnDemand]: 192/195 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-08-31 23:25:48,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 88 flow [2023-08-31 23:25:48,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:25:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:25:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 328 transitions. [2023-08-31 23:25:48,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4205128205128205 [2023-08-31 23:25:48,974 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 328 transitions. [2023-08-31 23:25:48,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 328 transitions. [2023-08-31 23:25:48,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:48,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 328 transitions. [2023-08-31 23:25:48,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-31 23:25:48,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:48,977 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:48,977 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 44 flow. Second operand 4 states and 328 transitions. [2023-08-31 23:25:48,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 88 flow [2023-08-31 23:25:48,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:48,978 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-08-31 23:25:48,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, 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=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-08-31 23:25:48,979 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -6 predicate places. [2023-08-31 23:25:48,979 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-08-31 23:25:48,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:48,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:48,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:48,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:25:48,980 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-31 23:25:48,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2027440782, now seen corresponding path program 1 times [2023-08-31 23:25:48,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:48,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270410566] [2023-08-31 23:25:48,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:48,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:49,115 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-31 23:25:49,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:49,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270410566] [2023-08-31 23:25:49,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270410566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:49,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:49,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:25:49,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185241943] [2023-08-31 23:25:49,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:49,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:25:49,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:49,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:25:49,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:25:49,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 195 [2023-08-31 23:25:49,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:49,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:49,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 195 [2023-08-31 23:25:49,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:49,247 INFO L130 PetriNetUnfolder]: 332/603 cut-off events. [2023-08-31 23:25:49,248 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 23:25:49,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 603 events. 332/603 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2707 event pairs, 86 based on Foata normal form. 45/648 useless extension candidates. Maximal degree in co-relation 1224. Up to 321 conditions per place. [2023-08-31 23:25:49,250 INFO L137 encePairwiseOnDemand]: 188/195 looper letters, 23 selfloop transitions, 5 changer transitions 18/46 dead transitions. [2023-08-31 23:25:49,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 46 transitions, 192 flow [2023-08-31 23:25:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:25:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:25:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2023-08-31 23:25:49,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4646153846153846 [2023-08-31 23:25:49,251 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 453 transitions. [2023-08-31 23:25:49,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 453 transitions. [2023-08-31 23:25:49,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:49,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 453 transitions. [2023-08-31 23:25:49,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:49,254 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-31 23:25:49,254 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-31 23:25:49,255 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 453 transitions. [2023-08-31 23:25:49,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 46 transitions, 192 flow [2023-08-31 23:25:49,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:49,256 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 83 flow [2023-08-31 23:25:49,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2023-08-31 23:25:49,256 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-08-31 23:25:49,257 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 83 flow [2023-08-31 23:25:49,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:49,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:49,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:49,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:25:49,257 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-31 23:25:49,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1573840273, now seen corresponding path program 1 times [2023-08-31 23:25:49,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:49,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912806038] [2023-08-31 23:25:49,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:49,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:49,397 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-31 23:25:49,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:49,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912806038] [2023-08-31 23:25:49,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912806038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:49,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:49,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:25:49,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609437841] [2023-08-31 23:25:49,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:49,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:25:49,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:49,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:25:49,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:25:49,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 195 [2023-08-31 23:25:49,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:49,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:49,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 195 [2023-08-31 23:25:49,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:49,560 INFO L130 PetriNetUnfolder]: 288/538 cut-off events. [2023-08-31 23:25:49,560 INFO L131 PetriNetUnfolder]: For 385/385 co-relation queries the response was YES. [2023-08-31 23:25:49,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 538 events. 288/538 cut-off events. For 385/385 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2353 event pairs, 71 based on Foata normal form. 40/578 useless extension candidates. Maximal degree in co-relation 1440. Up to 255 conditions per place. [2023-08-31 23:25:49,562 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 28 selfloop transitions, 5 changer transitions 19/52 dead transitions. [2023-08-31 23:25:49,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 285 flow [2023-08-31 23:25:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:25:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:25:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 619 transitions. [2023-08-31 23:25:49,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4534798534798535 [2023-08-31 23:25:49,564 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 619 transitions. [2023-08-31 23:25:49,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 619 transitions. [2023-08-31 23:25:49,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:49,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 619 transitions. [2023-08-31 23:25:49,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.42857142857143) internal successors, (619), 7 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:49,567 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-31 23:25:49,568 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-31 23:25:49,568 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 83 flow. Second operand 7 states and 619 transitions. [2023-08-31 23:25:49,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 52 transitions, 285 flow [2023-08-31 23:25:49,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 257 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:49,573 INFO L231 Difference]: Finished difference. Result has 39 places, 21 transitions, 103 flow [2023-08-31 23:25:49,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=69, 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=103, PETRI_PLACES=39, PETRI_TRANSITIONS=21} [2023-08-31 23:25:49,575 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-08-31 23:25:49,575 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 21 transitions, 103 flow [2023-08-31 23:25:49,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:49,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:49,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:49,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:25:49,576 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-31 23:25:49,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1842483401, now seen corresponding path program 1 times [2023-08-31 23:25:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505617858] [2023-08-31 23:25:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:49,723 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-31 23:25:49,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:49,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505617858] [2023-08-31 23:25:49,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505617858] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:49,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:49,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:25:49,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586662773] [2023-08-31 23:25:49,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:49,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:25:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:49,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:25:49,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:25:49,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 195 [2023-08-31 23:25:49,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 21 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:49,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:49,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 195 [2023-08-31 23:25:49,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:49,805 INFO L130 PetriNetUnfolder]: 101/238 cut-off events. [2023-08-31 23:25:49,805 INFO L131 PetriNetUnfolder]: For 171/178 co-relation queries the response was YES. [2023-08-31 23:25:49,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 238 events. 101/238 cut-off events. For 171/178 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1033 event pairs, 19 based on Foata normal form. 35/271 useless extension candidates. Maximal degree in co-relation 625. Up to 118 conditions per place. [2023-08-31 23:25:49,806 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 26 selfloop transitions, 5 changer transitions 12/48 dead transitions. [2023-08-31 23:25:49,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 279 flow [2023-08-31 23:25:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:25:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:25:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2023-08-31 23:25:49,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4574358974358974 [2023-08-31 23:25:49,808 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 446 transitions. [2023-08-31 23:25:49,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 446 transitions. [2023-08-31 23:25:49,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:49,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 446 transitions. [2023-08-31 23:25:49,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:49,810 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-31 23:25:49,810 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-31 23:25:49,811 INFO L175 Difference]: Start difference. First operand has 39 places, 21 transitions, 103 flow. Second operand 5 states and 446 transitions. [2023-08-31 23:25:49,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 279 flow [2023-08-31 23:25:49,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 268 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-31 23:25:49,812 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 129 flow [2023-08-31 23:25:49,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2023-08-31 23:25:49,813 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-08-31 23:25:49,813 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 129 flow [2023-08-31 23:25:49,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:49,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:49,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:49,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:25:49,814 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-31 23:25:49,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1033017833, now seen corresponding path program 1 times [2023-08-31 23:25:49,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:49,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746518541] [2023-08-31 23:25:49,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:49,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:49,986 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-31 23:25:49,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:49,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746518541] [2023-08-31 23:25:49,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746518541] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:49,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:49,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:25:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131140165] [2023-08-31 23:25:49,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:49,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:25:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:25:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:25:49,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 195 [2023-08-31 23:25:49,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:49,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:49,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 195 [2023-08-31 23:25:49,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:50,079 INFO L130 PetriNetUnfolder]: 68/171 cut-off events. [2023-08-31 23:25:50,079 INFO L131 PetriNetUnfolder]: For 162/166 co-relation queries the response was YES. [2023-08-31 23:25:50,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 171 events. 68/171 cut-off events. For 162/166 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 692 event pairs, 11 based on Foata normal form. 15/184 useless extension candidates. Maximal degree in co-relation 546. Up to 56 conditions per place. [2023-08-31 23:25:50,080 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 23 selfloop transitions, 8 changer transitions 12/48 dead transitions. [2023-08-31 23:25:50,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 305 flow [2023-08-31 23:25:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:25:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:25:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 608 transitions. [2023-08-31 23:25:50,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44542124542124545 [2023-08-31 23:25:50,082 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 608 transitions. [2023-08-31 23:25:50,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 608 transitions. [2023-08-31 23:25:50,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:50,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 608 transitions. [2023-08-31 23:25:50,083 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-31 23:25:50,084 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-31 23:25:50,085 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-31 23:25:50,085 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 129 flow. Second operand 7 states and 608 transitions. [2023-08-31 23:25:50,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 305 flow [2023-08-31 23:25:50,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 288 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-31 23:25:50,086 INFO L231 Difference]: Finished difference. Result has 45 places, 26 transitions, 151 flow [2023-08-31 23:25:50,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=151, PETRI_PLACES=45, PETRI_TRANSITIONS=26} [2023-08-31 23:25:50,086 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2023-08-31 23:25:50,087 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 151 flow [2023-08-31 23:25:50,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:50,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:50,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:50,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:25:50,087 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-31 23:25:50,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:50,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1901128010, now seen corresponding path program 1 times [2023-08-31 23:25:50,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:50,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907076560] [2023-08-31 23:25:50,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:50,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:50,423 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-31 23:25:50,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:50,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907076560] [2023-08-31 23:25:50,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907076560] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:50,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:50,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:25:50,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715028966] [2023-08-31 23:25:50,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:50,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:25:50,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:50,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:25:50,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:25:50,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 195 [2023-08-31 23:25:50,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 83.14285714285714) internal successors, (582), 7 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:50,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:50,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 195 [2023-08-31 23:25:50,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:50,571 INFO L130 PetriNetUnfolder]: 71/190 cut-off events. [2023-08-31 23:25:50,571 INFO L131 PetriNetUnfolder]: For 367/370 co-relation queries the response was YES. [2023-08-31 23:25:50,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 190 events. 71/190 cut-off events. For 367/370 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 811 event pairs, 3 based on Foata normal form. 1/191 useless extension candidates. Maximal degree in co-relation 686. Up to 85 conditions per place. [2023-08-31 23:25:50,572 INFO L137 encePairwiseOnDemand]: 188/195 looper letters, 22 selfloop transitions, 4 changer transitions 23/54 dead transitions. [2023-08-31 23:25:50,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 417 flow [2023-08-31 23:25:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:25:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:25:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 684 transitions. [2023-08-31 23:25:50,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43846153846153846 [2023-08-31 23:25:50,574 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 684 transitions. [2023-08-31 23:25:50,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 684 transitions. [2023-08-31 23:25:50,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:50,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 684 transitions. [2023-08-31 23:25:50,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 85.5) internal successors, (684), 8 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:50,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:50,577 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:50,577 INFO L175 Difference]: Start difference. First operand has 45 places, 26 transitions, 151 flow. Second operand 8 states and 684 transitions. [2023-08-31 23:25:50,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 417 flow [2023-08-31 23:25:50,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 358 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-08-31 23:25:50,579 INFO L231 Difference]: Finished difference. Result has 48 places, 25 transitions, 137 flow [2023-08-31 23:25:50,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=137, PETRI_PLACES=48, PETRI_TRANSITIONS=25} [2023-08-31 23:25:50,580 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2023-08-31 23:25:50,580 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 25 transitions, 137 flow [2023-08-31 23:25:50,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.14285714285714) internal successors, (582), 7 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:50,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:50,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:50,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:25:50,581 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-31 23:25:50,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:50,584 INFO L85 PathProgramCache]: Analyzing trace with hash 960511666, now seen corresponding path program 2 times [2023-08-31 23:25:50,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:50,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385503895] [2023-08-31 23:25:50,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:50,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:25:50,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:25:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:25:50,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:25:50,683 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:25:50,683 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-31 23:25:50,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-31 23:25:50,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-31 23:25:50,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-31 23:25:50,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-31 23:25:50,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-31 23:25:50,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-31 23:25:50,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-31 23:25:50,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-31 23:25:50,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-31 23:25:50,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:25:50,689 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:50,692 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:25:50,692 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:25:50,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:25:50 BasicIcfg [2023-08-31 23:25:50,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:25:50,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:25:50,742 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:25:50,742 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:25:50,743 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:25:45" (3/4) ... [2023-08-31 23:25:50,744 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:25:50,744 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:25:50,748 INFO L158 Benchmark]: Toolchain (without parser) took 6644.28ms. Allocated memory was 77.6MB in the beginning and 169.9MB in the end (delta: 92.3MB). Free memory was 53.3MB in the beginning and 71.4MB in the end (delta: -18.1MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2023-08-31 23:25:50,748 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 33.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:25:50,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.82ms. Allocated memory is still 77.6MB. Free memory was 53.1MB in the beginning and 50.5MB in the end (delta: 2.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2023-08-31 23:25:50,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.94ms. Allocated memory is still 77.6MB. Free memory was 50.5MB in the beginning and 47.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:25:50,748 INFO L158 Benchmark]: Boogie Preprocessor took 46.39ms. Allocated memory is still 77.6MB. Free memory was 47.9MB in the beginning and 46.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:25:50,748 INFO L158 Benchmark]: RCFGBuilder took 559.06ms. Allocated memory is still 77.6MB. Free memory was 46.4MB in the beginning and 37.3MB in the end (delta: 9.0MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2023-08-31 23:25:50,749 INFO L158 Benchmark]: TraceAbstraction took 5601.57ms. Allocated memory was 77.6MB in the beginning and 169.9MB in the end (delta: 92.3MB). Free memory was 36.7MB in the beginning and 71.4MB in the end (delta: -34.7MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2023-08-31 23:25:50,749 INFO L158 Benchmark]: Witness Printer took 1.94ms. Allocated memory is still 169.9MB. Free memory is still 71.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:25:50,752 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.09ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 33.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.82ms. Allocated memory is still 77.6MB. Free memory was 53.1MB in the beginning and 50.5MB in the end (delta: 2.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.94ms. Allocated memory is still 77.6MB. Free memory was 50.5MB in the beginning and 47.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.39ms. Allocated memory is still 77.6MB. Free memory was 47.9MB in the beginning and 46.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 559.06ms. Allocated memory is still 77.6MB. Free memory was 46.4MB in the beginning and 37.3MB in the end (delta: 9.0MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5601.57ms. Allocated memory was 77.6MB in the beginning and 169.9MB in the end (delta: 92.3MB). Free memory was 36.7MB in the beginning and 71.4MB in the end (delta: -34.7MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. * Witness Printer took 1.94ms. Allocated memory is still 169.9MB. Free memory is still 71.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: 2.8s, 102 PlacesBefore, 32 PlacesAfterwards, 97 TransitionsBefore, 26 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 3412 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1912, independent: 1775, independent conditional: 0, independent unconditional: 1775, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 726, independent: 701, independent conditional: 0, independent unconditional: 701, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1912, independent: 1074, independent conditional: 0, independent unconditional: 1074, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 726, unknown conditional: 0, unknown unconditional: 726] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1601; [L816] FCALL, FORK 0 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1601, ((void *)0), P0, ((void *)0))=0, t1601={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L817] 0 pthread_t t1602; [L818] FCALL, FORK 0 pthread_create(&t1602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1602, ((void *)0), P1, ((void *)0))=1, t1601={5:0}, t1602={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L740] 1 x$w_buff1 = x$w_buff0 [L741] 1 x$w_buff0 = 1 [L742] 1 x$w_buff1_used = x$w_buff0_used [L743] 1 x$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L745] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L751] 1 y = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L768] 2 y = 2 [L771] 2 z = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 x$flush_delayed = weak$$choice2 [L780] 2 x$mem_tmp = x [L781] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L783] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L784] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L785] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L787] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = x [L789] 2 x = x$flush_delayed ? x$mem_tmp : x [L790] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L825] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L826] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L827] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L828] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1601={5:0}, t1602={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L831] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] 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_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=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: 813]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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, 119 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: 5.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 296 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 662 IncrementalHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 36 mSDtfsCounter, 662 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=7, InterpolantAutomatonStates: 41, 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.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 393 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-31 23:25:50,773 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/rfi001_power.oepc_pso.oepc_rmo.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 67d0d28278c33bd8f728db1165a077a9d9ba1963e0d97b66e361587c8715de93 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:25:52,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:25:52,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:25:52,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:25:52,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:25:52,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:25:52,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:25:52,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:25:52,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:25:52,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:25:52,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:25:52,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:25:52,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:25:52,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:25:52,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:25:52,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:25:52,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:25:52,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:25:52,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:25:52,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:25:52,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:25:52,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:25:52,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:25:52,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:25:52,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:25:52,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:25:52,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:25:52,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:25:52,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:25:52,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:25:52,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:25:52,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:25:52,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:25:52,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:25:52,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:25:52,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:25:52,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:25:52,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:25:52,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:25:52,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:25:52,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:25:52,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:25:52,367 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:25:52,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:25:52,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:25:52,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:25:52,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:25:52,368 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:25:52,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:25:52,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:25:52,369 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:25:52,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:25:52,370 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:25:52,370 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:25:52,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:25:52,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:25:52,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:25:52,370 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:25:52,370 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:25:52,370 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:25:52,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:25:52,370 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:25:52,371 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:25:52,371 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:25:52,371 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:25:52,371 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:25:52,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:25:52,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:25:52,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:25:52,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:25:52,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:25:52,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:25:52,372 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:25:52,372 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:25:52,372 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:25:52,372 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:25:52,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:25:52,372 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:25:52,372 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:25:52,372 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 -> 67d0d28278c33bd8f728db1165a077a9d9ba1963e0d97b66e361587c8715de93 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 -> BEFORE [2023-08-31 23:25:52,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:25:52,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:25:52,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:25:52,605 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:25:52,608 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:25:52,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:25:53,510 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:25:53,685 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:25:53,685 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:25:53,698 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820c63686/0c562b8ae5b0411db601296e4ec6f376/FLAG5eeda1458 [2023-08-31 23:25:53,706 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820c63686/0c562b8ae5b0411db601296e4ec6f376 [2023-08-31 23:25:53,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:25:53,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:25:53,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:25:53,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:25:53,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:25:53,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:53,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5f8b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53, skipping insertion in model container [2023-08-31 23:25:53,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:53,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:25:53,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:25:53,827 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/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:25:53,918 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:25:53,927 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:25:53,934 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/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:25:53,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:25:53,983 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:25:53,983 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:25:53,987 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:25:53,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53 WrapperNode [2023-08-31 23:25:53,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:25:53,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:25:53,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:25:53,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:25:53,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:54,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:54,017 INFO L138 Inliner]: procedures = 178, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2023-08-31 23:25:54,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:25:54,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:25:54,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:25:54,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:25:54,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:54,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:54,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:54,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:54,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:54,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:54,033 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:54,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:54,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:25:54,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:25:54,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:25:54,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:25:54,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:54,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:25:54,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:25:54,062 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-31 23:25:54,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:25:54,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:25:54,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:25:54,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:25:54,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:25:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:25:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:25:54,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:25:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:25:54,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:25:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:25:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:25:54,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:25:54,086 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:25:54,081 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-31 23:25:54,175 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:25:54,176 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:25:54,426 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:25:54,525 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:25:54,525 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:25:54,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:25:54 BoogieIcfgContainer [2023-08-31 23:25:54,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:25:54,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:25:54,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:25:54,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:25:54,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:25:53" (1/3) ... [2023-08-31 23:25:54,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101138cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:25:54, skipping insertion in model container [2023-08-31 23:25:54,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (2/3) ... [2023-08-31 23:25:54,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101138cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:25:54, skipping insertion in model container [2023-08-31 23:25:54,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:25:54" (3/3) ... [2023-08-31 23:25:54,531 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:25:54,541 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:25:54,542 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-31 23:25:54,542 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:25:54,591 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:25:54,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 100 transitions, 210 flow [2023-08-31 23:25:54,661 INFO L130 PetriNetUnfolder]: 2/98 cut-off events. [2023-08-31 23:25:54,662 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:54,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-31 23:25:54,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 100 transitions, 210 flow [2023-08-31 23:25:54,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 98 transitions, 202 flow [2023-08-31 23:25:54,672 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:25:54,687 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 98 transitions, 202 flow [2023-08-31 23:25:54,688 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 98 transitions, 202 flow [2023-08-31 23:25:54,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 202 flow [2023-08-31 23:25:54,710 INFO L130 PetriNetUnfolder]: 2/98 cut-off events. [2023-08-31 23:25:54,710 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:54,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-31 23:25:54,711 INFO L119 LiptonReduction]: Number of co-enabled transitions 1308 [2023-08-31 23:25:58,881 INFO L134 LiptonReduction]: Checked pairs total: 3746 [2023-08-31 23:25:58,881 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-31 23:25:58,890 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:25:58,894 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;@35e6052d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:25:58,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-31 23:25:58,895 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:25:58,895 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:58,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:58,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:25:58,896 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-31 23:25:58,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:58,899 INFO L85 PathProgramCache]: Analyzing trace with hash 449, now seen corresponding path program 1 times [2023-08-31 23:25:58,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:58,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820318434] [2023-08-31 23:25:58,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:58,906 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-31 23:25:58,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:58,909 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-31 23:25:58,917 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-31 23:25:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:58,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:25:58,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:25:58,966 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-31 23:25:58,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:25:58,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:25:58,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820318434] [2023-08-31 23:25:58,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820318434] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:58,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:58,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:25:58,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387743610] [2023-08-31 23:25:58,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:58,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:25:58,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:25:58,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:25:58,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:25:58,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 195 [2023-08-31 23:25:58,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:58,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:58,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 195 [2023-08-31 23:25:58,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:59,157 INFO L130 PetriNetUnfolder]: 304/521 cut-off events. [2023-08-31 23:25:59,157 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 23:25:59,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 521 events. 304/521 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2212 event pairs, 304 based on Foata normal form. 25/420 useless extension candidates. Maximal degree in co-relation 1042. Up to 516 conditions per place. [2023-08-31 23:25:59,162 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 19 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-08-31 23:25:59,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 86 flow [2023-08-31 23:25:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:25:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:25:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2023-08-31 23:25:59,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.517948717948718 [2023-08-31 23:25:59,187 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2023-08-31 23:25:59,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2023-08-31 23:25:59,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:59,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2023-08-31 23:25:59,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:59,205 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-31 23:25:59,205 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-31 23:25:59,206 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 2 states and 202 transitions. [2023-08-31 23:25:59,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 86 flow [2023-08-31 23:25:59,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:59,213 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 46 flow [2023-08-31 23:25:59,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-08-31 23:25:59,216 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-08-31 23:25:59,216 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 46 flow [2023-08-31 23:25:59,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:59,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:59,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:25:59,235 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-31 23:25:59,417 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-31 23:25:59,417 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-31 23:25:59,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:59,418 INFO L85 PathProgramCache]: Analyzing trace with hash 439930, now seen corresponding path program 1 times [2023-08-31 23:25:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:59,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391751600] [2023-08-31 23:25:59,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:59,419 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-31 23:25:59,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:59,424 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-31 23:25:59,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:25:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:59,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:25:59,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:25:59,487 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-31 23:25:59,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:25:59,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:25:59,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391751600] [2023-08-31 23:25:59,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391751600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:59,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:59,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:25:59,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125453855] [2023-08-31 23:25:59,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:59,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:25:59,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:25:59,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:25:59,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:25:59,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 195 [2023-08-31 23:25:59,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:59,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:59,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 195 [2023-08-31 23:25:59,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:59,607 INFO L130 PetriNetUnfolder]: 235/423 cut-off events. [2023-08-31 23:25:59,608 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:59,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 423 events. 235/423 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1784 event pairs, 76 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 837. Up to 334 conditions per place. [2023-08-31 23:25:59,613 INFO L137 encePairwiseOnDemand]: 192/195 looper letters, 25 selfloop transitions, 2 changer transitions 4/33 dead transitions. [2023-08-31 23:25:59,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 134 flow [2023-08-31 23:25:59,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:25:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:25:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-31 23:25:59,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505982905982906 [2023-08-31 23:25:59,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-31 23:25:59,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-31 23:25:59,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:59,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-31 23:25:59,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:59,622 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-31 23:25:59,622 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-31 23:25:59,622 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 46 flow. Second operand 3 states and 296 transitions. [2023-08-31 23:25:59,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 134 flow [2023-08-31 23:25:59,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:25:59,623 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 44 flow [2023-08-31 23:25:59,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-08-31 23:25:59,623 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2023-08-31 23:25:59,623 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 44 flow [2023-08-31 23:25:59,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:59,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:59,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:59,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:25:59,830 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-31 23:25:59,831 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:25:59,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:59,831 INFO L85 PathProgramCache]: Analyzing trace with hash -462011138, now seen corresponding path program 1 times [2023-08-31 23:25:59,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:59,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356913558] [2023-08-31 23:25:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:59,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:25:59,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:59,833 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-31 23:25:59,835 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-31 23:25:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:59,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:25:59,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:25:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:25:59,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:25:59,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:25:59,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356913558] [2023-08-31 23:25:59,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356913558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:59,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:59,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:25:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936309267] [2023-08-31 23:25:59,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:59,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:25:59,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:25:59,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:25:59,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:25:59,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 195 [2023-08-31 23:25:59,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 44 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-31 23:25:59,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:59,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 195 [2023-08-31 23:25:59,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:00,002 INFO L130 PetriNetUnfolder]: 76/170 cut-off events. [2023-08-31 23:26:00,003 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-31 23:26:00,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 170 events. 76/170 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 621 event pairs, 15 based on Foata normal form. 20/181 useless extension candidates. Maximal degree in co-relation 363. Up to 94 conditions per place. [2023-08-31 23:26:00,004 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 22 selfloop transitions, 3 changer transitions 15/42 dead transitions. [2023-08-31 23:26:00,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 180 flow [2023-08-31 23:26:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:26:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:26:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2023-08-31 23:26:00,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4635897435897436 [2023-08-31 23:26:00,006 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 452 transitions. [2023-08-31 23:26:00,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 452 transitions. [2023-08-31 23:26:00,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:00,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 452 transitions. [2023-08-31 23:26:00,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:00,008 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-31 23:26:00,009 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-31 23:26:00,009 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 44 flow. Second operand 5 states and 452 transitions. [2023-08-31 23:26:00,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 180 flow [2023-08-31 23:26:00,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:26:00,010 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 67 flow [2023-08-31 23:26:00,010 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-08-31 23:26:00,011 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-08-31 23:26:00,011 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 67 flow [2023-08-31 23:26:00,011 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-31 23:26:00,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:00,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:00,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:00,218 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-31 23:26:00,218 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-31 23:26:00,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash -303452984, now seen corresponding path program 1 times [2023-08-31 23:26:00,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:00,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824612124] [2023-08-31 23:26:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:00,219 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-31 23:26:00,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:00,220 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-31 23:26:00,222 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-31 23:26:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:00,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:26:00,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:00,332 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-31 23:26:00,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:00,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:00,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824612124] [2023-08-31 23:26:00,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824612124] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:00,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:00,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:26:00,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171672435] [2023-08-31 23:26:00,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:00,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:26:00,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:00,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:26:00,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:26:00,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 195 [2023-08-31 23:26:00,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:00,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:00,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 195 [2023-08-31 23:26:00,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:00,441 INFO L130 PetriNetUnfolder]: 24/71 cut-off events. [2023-08-31 23:26:00,441 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-31 23:26:00,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 71 events. 24/71 cut-off events. For 17/17 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/77 useless extension candidates. Maximal degree in co-relation 184. Up to 29 conditions per place. [2023-08-31 23:26:00,442 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 20 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2023-08-31 23:26:00,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 175 flow [2023-08-31 23:26:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:26:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:26:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 527 transitions. [2023-08-31 23:26:00,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45042735042735044 [2023-08-31 23:26:00,444 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 527 transitions. [2023-08-31 23:26:00,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 527 transitions. [2023-08-31 23:26:00,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:00,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 527 transitions. [2023-08-31 23:26:00,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:00,447 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-31 23:26:00,448 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-31 23:26:00,448 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 67 flow. Second operand 6 states and 527 transitions. [2023-08-31 23:26:00,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 175 flow [2023-08-31 23:26:00,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 162 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-31 23:26:00,449 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 78 flow [2023-08-31 23:26:00,450 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-31 23:26:00,450 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-31 23:26:00,450 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 78 flow [2023-08-31 23:26:00,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:00,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:00,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:00,460 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-31 23:26:00,660 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-31 23:26:00,660 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-31 23:26:00,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1325059335, now seen corresponding path program 1 times [2023-08-31 23:26:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:00,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229287421] [2023-08-31 23:26:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:00,662 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-31 23:26:00,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:00,663 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-31 23:26:00,665 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-31 23:26:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:00,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-31 23:26:00,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:00,853 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-31 23:26:00,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:00,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:00,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229287421] [2023-08-31 23:26:00,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229287421] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:00,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:00,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:26:00,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761085049] [2023-08-31 23:26:00,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:00,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:26:00,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:00,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:26:00,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:26:00,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 195 [2023-08-31 23:26:00,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 78 flow. Second operand has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:00,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:00,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 195 [2023-08-31 23:26:00,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:01,003 INFO L130 PetriNetUnfolder]: 19/68 cut-off events. [2023-08-31 23:26:01,003 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2023-08-31 23:26:01,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 68 events. 19/68 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 157 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 189. Up to 25 conditions per place. [2023-08-31 23:26:01,003 INFO L137 encePairwiseOnDemand]: 188/195 looper letters, 32 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2023-08-31 23:26:01,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 242 flow [2023-08-31 23:26:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:26:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:26:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 692 transitions. [2023-08-31 23:26:01,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44358974358974357 [2023-08-31 23:26:01,005 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 692 transitions. [2023-08-31 23:26:01,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 692 transitions. [2023-08-31 23:26:01,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:01,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 692 transitions. [2023-08-31 23:26:01,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 86.5) internal successors, (692), 8 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,009 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,009 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 78 flow. Second operand 8 states and 692 transitions. [2023-08-31 23:26:01,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 242 flow [2023-08-31 23:26:01,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 210 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-31 23:26:01,010 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 94 flow [2023-08-31 23:26:01,010 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=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2023-08-31 23:26:01,011 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-08-31 23:26:01,011 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 94 flow [2023-08-31 23:26:01,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:01,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:01,020 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-31 23:26:01,218 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-31 23:26:01,219 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-31 23:26:01,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:01,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1331460121, now seen corresponding path program 2 times [2023-08-31 23:26:01,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:01,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159007832] [2023-08-31 23:26:01,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:26:01,220 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-31 23:26:01,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:01,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:26:01,223 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-31 23:26:01,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:26:01,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:26:01,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:26:01,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:01,304 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-31 23:26:01,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:01,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:01,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159007832] [2023-08-31 23:26:01,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159007832] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:01,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:01,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:26:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332401954] [2023-08-31 23:26:01,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:01,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:26:01,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:01,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:26:01,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:26:01,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 195 [2023-08-31 23:26:01,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:01,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 195 [2023-08-31 23:26:01,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:01,378 INFO L130 PetriNetUnfolder]: 31/113 cut-off events. [2023-08-31 23:26:01,378 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-08-31 23:26:01,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 113 events. 31/113 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 386 event pairs, 11 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 336. Up to 58 conditions per place. [2023-08-31 23:26:01,379 INFO L137 encePairwiseOnDemand]: 191/195 looper letters, 35 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-31 23:26:01,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 244 flow [2023-08-31 23:26:01,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:26:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:26:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 370 transitions. [2023-08-31 23:26:01,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2023-08-31 23:26:01,380 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 370 transitions. [2023-08-31 23:26:01,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 370 transitions. [2023-08-31 23:26:01,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:01,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 370 transitions. [2023-08-31 23:26:01,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,383 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,383 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 94 flow. Second operand 4 states and 370 transitions. [2023-08-31 23:26:01,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 244 flow [2023-08-31 23:26:01,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 236 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:26:01,386 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 122 flow [2023-08-31 23:26:01,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2023-08-31 23:26:01,388 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-08-31 23:26:01,388 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 122 flow [2023-08-31 23:26:01,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:01,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:01,398 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 (7)] Ended with exit code 0 [2023-08-31 23:26:01,596 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-31 23:26:01,596 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-31 23:26:01,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2145918329, now seen corresponding path program 1 times [2023-08-31 23:26:01,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:01,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685901382] [2023-08-31 23:26:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:01,597 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-31 23:26:01,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:01,598 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-31 23:26:01,600 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-31 23:26:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:01,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-31 23:26:01,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:01,835 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-31 23:26:01,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:01,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:01,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685901382] [2023-08-31 23:26:01,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685901382] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:01,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:01,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:26:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376674516] [2023-08-31 23:26:01,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:01,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:26:01,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:01,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:26:01,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:26:01,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 195 [2023-08-31 23:26:01,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:01,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 195 [2023-08-31 23:26:01,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:01,945 INFO L130 PetriNetUnfolder]: 26/99 cut-off events. [2023-08-31 23:26:01,945 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2023-08-31 23:26:01,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 99 events. 26/99 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 333 event pairs, 8 based on Foata normal form. 4/103 useless extension candidates. Maximal degree in co-relation 308. Up to 87 conditions per place. [2023-08-31 23:26:01,946 INFO L137 encePairwiseOnDemand]: 192/195 looper letters, 16 selfloop transitions, 2 changer transitions 8/28 dead transitions. [2023-08-31 23:26:01,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 184 flow [2023-08-31 23:26:01,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:26:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:26:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 327 transitions. [2023-08-31 23:26:01,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41923076923076924 [2023-08-31 23:26:01,949 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 327 transitions. [2023-08-31 23:26:01,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 327 transitions. [2023-08-31 23:26:01,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:01,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 327 transitions. [2023-08-31 23:26:01,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,951 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,951 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 122 flow. Second operand 4 states and 327 transitions. [2023-08-31 23:26:01,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 184 flow [2023-08-31 23:26:01,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 28 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:26:01,953 INFO L231 Difference]: Finished difference. Result has 41 places, 19 transitions, 82 flow [2023-08-31 23:26:01,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=41, PETRI_TRANSITIONS=19} [2023-08-31 23:26:01,954 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-08-31 23:26:01,954 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 19 transitions, 82 flow [2023-08-31 23:26:01,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:01,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:01,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:01,966 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-31 23:26:02,166 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-31 23:26:02,166 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-31 23:26:02,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:02,167 INFO L85 PathProgramCache]: Analyzing trace with hash -288634747, now seen corresponding path program 3 times [2023-08-31 23:26:02,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:02,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561484884] [2023-08-31 23:26:02,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:26:02,167 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-31 23:26:02,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:02,168 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-31 23:26:02,177 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-31 23:26:02,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:26:02,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:26:02,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:26:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:26:02,334 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:26:02,335 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:26:02,335 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-31 23:26:02,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-31 23:26:02,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-31 23:26:02,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-31 23:26:02,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-31 23:26:02,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-31 23:26:02,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-31 23:26:02,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-31 23:26:02,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-31 23:26:02,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-31 23:26:02,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-08-31 23:26:02,544 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-31 23:26:02,545 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-31 23:26:02,548 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:26:02,548 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:26:02,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:26:02 BasicIcfg [2023-08-31 23:26:02,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:26:02,592 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:26:02,592 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:26:02,592 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:26:02,593 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:25:54" (3/4) ... [2023-08-31 23:26:02,594 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:26:02,594 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:26:02,595 INFO L158 Benchmark]: Toolchain (without parser) took 8885.78ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 62.7MB in the beginning and 98.2MB in the end (delta: -35.5MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2023-08-31 23:26:02,595 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 65.0MB. Free memory is still 43.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:26:02,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.62ms. Allocated memory is still 86.0MB. Free memory was 62.5MB in the beginning and 61.1MB in the end (delta: 1.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-08-31 23:26:02,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.07ms. Allocated memory is still 86.0MB. Free memory was 61.1MB in the beginning and 58.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:26:02,596 INFO L158 Benchmark]: Boogie Preprocessor took 18.55ms. Allocated memory is still 86.0MB. Free memory was 58.6MB in the beginning and 56.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:26:02,596 INFO L158 Benchmark]: RCFGBuilder took 489.82ms. Allocated memory is still 86.0MB. Free memory was 56.9MB in the beginning and 43.8MB in the end (delta: 13.0MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2023-08-31 23:26:02,596 INFO L158 Benchmark]: TraceAbstraction took 8064.01ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 43.3MB in the beginning and 98.2MB in the end (delta: -54.8MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2023-08-31 23:26:02,596 INFO L158 Benchmark]: Witness Printer took 1.92ms. Allocated memory is still 125.8MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:26:02,598 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.09ms. Allocated memory is still 65.0MB. Free memory is still 43.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.62ms. Allocated memory is still 86.0MB. Free memory was 62.5MB in the beginning and 61.1MB in the end (delta: 1.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.07ms. Allocated memory is still 86.0MB. Free memory was 61.1MB in the beginning and 58.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.55ms. Allocated memory is still 86.0MB. Free memory was 58.6MB in the beginning and 56.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 489.82ms. Allocated memory is still 86.0MB. Free memory was 56.9MB in the beginning and 43.8MB in the end (delta: 13.0MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8064.01ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 43.3MB in the beginning and 98.2MB in the end (delta: -54.8MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. * Witness Printer took 1.92ms. Allocated memory is still 125.8MB. Free memory is still 98.2MB. 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: 4.2s, 103 PlacesBefore, 32 PlacesAfterwards, 98 TransitionsBefore, 26 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 3746 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1996, independent: 1837, independent conditional: 0, independent unconditional: 1837, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 724, independent: 699, independent conditional: 0, independent unconditional: 699, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1996, independent: 1138, independent conditional: 0, independent unconditional: 1138, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 724, unknown conditional: 0, unknown unconditional: 724] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1601; [L816] FCALL, FORK 0 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1601, ((void *)0), P0, ((void *)0))=-1, t1601={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L740] 1 x$w_buff1 = x$w_buff0 [L741] 1 x$w_buff0 = 1 [L742] 1 x$w_buff1_used = x$w_buff0_used [L743] 1 x$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L745] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L817] 0 pthread_t t1602; [L818] FCALL, FORK 0 pthread_create(&t1602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1602, ((void *)0), P1, ((void *)0))=0, t1601={3:0}, t1602={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L751] 1 y = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L768] 2 y = 2 [L771] 2 z = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 x$flush_delayed = weak$$choice2 [L780] 2 x$mem_tmp = x [L781] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L783] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L784] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L785] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L787] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = x [L789] 2 x = x$flush_delayed ? x$mem_tmp : x [L790] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L825] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L826] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L827] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L828] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1601={3:0}, t1602={7:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L831] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] 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_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=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: 813]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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, 120 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: 7.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 557 IncrementalHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 11 mSDtfsCounter, 557 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=6, InterpolantAutomatonStates: 32, 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.4s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 68 ConstructedInterpolants, 14 QuantifiedInterpolants, 556 SizeOfPredicates, 10 NumberOfNonLiveVariables, 659 ConjunctsInSsa, 43 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-31 23:26:02,623 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