./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS --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 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 01:59:15,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:59:15,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:59:15,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:59:15,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:59:15,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:59:15,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:59:15,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:59:15,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:59:15,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:59:15,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:59:15,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:59:15,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:59:15,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:59:15,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:59:15,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:59:15,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:59:15,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:59:15,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:59:15,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:59:15,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:59:15,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:59:15,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:59:15,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:59:15,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:59:15,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:59:15,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:59:15,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:59:15,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:59:15,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:59:15,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:59:15,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:59:15,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:59:15,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:59:15,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:59:15,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:59:15,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:59:15,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:59:15,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:59:15,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:59:15,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:59:15,788 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 01:59:15,826 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:59:15,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:59:15,827 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:59:15,827 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:59:15,828 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 01:59:15,829 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 01:59:15,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:59:15,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:59:15,830 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:59:15,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:59:15,831 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 01:59:15,831 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 01:59:15,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:59:15,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 01:59:15,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:59:15,832 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 01:59:15,832 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 01:59:15,832 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 01:59:15,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 01:59:15,833 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 01:59:15,833 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 01:59:15,833 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:59:15,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:59:15,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:59:15,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 01:59:15,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:59:15,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:59:15,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 01:59:15,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 01:59:15,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 01:59:15,835 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 01:59:15,835 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 01:59:15,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 01:59:15,836 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS 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 -> 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 [2022-11-23 01:59:16,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:59:16,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:59:16,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:59:16,134 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:59:16,134 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:59:16,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 01:59:19,075 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:59:19,452 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:59:19,459 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 01:59:19,476 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/data/4f8f5c11c/dd34f64321b74aaebe9d22ad4e66ee30/FLAGacad97bac [2022-11-23 01:59:19,495 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/data/4f8f5c11c/dd34f64321b74aaebe9d22ad4e66ee30 [2022-11-23 01:59:19,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:59:19,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:59:19,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:59:19,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:59:19,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:59:19,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:19" (1/1) ... [2022-11-23 01:59:19,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e510f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:19, skipping insertion in model container [2022-11-23 01:59:19,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:19" (1/1) ... [2022-11-23 01:59:19,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:59:19,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:59:19,715 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-23 01:59:19,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:59:19,945 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:59:19,965 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-23 01:59:20,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:59:20,078 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:59:20,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:20 WrapperNode [2022-11-23 01:59:20,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:59:20,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:59:20,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:59:20,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:59:20,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:20" (1/1) ... [2022-11-23 01:59:20,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:20" (1/1) ... [2022-11-23 01:59:20,127 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-11-23 01:59:20,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:59:20,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:59:20,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:59:20,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:59:20,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:20" (1/1) ... [2022-11-23 01:59:20,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:20" (1/1) ... [2022-11-23 01:59:20,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:20" (1/1) ... [2022-11-23 01:59:20,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:20" (1/1) ... [2022-11-23 01:59:20,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:20" (1/1) ... [2022-11-23 01:59:20,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:20" (1/1) ... [2022-11-23 01:59:20,158 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:20" (1/1) ... [2022-11-23 01:59:20,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:20" (1/1) ... [2022-11-23 01:59:20,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:59:20,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:59:20,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:59:20,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:59:20,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:20" (1/1) ... [2022-11-23 01:59:20,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:59:20,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:59:20,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 01:59:20,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 01:59:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 01:59:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 01:59:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 01:59:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 01:59:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 01:59:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 01:59:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 01:59:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 01:59:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 01:59:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 01:59:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 01:59:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 01:59:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 01:59:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:59:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:59:20,256 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 01:59:20,445 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:59:20,447 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:59:20,938 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:59:21,104 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:59:21,105 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 01:59:21,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:21 BoogieIcfgContainer [2022-11-23 01:59:21,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:59:21,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 01:59:21,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 01:59:21,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 01:59:21,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:59:19" (1/3) ... [2022-11-23 01:59:21,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af888cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:59:21, skipping insertion in model container [2022-11-23 01:59:21,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:20" (2/3) ... [2022-11-23 01:59:21,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af888cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:59:21, skipping insertion in model container [2022-11-23 01:59:21,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:21" (3/3) ... [2022-11-23 01:59:21,121 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 01:59:21,154 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 01:59:21,154 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-23 01:59:21,154 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 01:59:21,240 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 01:59:21,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-11-23 01:59:21,375 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-11-23 01:59:21,376 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:21,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-23 01:59:21,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2022-11-23 01:59:21,390 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2022-11-23 01:59:21,395 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 01:59:21,419 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2022-11-23 01:59:21,427 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2022-11-23 01:59:21,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2022-11-23 01:59:21,489 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-11-23 01:59:21,490 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:21,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-23 01:59:21,494 INFO L119 LiptonReduction]: Number of co-enabled transitions 2422 [2022-11-23 01:59:27,037 INFO L134 LiptonReduction]: Checked pairs total: 6747 [2022-11-23 01:59:27,038 INFO L136 LiptonReduction]: Total number of compositions: 122 [2022-11-23 01:59:27,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 01:59:27,061 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;@524f07a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 01:59:27,061 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-23 01:59:27,062 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 01:59:27,063 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:27,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:27,064 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 01:59:27,064 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:27,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash 545, now seen corresponding path program 1 times [2022-11-23 01:59:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:27,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843771978] [2022-11-23 01:59:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:27,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:27,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:27,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843771978] [2022-11-23 01:59:27,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843771978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:27,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:27,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 01:59:27,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246240313] [2022-11-23 01:59:27,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:27,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 01:59:27,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:27,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 01:59:27,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 01:59:27,224 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 249 [2022-11-23 01:59:27,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:27,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:27,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 249 [2022-11-23 01:59:27,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:27,771 INFO L130 PetriNetUnfolder]: 1616/2388 cut-off events. [2022-11-23 01:59:27,771 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-23 01:59:27,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4812 conditions, 2388 events. 1616/2388 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11378 event pairs, 1616 based on Foata normal form. 0/2013 useless extension candidates. Maximal degree in co-relation 4801. Up to 2368 conditions per place. [2022-11-23 01:59:27,790 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2022-11-23 01:59:27,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2022-11-23 01:59:27,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 01:59:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 01:59:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 258 transitions. [2022-11-23 01:59:27,813 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5180722891566265 [2022-11-23 01:59:27,814 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 258 transitions. [2022-11-23 01:59:27,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 258 transitions. [2022-11-23 01:59:27,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:27,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 258 transitions. [2022-11-23 01:59:27,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 129.0) internal successors, (258), 2 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:27,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:27,834 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:27,836 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 258 transitions. [2022-11-23 01:59:27,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2022-11-23 01:59:27,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 01:59:27,845 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2022-11-23 01:59:27,847 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2022-11-23 01:59:27,852 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2022-11-23 01:59:27,852 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2022-11-23 01:59:27,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:27,853 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:27,853 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 01:59:27,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 01:59:27,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:27,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:27,864 INFO L85 PathProgramCache]: Analyzing trace with hash 535338, now seen corresponding path program 1 times [2022-11-23 01:59:27,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:27,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464579761] [2022-11-23 01:59:27,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:27,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:28,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464579761] [2022-11-23 01:59:28,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464579761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:28,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:28,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 01:59:28,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437784585] [2022-11-23 01:59:28,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:28,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:59:28,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:28,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:59:28,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:59:28,180 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 249 [2022-11-23 01:59:28,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:28,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:28,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 249 [2022-11-23 01:59:28,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:28,577 INFO L130 PetriNetUnfolder]: 1263/1902 cut-off events. [2022-11-23 01:59:28,577 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:28,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3811 conditions, 1902 events. 1263/1902 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8855 event pairs, 562 based on Foata normal form. 0/1737 useless extension candidates. Maximal degree in co-relation 3808. Up to 1510 conditions per place. [2022-11-23 01:59:28,587 INFO L137 encePairwiseOnDemand]: 246/249 looper letters, 35 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2022-11-23 01:59:28,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 172 flow [2022-11-23 01:59:28,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:59:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:59:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2022-11-23 01:59:28,590 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5073627844712182 [2022-11-23 01:59:28,590 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2022-11-23 01:59:28,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2022-11-23 01:59:28,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:28,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2022-11-23 01:59:28,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:28,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:28,595 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:28,595 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 379 transitions. [2022-11-23 01:59:28,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 172 flow [2022-11-23 01:59:28,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 01:59:28,597 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2022-11-23 01:59:28,597 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, 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=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-11-23 01:59:28,598 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2022-11-23 01:59:28,598 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2022-11-23 01:59:28,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:28,599 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:28,599 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:28,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 01:59:28,599 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:28,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:28,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1438104665, now seen corresponding path program 1 times [2022-11-23 01:59:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:28,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437929903] [2022-11-23 01:59:28,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:28,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:28,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:28,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437929903] [2022-11-23 01:59:28,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437929903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:28,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:28,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 01:59:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57826938] [2022-11-23 01:59:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:28,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:59:28,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:28,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:59:28,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:59:28,972 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 249 [2022-11-23 01:59:28,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:28,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:28,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 249 [2022-11-23 01:59:28,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:29,874 INFO L130 PetriNetUnfolder]: 4029/5956 cut-off events. [2022-11-23 01:59:29,875 INFO L131 PetriNetUnfolder]: For 245/245 co-relation queries the response was YES. [2022-11-23 01:59:29,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12249 conditions, 5956 events. 4029/5956 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 31201 event pairs, 1165 based on Foata normal form. 0/5732 useless extension candidates. Maximal degree in co-relation 12245. Up to 3052 conditions per place. [2022-11-23 01:59:29,911 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 60 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2022-11-23 01:59:29,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 72 transitions, 306 flow [2022-11-23 01:59:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:59:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:59:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2022-11-23 01:59:29,946 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4811244979919679 [2022-11-23 01:59:29,946 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2022-11-23 01:59:29,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2022-11-23 01:59:29,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:29,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2022-11-23 01:59:29,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:29,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:29,952 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:29,952 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 599 transitions. [2022-11-23 01:59:29,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 72 transitions, 306 flow [2022-11-23 01:59:29,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 72 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 01:59:29,954 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 150 flow [2022-11-23 01:59:29,955 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2022-11-23 01:59:29,955 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-11-23 01:59:29,956 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 150 flow [2022-11-23 01:59:29,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:29,956 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:29,956 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:29,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 01:59:29,957 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:29,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1438104727, now seen corresponding path program 1 times [2022-11-23 01:59:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:29,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109139814] [2022-11-23 01:59:29,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:29,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:30,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:30,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109139814] [2022-11-23 01:59:30,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109139814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:30,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:30,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:59:30,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197877389] [2022-11-23 01:59:30,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:30,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:59:30,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:30,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:59:30,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:59:30,728 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 249 [2022-11-23 01:59:30,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:30,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:30,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 249 [2022-11-23 01:59:30,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:31,493 INFO L130 PetriNetUnfolder]: 2436/3764 cut-off events. [2022-11-23 01:59:31,494 INFO L131 PetriNetUnfolder]: For 2015/2067 co-relation queries the response was YES. [2022-11-23 01:59:31,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9897 conditions, 3764 events. 2436/3764 cut-off events. For 2015/2067 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20238 event pairs, 604 based on Foata normal form. 420/4133 useless extension candidates. Maximal degree in co-relation 9890. Up to 2579 conditions per place. [2022-11-23 01:59:31,517 INFO L137 encePairwiseOnDemand]: 244/249 looper letters, 38 selfloop transitions, 5 changer transitions 8/55 dead transitions. [2022-11-23 01:59:31,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 310 flow [2022-11-23 01:59:31,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:59:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 01:59:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 636 transitions. [2022-11-23 01:59:31,523 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42570281124497994 [2022-11-23 01:59:31,523 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 636 transitions. [2022-11-23 01:59:31,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 636 transitions. [2022-11-23 01:59:31,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:31,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 636 transitions. [2022-11-23 01:59:31,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:31,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:31,534 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:31,534 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 150 flow. Second operand 6 states and 636 transitions. [2022-11-23 01:59:31,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 310 flow [2022-11-23 01:59:31,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 310 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 01:59:31,539 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 122 flow [2022-11-23 01:59:31,539 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-11-23 01:59:31,541 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-11-23 01:59:31,541 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 122 flow [2022-11-23 01:59:31,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:31,542 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:31,542 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:31,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 01:59:31,542 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:31,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1829525001, now seen corresponding path program 1 times [2022-11-23 01:59:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:31,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71745642] [2022-11-23 01:59:31,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:31,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:31,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:31,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71745642] [2022-11-23 01:59:31,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71745642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:31,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:31,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 01:59:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149792539] [2022-11-23 01:59:31,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:31,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:59:31,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:31,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:59:31,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:59:31,726 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2022-11-23 01:59:31,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:31,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:31,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2022-11-23 01:59:31,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:32,300 INFO L130 PetriNetUnfolder]: 2061/3229 cut-off events. [2022-11-23 01:59:32,300 INFO L131 PetriNetUnfolder]: For 2250/2308 co-relation queries the response was YES. [2022-11-23 01:59:32,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8452 conditions, 3229 events. 2061/3229 cut-off events. For 2250/2308 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16877 event pairs, 737 based on Foata normal form. 188/3368 useless extension candidates. Maximal degree in co-relation 8444. Up to 2103 conditions per place. [2022-11-23 01:59:32,329 INFO L137 encePairwiseOnDemand]: 245/249 looper letters, 29 selfloop transitions, 3 changer transitions 18/54 dead transitions. [2022-11-23 01:59:32,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 300 flow [2022-11-23 01:59:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:59:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:59:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-11-23 01:59:32,331 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4835341365461847 [2022-11-23 01:59:32,332 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2022-11-23 01:59:32,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2022-11-23 01:59:32,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:32,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2022-11-23 01:59:32,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:32,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:32,338 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:32,339 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 122 flow. Second operand 5 states and 602 transitions. [2022-11-23 01:59:32,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 300 flow [2022-11-23 01:59:32,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 270 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-11-23 01:59:32,353 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 115 flow [2022-11-23 01:59:32,353 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-11-23 01:59:32,356 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2022-11-23 01:59:32,356 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 115 flow [2022-11-23 01:59:32,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:32,356 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:32,357 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:32,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 01:59:32,357 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:32,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:32,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1566676328, now seen corresponding path program 1 times [2022-11-23 01:59:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:32,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145461779] [2022-11-23 01:59:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:32,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:32,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:32,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145461779] [2022-11-23 01:59:32,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145461779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:32,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:32,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 01:59:32,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265696930] [2022-11-23 01:59:32,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:32,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:59:32,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:32,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:59:32,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:59:32,539 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 249 [2022-11-23 01:59:32,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:32,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:32,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 249 [2022-11-23 01:59:32,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:33,190 INFO L130 PetriNetUnfolder]: 2005/3187 cut-off events. [2022-11-23 01:59:33,191 INFO L131 PetriNetUnfolder]: For 2626/2685 co-relation queries the response was YES. [2022-11-23 01:59:33,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8176 conditions, 3187 events. 2005/3187 cut-off events. For 2626/2685 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16856 event pairs, 1018 based on Foata normal form. 160/3307 useless extension candidates. Maximal degree in co-relation 8166. Up to 2609 conditions per place. [2022-11-23 01:59:33,212 INFO L137 encePairwiseOnDemand]: 244/249 looper letters, 33 selfloop transitions, 5 changer transitions 19/61 dead transitions. [2022-11-23 01:59:33,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 339 flow [2022-11-23 01:59:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:59:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:59:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2022-11-23 01:59:33,214 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4843373493975904 [2022-11-23 01:59:33,214 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2022-11-23 01:59:33,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2022-11-23 01:59:33,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:33,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2022-11-23 01:59:33,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:33,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:33,220 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:33,220 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 115 flow. Second operand 5 states and 603 transitions. [2022-11-23 01:59:33,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 339 flow [2022-11-23 01:59:33,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 327 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-23 01:59:33,235 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 148 flow [2022-11-23 01:59:33,235 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2022-11-23 01:59:33,236 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2022-11-23 01:59:33,236 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 148 flow [2022-11-23 01:59:33,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:33,236 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:33,237 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:33,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 01:59:33,237 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:33,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1321148858, now seen corresponding path program 1 times [2022-11-23 01:59:33,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:33,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067095261] [2022-11-23 01:59:33,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:33,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:33,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:33,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067095261] [2022-11-23 01:59:33,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067095261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:33,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:33,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 01:59:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876936746] [2022-11-23 01:59:33,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:33,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:59:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:33,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:59:33,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:59:33,403 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 249 [2022-11-23 01:59:33,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:33,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:33,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 249 [2022-11-23 01:59:33,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:33,785 INFO L130 PetriNetUnfolder]: 1170/1978 cut-off events. [2022-11-23 01:59:33,786 INFO L131 PetriNetUnfolder]: For 1548/1683 co-relation queries the response was YES. [2022-11-23 01:59:33,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5258 conditions, 1978 events. 1170/1978 cut-off events. For 1548/1683 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10893 event pairs, 284 based on Foata normal form. 200/2120 useless extension candidates. Maximal degree in co-relation 5248. Up to 852 conditions per place. [2022-11-23 01:59:33,801 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 50 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2022-11-23 01:59:33,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 374 flow [2022-11-23 01:59:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 01:59:33,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 01:59:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2022-11-23 01:59:33,803 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48092369477911645 [2022-11-23 01:59:33,803 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2022-11-23 01:59:33,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2022-11-23 01:59:33,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:33,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2022-11-23 01:59:33,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:33,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:33,807 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:33,807 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 148 flow. Second operand 4 states and 479 transitions. [2022-11-23 01:59:33,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 374 flow [2022-11-23 01:59:33,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 365 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-23 01:59:33,812 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 179 flow [2022-11-23 01:59:33,812 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-11-23 01:59:33,815 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-11-23 01:59:33,815 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 179 flow [2022-11-23 01:59:33,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:33,815 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:33,816 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:33,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 01:59:33,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash -362177870, now seen corresponding path program 1 times [2022-11-23 01:59:33,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:33,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64743042] [2022-11-23 01:59:33,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:34,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:34,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64743042] [2022-11-23 01:59:34,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64743042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:34,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:34,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:59:34,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177441216] [2022-11-23 01:59:34,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:34,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:59:34,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:34,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:59:34,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:59:34,056 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 249 [2022-11-23 01:59:34,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:34,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:34,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 249 [2022-11-23 01:59:34,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:34,641 INFO L130 PetriNetUnfolder]: 1944/3183 cut-off events. [2022-11-23 01:59:34,641 INFO L131 PetriNetUnfolder]: For 3251/3251 co-relation queries the response was YES. [2022-11-23 01:59:34,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10495 conditions, 3183 events. 1944/3183 cut-off events. For 3251/3251 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 17314 event pairs, 553 based on Foata normal form. 60/3243 useless extension candidates. Maximal degree in co-relation 10484. Up to 1642 conditions per place. [2022-11-23 01:59:34,657 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 48 selfloop transitions, 8 changer transitions 24/80 dead transitions. [2022-11-23 01:59:34,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 528 flow [2022-11-23 01:59:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:59:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 01:59:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 699 transitions. [2022-11-23 01:59:34,660 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4678714859437751 [2022-11-23 01:59:34,660 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 699 transitions. [2022-11-23 01:59:34,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 699 transitions. [2022-11-23 01:59:34,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:34,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 699 transitions. [2022-11-23 01:59:34,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:34,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:34,666 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:34,666 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 179 flow. Second operand 6 states and 699 transitions. [2022-11-23 01:59:34,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 528 flow [2022-11-23 01:59:34,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 521 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-23 01:59:34,671 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 210 flow [2022-11-23 01:59:34,671 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2022-11-23 01:59:34,674 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2022-11-23 01:59:34,674 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 210 flow [2022-11-23 01:59:34,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:34,676 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:34,676 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:34,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 01:59:34,677 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:34,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:34,677 INFO L85 PathProgramCache]: Analyzing trace with hash 982436658, now seen corresponding path program 1 times [2022-11-23 01:59:34,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:34,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076222499] [2022-11-23 01:59:34,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:34,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:34,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:34,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076222499] [2022-11-23 01:59:34,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076222499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:34,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:34,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:59:34,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83359917] [2022-11-23 01:59:34,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:34,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:59:34,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:34,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:59:34,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:59:34,928 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 249 [2022-11-23 01:59:34,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:34,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:34,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 249 [2022-11-23 01:59:34,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:35,633 INFO L130 PetriNetUnfolder]: 2001/3382 cut-off events. [2022-11-23 01:59:35,634 INFO L131 PetriNetUnfolder]: For 5737/5737 co-relation queries the response was YES. [2022-11-23 01:59:35,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11522 conditions, 3382 events. 2001/3382 cut-off events. For 5737/5737 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 19829 event pairs, 231 based on Foata normal form. 63/3445 useless extension candidates. Maximal degree in co-relation 11507. Up to 1217 conditions per place. [2022-11-23 01:59:35,652 INFO L137 encePairwiseOnDemand]: 240/249 looper letters, 64 selfloop transitions, 14 changer transitions 26/104 dead transitions. [2022-11-23 01:59:35,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 104 transitions, 751 flow [2022-11-23 01:59:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 01:59:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 01:59:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions. [2022-11-23 01:59:35,655 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46184738955823296 [2022-11-23 01:59:35,656 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 805 transitions. [2022-11-23 01:59:35,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions. [2022-11-23 01:59:35,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:35,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions. [2022-11-23 01:59:35,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:35,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:35,661 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:35,662 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 210 flow. Second operand 7 states and 805 transitions. [2022-11-23 01:59:35,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 104 transitions, 751 flow [2022-11-23 01:59:35,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 104 transitions, 701 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-11-23 01:59:35,673 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 282 flow [2022-11-23 01:59:35,673 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2022-11-23 01:59:35,674 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2022-11-23 01:59:35,674 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 282 flow [2022-11-23 01:59:35,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:35,674 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:35,674 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:35,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 01:59:35,675 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:35,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1769872466, now seen corresponding path program 2 times [2022-11-23 01:59:35,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:35,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947829218] [2022-11-23 01:59:35,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:35,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:35,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:35,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947829218] [2022-11-23 01:59:35,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947829218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:35,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:35,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:59:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125517063] [2022-11-23 01:59:35,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:35,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:59:35,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:35,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:59:35,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:59:35,876 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 249 [2022-11-23 01:59:35,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:35,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:35,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 249 [2022-11-23 01:59:35,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:36,265 INFO L130 PetriNetUnfolder]: 843/1641 cut-off events. [2022-11-23 01:59:36,265 INFO L131 PetriNetUnfolder]: For 1794/1858 co-relation queries the response was YES. [2022-11-23 01:59:36,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4983 conditions, 1641 events. 843/1641 cut-off events. For 1794/1858 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10144 event pairs, 142 based on Foata normal form. 225/1839 useless extension candidates. Maximal degree in co-relation 4967. Up to 685 conditions per place. [2022-11-23 01:59:36,275 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 60 selfloop transitions, 8 changer transitions 7/83 dead transitions. [2022-11-23 01:59:36,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 633 flow [2022-11-23 01:59:36,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:59:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:59:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2022-11-23 01:59:36,277 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4811244979919679 [2022-11-23 01:59:36,278 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2022-11-23 01:59:36,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2022-11-23 01:59:36,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:36,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2022-11-23 01:59:36,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:36,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:36,282 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:36,282 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 282 flow. Second operand 5 states and 599 transitions. [2022-11-23 01:59:36,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 633 flow [2022-11-23 01:59:36,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 83 transitions, 612 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-23 01:59:36,288 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 282 flow [2022-11-23 01:59:36,288 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2022-11-23 01:59:36,288 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-11-23 01:59:36,289 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 282 flow [2022-11-23 01:59:36,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:36,289 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:36,289 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:36,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 01:59:36,290 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:36,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:36,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1959790438, now seen corresponding path program 1 times [2022-11-23 01:59:36,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:36,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419158070] [2022-11-23 01:59:36,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:36,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:36,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:36,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419158070] [2022-11-23 01:59:36,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419158070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:36,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:36,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:59:36,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736771513] [2022-11-23 01:59:36,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:36,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:59:36,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:36,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:59:36,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:59:36,563 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 249 [2022-11-23 01:59:36,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:36,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:36,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 249 [2022-11-23 01:59:36,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:36,913 INFO L130 PetriNetUnfolder]: 684/1327 cut-off events. [2022-11-23 01:59:36,913 INFO L131 PetriNetUnfolder]: For 2240/2299 co-relation queries the response was YES. [2022-11-23 01:59:36,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4790 conditions, 1327 events. 684/1327 cut-off events. For 2240/2299 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7831 event pairs, 129 based on Foata normal form. 66/1374 useless extension candidates. Maximal degree in co-relation 4772. Up to 615 conditions per place. [2022-11-23 01:59:36,920 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 32 selfloop transitions, 11 changer transitions 21/67 dead transitions. [2022-11-23 01:59:36,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 525 flow [2022-11-23 01:59:36,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:59:36,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 01:59:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 698 transitions. [2022-11-23 01:59:36,922 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46720214190093706 [2022-11-23 01:59:36,922 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 698 transitions. [2022-11-23 01:59:36,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 698 transitions. [2022-11-23 01:59:36,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:36,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 698 transitions. [2022-11-23 01:59:36,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:36,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:36,928 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:36,928 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 282 flow. Second operand 6 states and 698 transitions. [2022-11-23 01:59:36,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 525 flow [2022-11-23 01:59:36,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 67 transitions, 491 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-11-23 01:59:36,933 INFO L231 Difference]: Finished difference. Result has 62 places, 29 transitions, 194 flow [2022-11-23 01:59:36,933 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=194, PETRI_PLACES=62, PETRI_TRANSITIONS=29} [2022-11-23 01:59:36,934 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2022-11-23 01:59:36,934 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 29 transitions, 194 flow [2022-11-23 01:59:36,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:36,934 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:36,934 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:36,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 01:59:36,935 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:36,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash -138318928, now seen corresponding path program 1 times [2022-11-23 01:59:36,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:36,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51761785] [2022-11-23 01:59:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:37,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:37,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51761785] [2022-11-23 01:59:37,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51761785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:37,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:37,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 01:59:37,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795588771] [2022-11-23 01:59:37,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:37,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 01:59:37,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:37,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 01:59:37,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 01:59:37,929 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 249 [2022-11-23 01:59:37,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 29 transitions, 194 flow. Second operand has 8 states, 8 states have (on average 102.875) internal successors, (823), 8 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:37,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:37,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 249 [2022-11-23 01:59:37,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:38,248 INFO L130 PetriNetUnfolder]: 150/303 cut-off events. [2022-11-23 01:59:38,248 INFO L131 PetriNetUnfolder]: For 612/612 co-relation queries the response was YES. [2022-11-23 01:59:38,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 303 events. 150/303 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1035 event pairs, 23 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 1189. Up to 157 conditions per place. [2022-11-23 01:59:38,250 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 36 selfloop transitions, 5 changer transitions 26/67 dead transitions. [2022-11-23 01:59:38,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 67 transitions, 556 flow [2022-11-23 01:59:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 01:59:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 01:59:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 954 transitions. [2022-11-23 01:59:38,253 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42570281124497994 [2022-11-23 01:59:38,253 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 954 transitions. [2022-11-23 01:59:38,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 954 transitions. [2022-11-23 01:59:38,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:38,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 954 transitions. [2022-11-23 01:59:38,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:38,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:38,261 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:38,261 INFO L175 Difference]: Start difference. First operand has 62 places, 29 transitions, 194 flow. Second operand 9 states and 954 transitions. [2022-11-23 01:59:38,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 67 transitions, 556 flow [2022-11-23 01:59:38,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 351 flow, removed 38 selfloop flow, removed 20 redundant places. [2022-11-23 01:59:38,265 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 116 flow [2022-11-23 01:59:38,265 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=116, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2022-11-23 01:59:38,266 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-11-23 01:59:38,266 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 116 flow [2022-11-23 01:59:38,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.875) internal successors, (823), 8 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:38,267 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:38,267 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:38,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 01:59:38,267 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:38,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:38,268 INFO L85 PathProgramCache]: Analyzing trace with hash 37447932, now seen corresponding path program 2 times [2022-11-23 01:59:38,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:38,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391739244] [2022-11-23 01:59:38,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:38,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:59:38,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:59:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:59:38,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:59:38,453 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 01:59:38,454 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-23 01:59:38,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-23 01:59:38,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-23 01:59:38,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-23 01:59:38,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-23 01:59:38,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-23 01:59:38,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-23 01:59:38,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-23 01:59:38,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-23 01:59:38,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-23 01:59:38,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-23 01:59:38,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-23 01:59:38,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-23 01:59:38,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 01:59:38,460 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:38,466 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 01:59:38,466 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 01:59:38,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:59:38 BasicIcfg [2022-11-23 01:59:38,544 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 01:59:38,544 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 01:59:38,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 01:59:38,545 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 01:59:38,545 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:21" (3/4) ... [2022-11-23 01:59:38,548 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 01:59:38,548 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 01:59:38,548 INFO L158 Benchmark]: Toolchain (without parser) took 19049.78ms. Allocated memory was 159.4MB in the beginning and 486.5MB in the end (delta: 327.2MB). Free memory was 127.0MB in the beginning and 350.1MB in the end (delta: -223.1MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. [2022-11-23 01:59:38,549 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 159.4MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:59:38,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.99ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 103.1MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 01:59:38,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.15ms. Allocated memory is still 159.4MB. Free memory was 103.1MB in the beginning and 100.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:59:38,549 INFO L158 Benchmark]: Boogie Preprocessor took 35.20ms. Allocated memory is still 159.4MB. Free memory was 100.9MB in the beginning and 98.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:59:38,550 INFO L158 Benchmark]: RCFGBuilder took 943.44ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 98.9MB in the beginning and 161.4MB in the end (delta: -62.5MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2022-11-23 01:59:38,550 INFO L158 Benchmark]: TraceAbstraction took 17432.84ms. Allocated memory was 192.9MB in the beginning and 486.5MB in the end (delta: 293.6MB). Free memory was 160.7MB in the beginning and 351.2MB in the end (delta: -190.5MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. [2022-11-23 01:59:38,550 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 486.5MB. Free memory is still 350.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:59:38,552 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.27ms. Allocated memory is still 159.4MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 578.99ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 103.1MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.15ms. Allocated memory is still 159.4MB. Free memory was 103.1MB in the beginning and 100.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.20ms. Allocated memory is still 159.4MB. Free memory was 100.9MB in the beginning and 98.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 943.44ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 98.9MB in the beginning and 161.4MB in the end (delta: -62.5MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17432.84ms. Allocated memory was 192.9MB in the beginning and 486.5MB in the end (delta: 293.6MB). Free memory was 160.7MB in the beginning and 351.2MB in the end (delta: -190.5MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 486.5MB. Free memory is still 350.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 132 PlacesBefore, 42 PlacesAfterwards, 124 TransitionsBefore, 33 TransitionsAfterwards, 2422 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 122 TotalNumberOfCompositions, 6747 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3064, independent: 2882, independent conditional: 0, independent unconditional: 2882, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1638, independent: 1592, independent conditional: 0, independent unconditional: 1592, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1638, independent: 1574, independent conditional: 0, independent unconditional: 1574, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 367, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 336, dependent conditional: 0, dependent unconditional: 336, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3064, independent: 1290, independent conditional: 0, independent unconditional: 1290, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 1638, unknown conditional: 0, unknown unconditional: 1638] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t497; [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t497, ((void *)0), P0, ((void *)0))=-2, t497={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t498; [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t498, ((void *)0), P1, ((void *)0))=-1, t497={5:0}, t498={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t499; [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t499, ((void *)0), P2, ((void *)0))=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 843]: 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: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 13 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: 17.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 779 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 259 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 217 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1487 IncrementalHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 42 mSDtfsCounter, 1487 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=9, InterpolantAutomatonStates: 63, 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.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 1030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 [2022-11-23 01:59:38,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS --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 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 01:59:41,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:59:41,085 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:59:41,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:59:41,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:59:41,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:59:41,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:59:41,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:59:41,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:59:41,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:59:41,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:59:41,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:59:41,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:59:41,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:59:41,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:59:41,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:59:41,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:59:41,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:59:41,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:59:41,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:59:41,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:59:41,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:59:41,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:59:41,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:59:41,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:59:41,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:59:41,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:59:41,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:59:41,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:59:41,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:59:41,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:59:41,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:59:41,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:59:41,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:59:41,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:59:41,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:59:41,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:59:41,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:59:41,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:59:41,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:59:41,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:59:41,178 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-23 01:59:41,199 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:59:41,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:59:41,200 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:59:41,200 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:59:41,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 01:59:41,201 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 01:59:41,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:59:41,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:59:41,203 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:59:41,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:59:41,203 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 01:59:41,204 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 01:59:41,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:59:41,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 01:59:41,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:59:41,205 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 01:59:41,205 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 01:59:41,205 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 01:59:41,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 01:59:41,206 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 01:59:41,206 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 01:59:41,206 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 01:59:41,207 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 01:59:41,207 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:59:41,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:59:41,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:59:41,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 01:59:41,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:59:41,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:59:41,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 01:59:41,209 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 01:59:41,209 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 01:59:41,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 01:59:41,210 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 01:59:41,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 01:59:41,210 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 01:59:41,210 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS 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 -> 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 [2022-11-23 01:59:41,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:59:41,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:59:41,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:59:41,636 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:59:41,637 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:59:41,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 01:59:44,864 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:59:45,197 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:59:45,198 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 01:59:45,217 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/data/3fe98ee67/cd5c1050841d43f8892adc298678fd30/FLAG76fd7480a [2022-11-23 01:59:45,238 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/data/3fe98ee67/cd5c1050841d43f8892adc298678fd30 [2022-11-23 01:59:45,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:59:45,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:59:45,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:59:45,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:59:45,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:59:45,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:45" (1/1) ... [2022-11-23 01:59:45,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b6458c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45, skipping insertion in model container [2022-11-23 01:59:45,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:45" (1/1) ... [2022-11-23 01:59:45,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:59:45,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:59:45,568 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-23 01:59:45,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:59:45,871 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:59:45,886 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-23 01:59:45,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:59:45,958 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:59:45,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45 WrapperNode [2022-11-23 01:59:45,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:59:45,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:59:45,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:59:45,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:59:45,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45" (1/1) ... [2022-11-23 01:59:46,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45" (1/1) ... [2022-11-23 01:59:46,049 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-11-23 01:59:46,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:59:46,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:59:46,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:59:46,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:59:46,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45" (1/1) ... [2022-11-23 01:59:46,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45" (1/1) ... [2022-11-23 01:59:46,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45" (1/1) ... [2022-11-23 01:59:46,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45" (1/1) ... [2022-11-23 01:59:46,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45" (1/1) ... [2022-11-23 01:59:46,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45" (1/1) ... [2022-11-23 01:59:46,105 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45" (1/1) ... [2022-11-23 01:59:46,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45" (1/1) ... [2022-11-23 01:59:46,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:59:46,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:59:46,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:59:46,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:59:46,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45" (1/1) ... [2022-11-23 01:59:46,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:59:46,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:59:46,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 01:59:46,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 01:59:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 01:59:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 01:59:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 01:59:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 01:59:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 01:59:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 01:59:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 01:59:46,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 01:59:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 01:59:46,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 01:59:46,247 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 01:59:46,247 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 01:59:46,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 01:59:46,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:59:46,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:59:46,249 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 01:59:46,406 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:59:46,408 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:59:46,863 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:59:47,048 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:59:47,053 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 01:59:47,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:47 BoogieIcfgContainer [2022-11-23 01:59:47,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:59:47,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 01:59:47,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 01:59:47,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 01:59:47,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:59:45" (1/3) ... [2022-11-23 01:59:47,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec198fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:59:47, skipping insertion in model container [2022-11-23 01:59:47,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:45" (2/3) ... [2022-11-23 01:59:47,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec198fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:59:47, skipping insertion in model container [2022-11-23 01:59:47,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:47" (3/3) ... [2022-11-23 01:59:47,067 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 01:59:47,085 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 01:59:47,086 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-23 01:59:47,086 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 01:59:47,184 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 01:59:47,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 128 transitions, 271 flow [2022-11-23 01:59:47,325 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-11-23 01:59:47,325 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:47,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-23 01:59:47,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 128 transitions, 271 flow [2022-11-23 01:59:47,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 125 transitions, 259 flow [2022-11-23 01:59:47,343 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 01:59:47,365 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 125 transitions, 259 flow [2022-11-23 01:59:47,370 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 125 transitions, 259 flow [2022-11-23 01:59:47,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 259 flow [2022-11-23 01:59:47,422 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-11-23 01:59:47,422 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:47,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-23 01:59:47,427 INFO L119 LiptonReduction]: Number of co-enabled transitions 2422 [2022-11-23 01:59:55,621 INFO L134 LiptonReduction]: Checked pairs total: 6273 [2022-11-23 01:59:55,621 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-11-23 01:59:55,647 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 01:59:55,655 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;@55d7a338, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 01:59:55,656 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-23 01:59:55,657 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-23 01:59:55,658 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:55,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:55,659 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 01:59:55,659 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash 546, now seen corresponding path program 1 times [2022-11-23 01:59:55,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:55,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117376491] [2022-11-23 01:59:55,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:55,687 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 [2022-11-23 01:59:55,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:55,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 01:59:55,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 01:59:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:55,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 01:59:55,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:55,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:59:55,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 01:59:55,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117376491] [2022-11-23 01:59:55,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117376491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:55,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:55,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 01:59:55,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310678176] [2022-11-23 01:59:55,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:55,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 01:59:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 01:59:55,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 01:59:55,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 01:59:55,845 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 248 [2022-11-23 01:59:55,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 115.5) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:55,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:55,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 248 [2022-11-23 01:59:55,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:56,526 INFO L130 PetriNetUnfolder]: 1616/2388 cut-off events. [2022-11-23 01:59:56,527 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-23 01:59:56,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4812 conditions, 2388 events. 1616/2388 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11407 event pairs, 1616 based on Foata normal form. 0/2013 useless extension candidates. Maximal degree in co-relation 4801. Up to 2368 conditions per place. [2022-11-23 01:59:56,551 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2022-11-23 01:59:56,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2022-11-23 01:59:56,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 01:59:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 01:59:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 260 transitions. [2022-11-23 01:59:56,574 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5241935483870968 [2022-11-23 01:59:56,575 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 260 transitions. [2022-11-23 01:59:56,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 260 transitions. [2022-11-23 01:59:56,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:56,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 260 transitions. [2022-11-23 01:59:56,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 130.0) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:56,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:56,596 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:56,598 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 260 transitions. [2022-11-23 01:59:56,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2022-11-23 01:59:56,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 01:59:56,607 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2022-11-23 01:59:56,609 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2022-11-23 01:59:56,613 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2022-11-23 01:59:56,613 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2022-11-23 01:59:56,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 115.5) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:56,614 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:56,614 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 01:59:56,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 01:59:56,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 01:59:56,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:56,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash 536362, now seen corresponding path program 1 times [2022-11-23 01:59:56,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:56,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640567595] [2022-11-23 01:59:56,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:56,826 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 [2022-11-23 01:59:56,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:56,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 01:59:56,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 01:59:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:56,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 01:59:56,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:56,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:59:56,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 01:59:56,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640567595] [2022-11-23 01:59:56,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640567595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:56,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:56,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 01:59:56,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464554276] [2022-11-23 01:59:56,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:56,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:59:56,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 01:59:56,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:59:56,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:59:56,950 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 248 [2022-11-23 01:59:56,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:56,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:56,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 248 [2022-11-23 01:59:56,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:57,376 INFO L130 PetriNetUnfolder]: 1263/2018 cut-off events. [2022-11-23 01:59:57,377 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:57,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 2018 events. 1263/2018 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11136 event pairs, 204 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 3924. Up to 1510 conditions per place. [2022-11-23 01:59:57,388 INFO L137 encePairwiseOnDemand]: 245/248 looper letters, 35 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2022-11-23 01:59:57,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 172 flow [2022-11-23 01:59:57,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:59:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:59:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-11-23 01:59:57,392 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5134408602150538 [2022-11-23 01:59:57,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2022-11-23 01:59:57,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2022-11-23 01:59:57,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:57,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2022-11-23 01:59:57,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:57,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:57,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:57,398 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 382 transitions. [2022-11-23 01:59:57,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 172 flow [2022-11-23 01:59:57,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 01:59:57,400 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2022-11-23 01:59:57,400 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, 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=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-11-23 01:59:57,402 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2022-11-23 01:59:57,402 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2022-11-23 01:59:57,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:57,402 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:57,403 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:57,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 01:59:57,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 01:59:57,614 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:57,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:57,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2013006867, now seen corresponding path program 1 times [2022-11-23 01:59:57,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:57,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448432058] [2022-11-23 01:59:57,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:57,615 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 [2022-11-23 01:59:57,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:57,617 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 01:59:57,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 01:59:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:57,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 01:59:57,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:57,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:59:57,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 01:59:57,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448432058] [2022-11-23 01:59:57,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448432058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:57,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:57,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 01:59:57,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195030316] [2022-11-23 01:59:57,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:57,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:59:57,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 01:59:57,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:59:57,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:59:57,805 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 248 [2022-11-23 01:59:57,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 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) [2022-11-23 01:59:57,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:57,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 248 [2022-11-23 01:59:57,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:58,117 INFO L130 PetriNetUnfolder]: 679/1114 cut-off events. [2022-11-23 01:59:58,118 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-11-23 01:59:58,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 1114 events. 679/1114 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5442 event pairs, 145 based on Foata normal form. 80/1136 useless extension candidates. Maximal degree in co-relation 2347. Up to 601 conditions per place. [2022-11-23 01:59:58,124 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 40 selfloop transitions, 5 changer transitions 1/49 dead transitions. [2022-11-23 01:59:58,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 49 transitions, 208 flow [2022-11-23 01:59:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 01:59:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 01:59:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2022-11-23 01:59:58,127 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4879032258064516 [2022-11-23 01:59:58,127 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2022-11-23 01:59:58,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2022-11-23 01:59:58,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:58,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2022-11-23 01:59:58,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:58,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:58,132 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:58,132 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 4 states and 484 transitions. [2022-11-23 01:59:58,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 49 transitions, 208 flow [2022-11-23 01:59:58,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 01:59:58,134 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 88 flow [2022-11-23 01:59:58,134 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2022-11-23 01:59:58,135 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2022-11-23 01:59:58,135 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 88 flow [2022-11-23 01:59:58,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 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) [2022-11-23 01:59:58,136 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:58,136 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:58,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 01:59:58,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 01:59:58,348 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:58,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:58,349 INFO L85 PathProgramCache]: Analyzing trace with hash -770400243, now seen corresponding path program 1 times [2022-11-23 01:59:58,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:58,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797639564] [2022-11-23 01:59:58,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:58,350 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 [2022-11-23 01:59:58,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:58,351 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 01:59:58,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 01:59:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:58,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 01:59:58,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:58,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:59:58,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 01:59:58,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797639564] [2022-11-23 01:59:58,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797639564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:58,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:58,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:59:58,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707324482] [2022-11-23 01:59:58,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:58,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:59:58,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 01:59:58,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:59:58,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:59:58,555 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 248 [2022-11-23 01:59:58,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:58,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:58,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 248 [2022-11-23 01:59:58,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:58,812 INFO L130 PetriNetUnfolder]: 274/508 cut-off events. [2022-11-23 01:59:58,813 INFO L131 PetriNetUnfolder]: For 167/167 co-relation queries the response was YES. [2022-11-23 01:59:58,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 508 events. 274/508 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2188 event pairs, 68 based on Foata normal form. 44/536 useless extension candidates. Maximal degree in co-relation 1314. Up to 194 conditions per place. [2022-11-23 01:59:58,816 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 49 selfloop transitions, 8 changer transitions 1/61 dead transitions. [2022-11-23 01:59:58,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 61 transitions, 293 flow [2022-11-23 01:59:58,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:59:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:59:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-11-23 01:59:58,819 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4879032258064516 [2022-11-23 01:59:58,819 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2022-11-23 01:59:58,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2022-11-23 01:59:58,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:58,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2022-11-23 01:59:58,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:58,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:58,825 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:58,825 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 88 flow. Second operand 5 states and 605 transitions. [2022-11-23 01:59:58,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 61 transitions, 293 flow [2022-11-23 01:59:58,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 61 transitions, 283 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-23 01:59:58,829 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 128 flow [2022-11-23 01:59:58,829 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-11-23 01:59:58,830 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2022-11-23 01:59:58,830 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 128 flow [2022-11-23 01:59:58,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:58,831 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:58,831 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:58,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 01:59:59,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 01:59:59,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:59,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -73931753, now seen corresponding path program 1 times [2022-11-23 01:59:59,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:59,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904301569] [2022-11-23 01:59:59,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:59,045 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 [2022-11-23 01:59:59,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:59,047 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 01:59:59,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 01:59:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:59,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 01:59:59,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:59,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:59:59,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 01:59:59,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904301569] [2022-11-23 01:59:59,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904301569] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:59,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:59,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:59:59,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007224668] [2022-11-23 01:59:59,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:59,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:59:59,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 01:59:59,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:59:59,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:59:59,289 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 248 [2022-11-23 01:59:59,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:59,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:59,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 248 [2022-11-23 01:59:59,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:59,573 INFO L130 PetriNetUnfolder]: 168/319 cut-off events. [2022-11-23 01:59:59,573 INFO L131 PetriNetUnfolder]: For 298/298 co-relation queries the response was YES. [2022-11-23 01:59:59,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 319 events. 168/319 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1247 event pairs, 68 based on Foata normal form. 11/324 useless extension candidates. Maximal degree in co-relation 918. Up to 129 conditions per place. [2022-11-23 01:59:59,575 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 36 selfloop transitions, 11 changer transitions 1/51 dead transitions. [2022-11-23 01:59:59,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 276 flow [2022-11-23 01:59:59,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:59:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 01:59:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions. [2022-11-23 01:59:59,579 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2022-11-23 01:59:59,579 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 704 transitions. [2022-11-23 01:59:59,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 704 transitions. [2022-11-23 01:59:59,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:59,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 704 transitions. [2022-11-23 01:59:59,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:59,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:59,585 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:59,585 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 128 flow. Second operand 6 states and 704 transitions. [2022-11-23 01:59:59,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 276 flow [2022-11-23 01:59:59,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 251 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-23 01:59:59,589 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 142 flow [2022-11-23 01:59:59,590 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-11-23 01:59:59,590 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-11-23 01:59:59,591 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 142 flow [2022-11-23 01:59:59,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:59,591 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:59,591 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:59,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 01:59:59,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 01:59:59,804 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 01:59:59,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2118109170, now seen corresponding path program 1 times [2022-11-23 01:59:59,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:59,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588036452] [2022-11-23 01:59:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:59,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 01:59:59,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:59,807 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 01:59:59,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 01:59:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:59,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 01:59:59,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:00:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:00:00,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:00:00,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:00:00,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588036452] [2022-11-23 02:00:00,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588036452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:00:00,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:00:00,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:00:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044069636] [2022-11-23 02:00:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:00:00,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:00:00,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:00:00,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:00:00,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:00:00,357 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2022-11-23 02:00:00,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 142 flow. Second operand has 8 states, 8 states have (on average 110.5) internal successors, (884), 8 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:00,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:00:00,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2022-11-23 02:00:00,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:00:00,741 INFO L130 PetriNetUnfolder]: 181/369 cut-off events. [2022-11-23 02:00:00,741 INFO L131 PetriNetUnfolder]: For 400/400 co-relation queries the response was YES. [2022-11-23 02:00:00,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 369 events. 181/369 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1621 event pairs, 17 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1066. Up to 147 conditions per place. [2022-11-23 02:00:00,744 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 62 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2022-11-23 02:00:00,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 492 flow [2022-11-23 02:00:00,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:00:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 02:00:00,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 918 transitions. [2022-11-23 02:00:00,748 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4627016129032258 [2022-11-23 02:00:00,748 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 918 transitions. [2022-11-23 02:00:00,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 918 transitions. [2022-11-23 02:00:00,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:00:00,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 918 transitions. [2022-11-23 02:00:00,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:00,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:00,755 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:00,755 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 142 flow. Second operand 8 states and 918 transitions. [2022-11-23 02:00:00,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 492 flow [2022-11-23 02:00:00,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 72 transitions, 346 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-11-23 02:00:00,760 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 116 flow [2022-11-23 02:00:00,760 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=116, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-11-23 02:00:00,761 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2022-11-23 02:00:00,761 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 116 flow [2022-11-23 02:00:00,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.5) internal successors, (884), 8 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:00,762 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:00:00,762 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:00:00,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-23 02:00:00,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:00:00,979 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 02:00:00,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:00:00,980 INFO L85 PathProgramCache]: Analyzing trace with hash -209099614, now seen corresponding path program 2 times [2022-11-23 02:00:00,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:00:00,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320343772] [2022-11-23 02:00:00,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:00:00,981 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 [2022-11-23 02:00:00,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:00:00,982 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:00:00,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:00:01,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 02:00:01,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:00:01,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:00:01,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:00:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:00:01,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:00:01,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:00:01,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320343772] [2022-11-23 02:00:01,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320343772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:00:01,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:00:01,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:00:01,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775349571] [2022-11-23 02:00:01,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:00:01,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:00:01,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:00:01,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:00:01,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:00:01,184 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 248 [2022-11-23 02:00:01,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:01,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:00:01,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 248 [2022-11-23 02:00:01,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:00:01,409 INFO L130 PetriNetUnfolder]: 318/613 cut-off events. [2022-11-23 02:00:01,409 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-11-23 02:00:01,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 613 events. 318/613 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2991 event pairs, 121 based on Foata normal form. 1/605 useless extension candidates. Maximal degree in co-relation 1567. Up to 334 conditions per place. [2022-11-23 02:00:01,413 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 53 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2022-11-23 02:00:01,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 323 flow [2022-11-23 02:00:01,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:00:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:00:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2022-11-23 02:00:01,415 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4879032258064516 [2022-11-23 02:00:01,415 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2022-11-23 02:00:01,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2022-11-23 02:00:01,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:00:01,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2022-11-23 02:00:01,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:01,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:01,419 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:01,419 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 116 flow. Second operand 4 states and 484 transitions. [2022-11-23 02:00:01,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 323 flow [2022-11-23 02:00:01,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 315 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 02:00:01,422 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 144 flow [2022-11-23 02:00:01,423 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2022-11-23 02:00:01,423 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-11-23 02:00:01,423 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 144 flow [2022-11-23 02:00:01,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:01,424 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:00:01,424 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:00:01,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:00:01,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:00:01,649 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 02:00:01,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:00:01,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1814870254, now seen corresponding path program 1 times [2022-11-23 02:00:01,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:00:01,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677273872] [2022-11-23 02:00:01,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:00:01,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:00:01,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:00:01,652 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:00:01,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:00:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:00:01,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 02:00:01,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:00:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:00:02,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:00:02,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:00:02,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677273872] [2022-11-23 02:00:02,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677273872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:00:02,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:00:02,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:00:02,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191126023] [2022-11-23 02:00:02,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:00:02,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:00:02,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:00:02,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:00:02,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:00:02,582 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 248 [2022-11-23 02:00:02,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:02,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:00:02,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 248 [2022-11-23 02:00:02,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:00:02,890 INFO L130 PetriNetUnfolder]: 278/542 cut-off events. [2022-11-23 02:00:02,890 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-11-23 02:00:02,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 542 events. 278/542 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2534 event pairs, 103 based on Foata normal form. 4/546 useless extension candidates. Maximal degree in co-relation 1445. Up to 464 conditions per place. [2022-11-23 02:00:02,893 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 28 selfloop transitions, 3 changer transitions 13/47 dead transitions. [2022-11-23 02:00:02,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 273 flow [2022-11-23 02:00:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:00:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:00:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-11-23 02:00:02,896 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42338709677419356 [2022-11-23 02:00:02,896 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2022-11-23 02:00:02,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2022-11-23 02:00:02,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:00:02,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2022-11-23 02:00:02,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:02,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:02,901 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:02,901 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 144 flow. Second operand 5 states and 525 transitions. [2022-11-23 02:00:02,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 273 flow [2022-11-23 02:00:02,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:00:02,903 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 106 flow [2022-11-23 02:00:02,903 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2022-11-23 02:00:02,904 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2022-11-23 02:00:02,904 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 106 flow [2022-11-23 02:00:02,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:02,905 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:00:02,905 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:00:02,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-23 02:00:03,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:00:03,119 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 02:00:03,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:00:03,124 INFO L85 PathProgramCache]: Analyzing trace with hash 520969532, now seen corresponding path program 3 times [2022-11-23 02:00:03,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:00:03,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542329493] [2022-11-23 02:00:03,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:00:03,125 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 [2022-11-23 02:00:03,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:00:03,126 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:00:03,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-23 02:00:03,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 02:00:03,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 02:00:03,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:00:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:00:03,467 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-23 02:00:03,468 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:00:03,469 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-23 02:00:03,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-23 02:00:03,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-23 02:00:03,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-23 02:00:03,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-23 02:00:03,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-23 02:00:03,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-23 02:00:03,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-23 02:00:03,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-23 02:00:03,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-23 02:00:03,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-23 02:00:03,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-23 02:00:03,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-23 02:00:03,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-23 02:00:03,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:00:03,687 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-11-23 02:00:03,698 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:00:03,699 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:00:03,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:00:03 BasicIcfg [2022-11-23 02:00:03,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:00:03,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:00:03,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:00:03,849 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:00:03,849 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:47" (3/4) ... [2022-11-23 02:00:03,852 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 02:00:03,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:00:03,858 INFO L158 Benchmark]: Toolchain (without parser) took 18608.53ms. Allocated memory was 67.1MB in the beginning and 176.2MB in the end (delta: 109.1MB). Free memory was 35.7MB in the beginning and 133.3MB in the end (delta: -97.6MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2022-11-23 02:00:03,859 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 67.1MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:00:03,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 710.96ms. Allocated memory is still 67.1MB. Free memory was 35.5MB in the beginning and 33.1MB in the end (delta: 2.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-11-23 02:00:03,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.34ms. Allocated memory is still 67.1MB. Free memory was 33.1MB in the beginning and 30.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 02:00:03,860 INFO L158 Benchmark]: Boogie Preprocessor took 69.58ms. Allocated memory is still 67.1MB. Free memory was 30.5MB in the beginning and 28.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:00:03,860 INFO L158 Benchmark]: RCFGBuilder took 935.03ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 28.4MB in the beginning and 45.1MB in the end (delta: -16.7MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-11-23 02:00:03,861 INFO L158 Benchmark]: TraceAbstraction took 16789.04ms. Allocated memory was 83.9MB in the beginning and 176.2MB in the end (delta: 92.3MB). Free memory was 44.7MB in the beginning and 133.3MB in the end (delta: -88.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2022-11-23 02:00:03,861 INFO L158 Benchmark]: Witness Printer took 4.70ms. Allocated memory is still 176.2MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:00:03,863 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.29ms. Allocated memory is still 67.1MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 710.96ms. Allocated memory is still 67.1MB. Free memory was 35.5MB in the beginning and 33.1MB in the end (delta: 2.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.34ms. Allocated memory is still 67.1MB. Free memory was 33.1MB in the beginning and 30.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.58ms. Allocated memory is still 67.1MB. Free memory was 30.5MB in the beginning and 28.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 935.03ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 28.4MB in the beginning and 45.1MB in the end (delta: -16.7MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16789.04ms. Allocated memory was 83.9MB in the beginning and 176.2MB in the end (delta: 92.3MB). Free memory was 44.7MB in the beginning and 133.3MB in the end (delta: -88.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Witness Printer took 4.70ms. Allocated memory is still 176.2MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3s, 133 PlacesBefore, 42 PlacesAfterwards, 125 TransitionsBefore, 33 TransitionsAfterwards, 2422 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 6273 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3108, independent: 2944, independent conditional: 0, independent unconditional: 2944, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1658, independent: 1611, independent conditional: 0, independent unconditional: 1611, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1658, independent: 1593, independent conditional: 0, independent unconditional: 1593, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 428, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 374, dependent conditional: 0, dependent unconditional: 374, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3108, independent: 1333, independent conditional: 0, independent unconditional: 1333, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 1658, unknown conditional: 0, unknown unconditional: 1658] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 177, Positive conditional cache size: 0, Positive unconditional cache size: 177, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t497; [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t497, ((void *)0), P0, ((void *)0))=-1, t497={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t498; [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t498, ((void *)0), P1, ((void *)0))=0, t497={3:0}, t498={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 2 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t499; [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t499, ((void *)0), P2, ((void *)0))=1, t497={3:0}, t498={7:0}, t499={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={3:0}, t498={7:0}, t499={15:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={3:0}, t498={7:0}, t499={15:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 843]: 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: 841]: 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: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 13 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: 16.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 944 IncrementalHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 6 mSDtfsCounter, 944 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=7, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 107 ConstructedInterpolants, 14 QuantifiedInterpolants, 1073 SizeOfPredicates, 16 NumberOfNonLiveVariables, 960 ConjunctsInSsa, 57 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 [2022-11-23 02:00:03,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac24e6d1-9512-4e34-843f-457e2816668f/bin/uautomizer-QkZJyEgLgS/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