./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042.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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea --- 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:58:27,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:58:27,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:58:27,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:58:27,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:58:27,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:58:27,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:58:27,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:58:27,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:58:27,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:58:27,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:58:27,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:58:27,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:58:27,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:58:27,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:58:27,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:58:27,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:58:27,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:58:27,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:58:27,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:58:27,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:58:27,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:58:27,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:58:27,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:58:27,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:58:27,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:58:27,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:58:27,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:58:27,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:58:27,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:58:27,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:58:27,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:58:27,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:58:27,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:58:27,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:58:27,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:58:27,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:58:27,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:58:27,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:58:27,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:58:27,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:58:27,262 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 01:58:27,311 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:58:27,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:58:27,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:58:27,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:58:27,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 01:58:27,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 01:58:27,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:58:27,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:58:27,315 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:58:27,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:58:27,317 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 01:58:27,317 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 01:58:27,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:58:27,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 01:58:27,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:58:27,318 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 01:58:27,318 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 01:58:27,318 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 01:58:27,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 01:58:27,319 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 01:58:27,319 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 01:58:27,319 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:58:27,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:58:27,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:58:27,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 01:58:27,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:58:27,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:58:27,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 01:58:27,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 01:58:27,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 01:58:27,322 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 01:58:27,322 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 01:58:27,322 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 01:58:27,323 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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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 -> 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea [2022-11-23 01:58:27,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:58:27,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:58:27,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:58:27,723 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:58:27,724 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:58:27,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-11-23 01:58:31,086 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:58:31,429 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:58:31,429 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-11-23 01:58:31,456 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/data/ab12efa77/250a1866e09647a6808de850054f33f6/FLAGab2530434 [2022-11-23 01:58:31,473 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/data/ab12efa77/250a1866e09647a6808de850054f33f6 [2022-11-23 01:58:31,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:58:31,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:58:31,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:58:31,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:58:31,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:58:31,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:58:31" (1/1) ... [2022-11-23 01:58:31,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9194b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:31, skipping insertion in model container [2022-11-23 01:58:31,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:58:31" (1/1) ... [2022-11-23 01:58:31,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:58:31,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:58:31,769 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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-11-23 01:58:32,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:58:32,074 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:58:32,097 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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-11-23 01:58:32,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:58:32,209 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:58:32,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:32 WrapperNode [2022-11-23 01:58:32,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:58:32,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:58:32,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:58:32,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:58:32,220 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:58:32" (1/1) ... [2022-11-23 01:58:32,259 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:58:32" (1/1) ... [2022-11-23 01:58:32,308 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-11-23 01:58:32,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:58:32,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:58:32,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:58:32,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:58:32,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:32" (1/1) ... [2022-11-23 01:58:32,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:32" (1/1) ... [2022-11-23 01:58:32,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:32" (1/1) ... [2022-11-23 01:58:32,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:32" (1/1) ... [2022-11-23 01:58:32,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:32" (1/1) ... [2022-11-23 01:58:32,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:32" (1/1) ... [2022-11-23 01:58:32,354 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:32" (1/1) ... [2022-11-23 01:58:32,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:32" (1/1) ... [2022-11-23 01:58:32,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:58:32,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:58:32,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:58:32,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:58:32,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:32" (1/1) ... [2022-11-23 01:58:32,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:58:32,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:58:32,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 01:58:32,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 01:58:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 01:58:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 01:58:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 01:58:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 01:58:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 01:58:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 01:58:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 01:58:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 01:58:32,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 01:58:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 01:58:32,466 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 01:58:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 01:58:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 01:58:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:58:32,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:58:32,469 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:58:32,663 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:58:32,665 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:58:33,131 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:58:33,299 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:58:33,299 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 01:58:33,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:58:33 BoogieIcfgContainer [2022-11-23 01:58:33,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:58:33,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 01:58:33,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 01:58:33,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 01:58:33,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:58:31" (1/3) ... [2022-11-23 01:58:33,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e260cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:58:33, skipping insertion in model container [2022-11-23 01:58:33,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:32" (2/3) ... [2022-11-23 01:58:33,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e260cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:58:33, skipping insertion in model container [2022-11-23 01:58:33,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:58:33" (3/3) ... [2022-11-23 01:58:33,313 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.oepc.i [2022-11-23 01:58:33,336 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 01:58:33,336 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-23 01:58:33,336 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 01:58:33,404 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 01:58:33,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 129 transitions, 273 flow [2022-11-23 01:58:33,562 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-11-23 01:58:33,563 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:58:33,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-23 01:58:33,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 129 transitions, 273 flow [2022-11-23 01:58:33,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 126 transitions, 261 flow [2022-11-23 01:58:33,585 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 01:58:33,602 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 126 transitions, 261 flow [2022-11-23 01:58:33,605 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 126 transitions, 261 flow [2022-11-23 01:58:33,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 261 flow [2022-11-23 01:58:33,639 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-11-23 01:58:33,640 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:58:33,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-23 01:58:33,643 INFO L119 LiptonReduction]: Number of co-enabled transitions 2524 [2022-11-23 01:58:40,298 INFO L134 LiptonReduction]: Checked pairs total: 6185 [2022-11-23 01:58:40,298 INFO L136 LiptonReduction]: Total number of compositions: 129 [2022-11-23 01:58:40,333 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 01:58:40,346 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;@7524fcef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 01:58:40,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-23 01:58:40,352 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 01:58:40,353 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:58:40,354 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:40,355 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 01:58:40,356 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:58:40,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:40,366 INFO L85 PathProgramCache]: Analyzing trace with hash 558, now seen corresponding path program 1 times [2022-11-23 01:58:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:40,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102006107] [2022-11-23 01:58:40,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:40,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:40,523 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:58:40,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:40,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102006107] [2022-11-23 01:58:40,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102006107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:40,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:40,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 01:58:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042533003] [2022-11-23 01:58:40,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:40,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 01:58:40,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:40,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 01:58:40,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 01:58:40,572 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 258 [2022-11-23 01:58:40,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 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:58:40,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:40,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 258 [2022-11-23 01:58:40,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:41,111 INFO L130 PetriNetUnfolder]: 1616/2402 cut-off events. [2022-11-23 01:58:41,111 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-23 01:58:41,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4826 conditions, 2402 events. 1616/2402 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 11513 event pairs, 1616 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 4815. Up to 2368 conditions per place. [2022-11-23 01:58:41,133 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2022-11-23 01:58:41,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2022-11-23 01:58:41,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 01:58:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 01:58:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 262 transitions. [2022-11-23 01:58:41,160 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5077519379844961 [2022-11-23 01:58:41,160 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 262 transitions. [2022-11-23 01:58:41,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 262 transitions. [2022-11-23 01:58:41,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:41,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 262 transitions. [2022-11-23 01:58:41,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 131.0) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:41,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 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:58:41,182 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 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:58:41,185 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 262 transitions. [2022-11-23 01:58:41,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2022-11-23 01:58:41,192 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:58:41,194 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2022-11-23 01:58:41,196 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, 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:58:41,200 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2022-11-23 01:58:41,201 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2022-11-23 01:58:41,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 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:58:41,201 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:41,201 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 01:58:41,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 01:58:41,203 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:58:41,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:41,205 INFO L85 PathProgramCache]: Analyzing trace with hash 547994, now seen corresponding path program 1 times [2022-11-23 01:58:41,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:41,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518032027] [2022-11-23 01:58:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:41,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:41,629 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:58:41,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:41,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518032027] [2022-11-23 01:58:41,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518032027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:41,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:41,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 01:58:41,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132113778] [2022-11-23 01:58:41,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:41,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:58:41,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:41,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:58:41,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:58:41,638 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 258 [2022-11-23 01:58:41,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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:58:41,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:41,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 258 [2022-11-23 01:58:41,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:42,087 INFO L130 PetriNetUnfolder]: 1263/1905 cut-off events. [2022-11-23 01:58:42,088 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:58:42,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3814 conditions, 1905 events. 1263/1905 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8907 event pairs, 562 based on Foata normal form. 0/1739 useless extension candidates. Maximal degree in co-relation 3811. Up to 1510 conditions per place. [2022-11-23 01:58:42,099 INFO L137 encePairwiseOnDemand]: 255/258 looper letters, 35 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2022-11-23 01:58:42,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 172 flow [2022-11-23 01:58:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:58:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:58:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2022-11-23 01:58:42,103 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4974160206718346 [2022-11-23 01:58:42,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2022-11-23 01:58:42,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2022-11-23 01:58:42,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:42,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2022-11-23 01:58:42,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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:58:42,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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:58:42,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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:58:42,111 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 385 transitions. [2022-11-23 01:58:42,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 172 flow [2022-11-23 01:58:42,112 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:58:42,114 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2022-11-23 01:58:42,115 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, 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:58:42,116 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2022-11-23 01:58:42,116 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2022-11-23 01:58:42,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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:58:42,117 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:42,117 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:58:42,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 01:58:42,118 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:58:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:42,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1043844789, now seen corresponding path program 1 times [2022-11-23 01:58:42,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:42,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133684926] [2022-11-23 01:58:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:42,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:42,473 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:58:42,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:42,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133684926] [2022-11-23 01:58:42,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133684926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:42,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:42,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 01:58:42,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372508581] [2022-11-23 01:58:42,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:42,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:58:42,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:42,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:58:42,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:58:42,513 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 258 [2022-11-23 01:58:42,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 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:58:42,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:42,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 258 [2022-11-23 01:58:42,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:43,660 INFO L130 PetriNetUnfolder]: 4019/5940 cut-off events. [2022-11-23 01:58:43,660 INFO L131 PetriNetUnfolder]: For 356/356 co-relation queries the response was YES. [2022-11-23 01:58:43,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12322 conditions, 5940 events. 4019/5940 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 30966 event pairs, 1057 based on Foata normal form. 0/5716 useless extension candidates. Maximal degree in co-relation 12318. Up to 3014 conditions per place. [2022-11-23 01:58:43,705 INFO L137 encePairwiseOnDemand]: 250/258 looper letters, 62 selfloop transitions, 12 changer transitions 0/74 dead transitions. [2022-11-23 01:58:43,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 74 transitions, 316 flow [2022-11-23 01:58:43,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:58:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:58:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-11-23 01:58:43,708 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47364341085271316 [2022-11-23 01:58:43,708 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 611 transitions. [2022-11-23 01:58:43,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 611 transitions. [2022-11-23 01:58:43,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:43,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 611 transitions. [2022-11-23 01:58:43,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 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:58:43,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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:58:43,715 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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:58:43,716 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 611 transitions. [2022-11-23 01:58:43,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 74 transitions, 316 flow [2022-11-23 01:58:43,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 74 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 01:58:43,718 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 150 flow [2022-11-23 01:58:43,719 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, 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:58:43,720 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-11-23 01:58:43,720 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 150 flow [2022-11-23 01:58:43,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 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:58:43,721 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:43,721 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:58:43,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 01:58:43,721 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:58:43,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:43,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1043844741, now seen corresponding path program 1 times [2022-11-23 01:58:43,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:43,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351142060] [2022-11-23 01:58:43,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:44,155 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:58:44,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:44,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351142060] [2022-11-23 01:58:44,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351142060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:44,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:44,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 01:58:44,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532044268] [2022-11-23 01:58:44,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:44,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:58:44,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:44,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:58:44,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:58:44,271 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 258 [2022-11-23 01:58:44,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 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:58:44,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:44,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 258 [2022-11-23 01:58:44,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:45,059 INFO L130 PetriNetUnfolder]: 2233/3538 cut-off events. [2022-11-23 01:58:45,059 INFO L131 PetriNetUnfolder]: For 1527/1595 co-relation queries the response was YES. [2022-11-23 01:58:45,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9030 conditions, 3538 events. 2233/3538 cut-off events. For 1527/1595 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 19717 event pairs, 794 based on Foata normal form. 396/3875 useless extension candidates. Maximal degree in co-relation 9023. Up to 3163 conditions per place. [2022-11-23 01:58:45,089 INFO L137 encePairwiseOnDemand]: 254/258 looper letters, 28 selfloop transitions, 3 changer transitions 6/43 dead transitions. [2022-11-23 01:58:45,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 234 flow [2022-11-23 01:58:45,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:58:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:58:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-11-23 01:58:45,092 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2022-11-23 01:58:45,093 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2022-11-23 01:58:45,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2022-11-23 01:58:45,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:45,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2022-11-23 01:58:45,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:45,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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:58:45,100 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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:58:45,100 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 150 flow. Second operand 5 states and 540 transitions. [2022-11-23 01:58:45,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 234 flow [2022-11-23 01:58:45,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 01:58:45,104 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 118 flow [2022-11-23 01:58:45,105 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-11-23 01:58:45,105 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2022-11-23 01:58:45,106 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 118 flow [2022-11-23 01:58:45,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 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:58:45,107 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:45,107 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:58:45,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 01:58:45,107 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:58:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:45,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1999594871, now seen corresponding path program 1 times [2022-11-23 01:58:45,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:45,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835532443] [2022-11-23 01:58:45,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:45,301 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:58:45,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:45,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835532443] [2022-11-23 01:58:45,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835532443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:45,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:45,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 01:58:45,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309782545] [2022-11-23 01:58:45,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:45,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:58:45,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:45,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:58:45,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:58:45,338 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 258 [2022-11-23 01:58:45,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 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:58:45,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:45,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 258 [2022-11-23 01:58:45,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:46,303 INFO L130 PetriNetUnfolder]: 2567/3892 cut-off events. [2022-11-23 01:58:46,303 INFO L131 PetriNetUnfolder]: For 2411/2411 co-relation queries the response was YES. [2022-11-23 01:58:46,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10264 conditions, 3892 events. 2567/3892 cut-off events. For 2411/2411 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 19272 event pairs, 582 based on Foata normal form. 224/4116 useless extension candidates. Maximal degree in co-relation 10256. Up to 1731 conditions per place. [2022-11-23 01:58:46,346 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 43 selfloop transitions, 6 changer transitions 34/83 dead transitions. [2022-11-23 01:58:46,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 83 transitions, 460 flow [2022-11-23 01:58:46,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 01:58:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 01:58:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2022-11-23 01:58:46,351 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4584717607973422 [2022-11-23 01:58:46,351 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2022-11-23 01:58:46,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2022-11-23 01:58:46,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:46,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2022-11-23 01:58:46,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 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:58:46,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 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:58:46,364 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 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:58:46,365 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 118 flow. Second operand 7 states and 828 transitions. [2022-11-23 01:58:46,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 83 transitions, 460 flow [2022-11-23 01:58:46,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 83 transitions, 417 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-11-23 01:58:46,389 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 145 flow [2022-11-23 01:58:46,390 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2022-11-23 01:58:46,393 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2022-11-23 01:58:46,393 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 145 flow [2022-11-23 01:58:46,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 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:58:46,394 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:46,394 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:58:46,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 01:58:46,395 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:58:46,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1857823134, now seen corresponding path program 1 times [2022-11-23 01:58:46,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:46,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50981371] [2022-11-23 01:58:46,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:46,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:46,641 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:58:46,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:46,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50981371] [2022-11-23 01:58:46,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50981371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:46,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:46,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 01:58:46,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523720384] [2022-11-23 01:58:46,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:46,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:58:46,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:46,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:58:46,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:58:46,661 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 258 [2022-11-23 01:58:46,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 145 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:58:46,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:46,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 258 [2022-11-23 01:58:46,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:47,109 INFO L130 PetriNetUnfolder]: 1105/1898 cut-off events. [2022-11-23 01:58:47,109 INFO L131 PetriNetUnfolder]: For 1129/1216 co-relation queries the response was YES. [2022-11-23 01:58:47,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4869 conditions, 1898 events. 1105/1898 cut-off events. For 1129/1216 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10591 event pairs, 261 based on Foata normal form. 183/2046 useless extension candidates. Maximal degree in co-relation 4857. Up to 833 conditions per place. [2022-11-23 01:58:47,123 INFO L137 encePairwiseOnDemand]: 252/258 looper letters, 46 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2022-11-23 01:58:47,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 338 flow [2022-11-23 01:58:47,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 01:58:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 01:58:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-11-23 01:58:47,126 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47189922480620156 [2022-11-23 01:58:47,126 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2022-11-23 01:58:47,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2022-11-23 01:58:47,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:47,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2022-11-23 01:58:47,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 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:58:47,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 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:58:47,131 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 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:58:47,131 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 145 flow. Second operand 4 states and 487 transitions. [2022-11-23 01:58:47,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 338 flow [2022-11-23 01:58:47,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 327 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-23 01:58:47,139 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 172 flow [2022-11-23 01:58:47,139 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2022-11-23 01:58:47,142 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-11-23 01:58:47,142 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 172 flow [2022-11-23 01:58:47,143 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:58:47,143 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:47,143 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:58:47,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 01:58:47,145 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:58:47,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash -843448458, now seen corresponding path program 1 times [2022-11-23 01:58:47,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:47,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035909889] [2022-11-23 01:58:47,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:47,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:47,482 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:58:47,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:47,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035909889] [2022-11-23 01:58:47,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035909889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:47,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:47,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:58:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919365023] [2022-11-23 01:58:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:47,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:58:47,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:47,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:58:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:58:47,504 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 258 [2022-11-23 01:58:47,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 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:58:47,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:47,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 258 [2022-11-23 01:58:47,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:47,910 INFO L130 PetriNetUnfolder]: 778/1406 cut-off events. [2022-11-23 01:58:47,910 INFO L131 PetriNetUnfolder]: For 918/964 co-relation queries the response was YES. [2022-11-23 01:58:47,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4265 conditions, 1406 events. 778/1406 cut-off events. For 918/964 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7849 event pairs, 243 based on Foata normal form. 98/1468 useless extension candidates. Maximal degree in co-relation 4252. Up to 551 conditions per place. [2022-11-23 01:58:47,920 INFO L137 encePairwiseOnDemand]: 252/258 looper letters, 58 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2022-11-23 01:58:47,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 449 flow [2022-11-23 01:58:47,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:58:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:58:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-11-23 01:58:47,923 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2022-11-23 01:58:47,923 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2022-11-23 01:58:47,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2022-11-23 01:58:47,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:47,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2022-11-23 01:58:47,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 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:58:47,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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:58:47,929 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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:58:47,930 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 172 flow. Second operand 5 states and 610 transitions. [2022-11-23 01:58:47,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 449 flow [2022-11-23 01:58:47,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 74 transitions, 442 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-23 01:58:47,935 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 220 flow [2022-11-23 01:58:47,935 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2022-11-23 01:58:47,937 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-11-23 01:58:47,937 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 220 flow [2022-11-23 01:58:47,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 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:58:47,938 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:47,938 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:58:47,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 01:58:47,939 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:58:47,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:47,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1571946752, now seen corresponding path program 1 times [2022-11-23 01:58:47,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:47,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058328329] [2022-11-23 01:58:47,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:48,723 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:58:48,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:48,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058328329] [2022-11-23 01:58:48,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058328329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:48,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:48,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:58:48,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406641972] [2022-11-23 01:58:48,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:48,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 01:58:48,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:48,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 01:58:48,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 01:58:48,770 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 258 [2022-11-23 01:58:48,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:48,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:48,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 258 [2022-11-23 01:58:48,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:49,472 INFO L130 PetriNetUnfolder]: 1223/2231 cut-off events. [2022-11-23 01:58:49,472 INFO L131 PetriNetUnfolder]: For 4521/4680 co-relation queries the response was YES. [2022-11-23 01:58:49,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7965 conditions, 2231 events. 1223/2231 cut-off events. For 4521/4680 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13984 event pairs, 187 based on Foata normal form. 16/2205 useless extension candidates. Maximal degree in co-relation 7952. Up to 947 conditions per place. [2022-11-23 01:58:49,489 INFO L137 encePairwiseOnDemand]: 250/258 looper letters, 69 selfloop transitions, 7 changer transitions 41/125 dead transitions. [2022-11-23 01:58:49,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 125 transitions, 949 flow [2022-11-23 01:58:49,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 01:58:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 01:58:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 948 transitions. [2022-11-23 01:58:49,493 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45930232558139533 [2022-11-23 01:58:49,493 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 948 transitions. [2022-11-23 01:58:49,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 948 transitions. [2022-11-23 01:58:49,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:49,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 948 transitions. [2022-11-23 01:58:49,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.5) internal successors, (948), 8 states have internal predecessors, (948), 0 states have call successors, (0), 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:58:49,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 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:58:49,504 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 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:58:49,505 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 220 flow. Second operand 8 states and 948 transitions. [2022-11-23 01:58:49,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 125 transitions, 949 flow [2022-11-23 01:58:49,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 125 transitions, 900 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-11-23 01:58:49,513 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 269 flow [2022-11-23 01:58:49,514 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=269, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2022-11-23 01:58:49,517 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2022-11-23 01:58:49,517 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 269 flow [2022-11-23 01:58:49,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:49,518 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:49,518 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:58:49,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 01:58:49,518 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:58:49,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash -787623926, now seen corresponding path program 2 times [2022-11-23 01:58:49,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:49,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838839760] [2022-11-23 01:58:49,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:49,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:49,870 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:58:49,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:49,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838839760] [2022-11-23 01:58:49,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838839760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:49,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:49,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:58:49,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128870861] [2022-11-23 01:58:49,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:49,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:58:49,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:49,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:58:49,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:58:49,895 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 258 [2022-11-23 01:58:49,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 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:58:49,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:49,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 258 [2022-11-23 01:58:49,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:50,379 INFO L130 PetriNetUnfolder]: 847/1582 cut-off events. [2022-11-23 01:58:50,379 INFO L131 PetriNetUnfolder]: For 2906/2970 co-relation queries the response was YES. [2022-11-23 01:58:50,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5925 conditions, 1582 events. 847/1582 cut-off events. For 2906/2970 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9596 event pairs, 226 based on Foata normal form. 34/1582 useless extension candidates. Maximal degree in co-relation 5908. Up to 673 conditions per place. [2022-11-23 01:58:50,394 INFO L137 encePairwiseOnDemand]: 252/258 looper letters, 51 selfloop transitions, 11 changer transitions 1/71 dead transitions. [2022-11-23 01:58:50,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 517 flow [2022-11-23 01:58:50,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:58:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 01:58:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 711 transitions. [2022-11-23 01:58:50,397 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45930232558139533 [2022-11-23 01:58:50,397 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 711 transitions. [2022-11-23 01:58:50,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 711 transitions. [2022-11-23 01:58:50,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:50,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 711 transitions. [2022-11-23 01:58:50,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 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:58:50,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 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:58:50,404 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 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:58:50,404 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 269 flow. Second operand 6 states and 711 transitions. [2022-11-23 01:58:50,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 517 flow [2022-11-23 01:58:50,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 505 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-23 01:58:50,412 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 292 flow [2022-11-23 01:58:50,412 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2022-11-23 01:58:50,413 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2022-11-23 01:58:50,413 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 292 flow [2022-11-23 01:58:50,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 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:58:50,414 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:50,414 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:58:50,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 01:58:50,415 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:58:50,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:50,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1643044882, now seen corresponding path program 1 times [2022-11-23 01:58:50,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:50,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941055676] [2022-11-23 01:58:50,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:50,677 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:58:50,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:50,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941055676] [2022-11-23 01:58:50,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941055676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:50,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:50,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:58:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521311683] [2022-11-23 01:58:50,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:50,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:58:50,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:50,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:58:50,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:58:50,711 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 258 [2022-11-23 01:58:50,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 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:58:50,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:50,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 258 [2022-11-23 01:58:50,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:51,426 INFO L130 PetriNetUnfolder]: 1742/2976 cut-off events. [2022-11-23 01:58:51,426 INFO L131 PetriNetUnfolder]: For 9100/9100 co-relation queries the response was YES. [2022-11-23 01:58:51,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12469 conditions, 2976 events. 1742/2976 cut-off events. For 9100/9100 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17359 event pairs, 283 based on Foata normal form. 1/2977 useless extension candidates. Maximal degree in co-relation 12453. Up to 1331 conditions per place. [2022-11-23 01:58:51,445 INFO L137 encePairwiseOnDemand]: 249/258 looper letters, 49 selfloop transitions, 9 changer transitions 63/121 dead transitions. [2022-11-23 01:58:51,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 121 transitions, 1055 flow [2022-11-23 01:58:51,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 01:58:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 01:58:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 811 transitions. [2022-11-23 01:58:51,448 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44905869324473974 [2022-11-23 01:58:51,449 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 811 transitions. [2022-11-23 01:58:51,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 811 transitions. [2022-11-23 01:58:51,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:51,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 811 transitions. [2022-11-23 01:58:51,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 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:58:51,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 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:58:51,457 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 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:58:51,457 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 292 flow. Second operand 7 states and 811 transitions. [2022-11-23 01:58:51,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 121 transitions, 1055 flow [2022-11-23 01:58:51,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 121 transitions, 965 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-11-23 01:58:51,497 INFO L231 Difference]: Finished difference. Result has 64 places, 37 transitions, 245 flow [2022-11-23 01:58:51,498 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=245, PETRI_PLACES=64, PETRI_TRANSITIONS=37} [2022-11-23 01:58:51,498 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2022-11-23 01:58:51,499 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 37 transitions, 245 flow [2022-11-23 01:58:51,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 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:58:51,499 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:51,499 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:58:51,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 01:58:51,500 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:58:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:51,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1350759800, now seen corresponding path program 2 times [2022-11-23 01:58:51,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:51,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28921611] [2022-11-23 01:58:51,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:51,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:53,239 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:58:53,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:53,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28921611] [2022-11-23 01:58:53,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28921611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:53,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:53,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 01:58:53,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922173636] [2022-11-23 01:58:53,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:53,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 01:58:53,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:53,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 01:58:53,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 01:58:53,346 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 258 [2022-11-23 01:58:53,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 37 transitions, 245 flow. Second operand has 8 states, 8 states have (on average 101.875) internal successors, (815), 8 states have internal predecessors, (815), 0 states have call successors, (0), 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:58:53,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:53,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 258 [2022-11-23 01:58:53,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:54,027 INFO L130 PetriNetUnfolder]: 341/671 cut-off events. [2022-11-23 01:58:54,031 INFO L131 PetriNetUnfolder]: For 1842/1842 co-relation queries the response was YES. [2022-11-23 01:58:54,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2840 conditions, 671 events. 341/671 cut-off events. For 1842/1842 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3168 event pairs, 26 based on Foata normal form. 1/672 useless extension candidates. Maximal degree in co-relation 2822. Up to 152 conditions per place. [2022-11-23 01:58:54,036 INFO L137 encePairwiseOnDemand]: 247/258 looper letters, 40 selfloop transitions, 12 changer transitions 78/130 dead transitions. [2022-11-23 01:58:54,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 130 transitions, 1101 flow [2022-11-23 01:58:54,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 01:58:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-23 01:58:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1086 transitions. [2022-11-23 01:58:54,042 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42093023255813955 [2022-11-23 01:58:54,043 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1086 transitions. [2022-11-23 01:58:54,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1086 transitions. [2022-11-23 01:58:54,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:54,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1086 transitions. [2022-11-23 01:58:54,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.6) internal successors, (1086), 10 states have internal predecessors, (1086), 0 states have call successors, (0), 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:58:54,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 258.0) internal successors, (2838), 11 states have internal predecessors, (2838), 0 states have call successors, (0), 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:58:54,057 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 258.0) internal successors, (2838), 11 states have internal predecessors, (2838), 0 states have call successors, (0), 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:58:54,057 INFO L175 Difference]: Start difference. First operand has 64 places, 37 transitions, 245 flow. Second operand 10 states and 1086 transitions. [2022-11-23 01:58:54,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 130 transitions, 1101 flow [2022-11-23 01:58:54,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 130 transitions, 817 flow, removed 25 selfloop flow, removed 15 redundant places. [2022-11-23 01:58:54,075 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 232 flow [2022-11-23 01:58:54,075 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2022-11-23 01:58:54,076 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-11-23 01:58:54,076 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 232 flow [2022-11-23 01:58:54,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.875) internal successors, (815), 8 states have internal predecessors, (815), 0 states have call successors, (0), 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:58:54,077 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:54,077 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:58:54,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 01:58:54,078 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:58:54,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:54,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2025794834, now seen corresponding path program 3 times [2022-11-23 01:58:54,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:54,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132450479] [2022-11-23 01:58:54,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:54,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:54,441 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:58:54,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:54,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132450479] [2022-11-23 01:58:54,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132450479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:54,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:54,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:58:54,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169823729] [2022-11-23 01:58:54,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:54,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:58:54,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:54,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:58:54,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:58:54,470 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 258 [2022-11-23 01:58:54,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 232 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:58:54,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:54,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 258 [2022-11-23 01:58:54,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:54,659 INFO L130 PetriNetUnfolder]: 129/287 cut-off events. [2022-11-23 01:58:54,659 INFO L131 PetriNetUnfolder]: For 525/525 co-relation queries the response was YES. [2022-11-23 01:58:54,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 287 events. 129/287 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1058 event pairs, 60 based on Foata normal form. 1/288 useless extension candidates. Maximal degree in co-relation 1091. Up to 155 conditions per place. [2022-11-23 01:58:54,662 INFO L137 encePairwiseOnDemand]: 252/258 looper letters, 35 selfloop transitions, 4 changer transitions 24/63 dead transitions. [2022-11-23 01:58:54,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 463 flow [2022-11-23 01:58:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:58:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:58:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2022-11-23 01:58:54,665 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4496124031007752 [2022-11-23 01:58:54,665 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 580 transitions. [2022-11-23 01:58:54,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 580 transitions. [2022-11-23 01:58:54,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:54,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 580 transitions. [2022-11-23 01:58:54,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 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:58:54,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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:58:54,671 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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:58:54,671 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 232 flow. Second operand 5 states and 580 transitions. [2022-11-23 01:58:54,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 463 flow [2022-11-23 01:58:54,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 443 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-23 01:58:54,675 INFO L231 Difference]: Finished difference. Result has 59 places, 31 transitions, 167 flow [2022-11-23 01:58:54,675 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=59, PETRI_TRANSITIONS=31} [2022-11-23 01:58:54,676 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2022-11-23 01:58:54,676 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 31 transitions, 167 flow [2022-11-23 01:58:54,676 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:58:54,676 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:54,677 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:58:54,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 01:58:54,677 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:58:54,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:54,678 INFO L85 PathProgramCache]: Analyzing trace with hash 671943442, now seen corresponding path program 4 times [2022-11-23 01:58:54,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:54,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205219286] [2022-11-23 01:58:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:54,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:58:54,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:58:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:58:54,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:58:54,820 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 01:58:54,821 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-23 01:58:54,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-23 01:58:54,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-23 01:58:54,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-23 01:58:54,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-23 01:58:54,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-23 01:58:54,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-23 01:58:54,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-23 01:58:54,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-23 01:58:54,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-23 01:58:54,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-23 01:58:54,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-23 01:58:54,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-23 01:58:54,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 01:58:54,828 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:58:54,835 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 01:58:54,835 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 01:58:54,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:58:54 BasicIcfg [2022-11-23 01:58:54,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 01:58:54,942 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 01:58:54,942 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 01:58:54,942 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 01:58:54,943 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:58:33" (3/4) ... [2022-11-23 01:58:54,946 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 01:58:54,946 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 01:58:54,947 INFO L158 Benchmark]: Toolchain (without parser) took 23469.20ms. Allocated memory was 155.2MB in the beginning and 486.5MB in the end (delta: 331.4MB). Free memory was 121.6MB in the beginning and 330.1MB in the end (delta: -208.5MB). Peak memory consumption was 124.2MB. Max. memory is 16.1GB. [2022-11-23 01:58:54,947 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 119.5MB. Free memory was 70.8MB in the beginning and 70.6MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:58:54,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 730.96ms. Allocated memory is still 155.2MB. Free memory was 121.2MB in the beginning and 98.0MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 01:58:54,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.09ms. Allocated memory is still 155.2MB. Free memory was 98.0MB in the beginning and 95.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:58:54,948 INFO L158 Benchmark]: Boogie Preprocessor took 66.82ms. Allocated memory is still 155.2MB. Free memory was 95.7MB in the beginning and 93.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:58:54,949 INFO L158 Benchmark]: RCFGBuilder took 925.21ms. Allocated memory is still 155.2MB. Free memory was 93.7MB in the beginning and 105.4MB in the end (delta: -11.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-11-23 01:58:54,950 INFO L158 Benchmark]: TraceAbstraction took 21636.68ms. Allocated memory was 155.2MB in the beginning and 486.5MB in the end (delta: 331.4MB). Free memory was 104.0MB in the beginning and 330.1MB in the end (delta: -226.1MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. [2022-11-23 01:58:54,950 INFO L158 Benchmark]: Witness Printer took 4.51ms. Allocated memory is still 486.5MB. Free memory is still 330.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:58:54,952 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.25ms. Allocated memory is still 119.5MB. Free memory was 70.8MB in the beginning and 70.6MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 730.96ms. Allocated memory is still 155.2MB. Free memory was 121.2MB in the beginning and 98.0MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.09ms. Allocated memory is still 155.2MB. Free memory was 98.0MB in the beginning and 95.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.82ms. Allocated memory is still 155.2MB. Free memory was 95.7MB in the beginning and 93.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 925.21ms. Allocated memory is still 155.2MB. Free memory was 93.7MB in the beginning and 105.4MB in the end (delta: -11.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21636.68ms. Allocated memory was 155.2MB in the beginning and 486.5MB in the end (delta: 331.4MB). Free memory was 104.0MB in the beginning and 330.1MB in the end (delta: -226.1MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. * Witness Printer took 4.51ms. Allocated memory is still 486.5MB. Free memory is still 330.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: 6.7s, 134 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 33 TransitionsAfterwards, 2524 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 129 TotalNumberOfCompositions, 6185 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3366, independent: 3208, independent conditional: 0, independent unconditional: 3208, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1786, independent: 1739, independent conditional: 0, independent unconditional: 1739, 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: 1786, independent: 1712, independent conditional: 0, independent unconditional: 1712, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 475, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3366, independent: 1469, independent conditional: 0, independent unconditional: 1469, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 1786, unknown conditional: 0, unknown unconditional: 1786] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1105; [L844] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1105, ((void *)0), P0, ((void *)0))=-2, t1105={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1106; [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1106, ((void *)0), P1, ((void *)0))=-1, t1105={5:0}, t1106={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1107; [L848] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1107, ((void *)0), P2, ((void *)0))=0, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L776] 2 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L779] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L796] 3 y = 2 [L799] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L861] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] 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_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=255, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 844]: 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: 846]: 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, 158 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: 21.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 794 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 640 mSDsluCounter, 432 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 333 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1669 IncrementalHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 99 mSDtfsCounter, 1669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=9, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 1772 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:58:54,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea --- 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:58:57,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:58:57,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:58:57,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:58:57,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:58:57,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:58:57,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:58:57,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:58:57,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:58:57,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:58:57,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:58:57,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:58:57,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:58:57,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:58:57,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:58:57,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:58:57,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:58:57,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:58:57,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:58:57,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:58:57,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:58:57,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:58:57,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:58:57,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:58:57,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:58:57,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:58:57,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:58:57,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:58:57,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:58:57,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:58:57,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:58:57,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:58:57,760 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:58:57,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:58:57,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:58:57,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:58:57,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:58:57,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:58:57,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:58:57,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:58:57,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:58:57,768 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-23 01:58:57,795 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:58:57,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:58:57,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:58:57,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:58:57,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 01:58:57,797 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 01:58:57,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:58:57,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:58:57,799 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:58:57,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:58:57,799 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 01:58:57,799 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 01:58:57,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:58:57,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 01:58:57,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:58:57,800 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 01:58:57,801 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 01:58:57,801 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 01:58:57,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 01:58:57,801 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 01:58:57,802 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 01:58:57,802 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 01:58:57,802 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 01:58:57,802 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:58:57,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:58:57,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:58:57,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 01:58:57,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:58:57,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:58:57,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 01:58:57,804 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 01:58:57,804 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 01:58:57,805 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 01:58:57,805 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 01:58:57,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 01:58:57,805 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 01:58:57,806 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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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 -> 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea [2022-11-23 01:58:58,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:58:58,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:58:58,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:58:58,267 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:58:58,268 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:58:58,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-11-23 01:59:01,426 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:59:01,837 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:59:01,837 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-11-23 01:59:01,866 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/data/47220609a/bd1ae01c358d4c4395aa7f086b465049/FLAGe46ac5ff8 [2022-11-23 01:59:01,897 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/data/47220609a/bd1ae01c358d4c4395aa7f086b465049 [2022-11-23 01:59:01,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:59:01,904 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:59:01,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:59:01,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:59:01,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:59:01,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:01" (1/1) ... [2022-11-23 01:59:01,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c973089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:01, skipping insertion in model container [2022-11-23 01:59:01,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:01" (1/1) ... [2022-11-23 01:59:01,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:59:02,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:59:02,289 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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-11-23 01:59:02,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:59:02,599 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:59:02,615 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_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-11-23 01:59:02,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:59:02,785 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:59:02,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:02 WrapperNode [2022-11-23 01:59:02,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:59:02,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:59:02,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:59:02,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:59:02,793 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:02" (1/1) ... [2022-11-23 01:59:02,822 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:02" (1/1) ... [2022-11-23 01:59:02,859 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-11-23 01:59:02,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:59:02,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:59:02,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:59:02,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:59:02,878 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:02" (1/1) ... [2022-11-23 01:59:02,879 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:02" (1/1) ... [2022-11-23 01:59:02,901 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:02" (1/1) ... [2022-11-23 01:59:02,901 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:02" (1/1) ... [2022-11-23 01:59:02,915 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:02" (1/1) ... [2022-11-23 01:59:02,933 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:02" (1/1) ... [2022-11-23 01:59:02,936 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:02" (1/1) ... [2022-11-23 01:59:02,938 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:02" (1/1) ... [2022-11-23 01:59:02,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:59:02,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:59:02,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:59:02,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:59:02,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:02" (1/1) ... [2022-11-23 01:59:02,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:59:02,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:59:02,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:03,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:03,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 01:59:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 01:59:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 01:59:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 01:59:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 01:59:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 01:59:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 01:59:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 01:59:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 01:59:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 01:59:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 01:59:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 01:59:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 01:59:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:59:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:59:03,061 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:03,260 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:59:03,263 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:59:03,874 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:59:04,096 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:59:04,097 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 01:59:04,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:04 BoogieIcfgContainer [2022-11-23 01:59:04,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:59:04,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 01:59:04,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 01:59:04,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 01:59:04,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:59:01" (1/3) ... [2022-11-23 01:59:04,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ba0929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:59:04, skipping insertion in model container [2022-11-23 01:59:04,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:02" (2/3) ... [2022-11-23 01:59:04,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ba0929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:59:04, skipping insertion in model container [2022-11-23 01:59:04,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:04" (3/3) ... [2022-11-23 01:59:04,113 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.oepc.i [2022-11-23 01:59:04,136 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 01:59:04,136 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-23 01:59:04,136 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 01:59:04,208 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 01:59:04,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 275 flow [2022-11-23 01:59:04,366 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-11-23 01:59:04,367 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:04,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-23 01:59:04,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 130 transitions, 275 flow [2022-11-23 01:59:04,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 127 transitions, 263 flow [2022-11-23 01:59:04,393 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 01:59:04,424 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 127 transitions, 263 flow [2022-11-23 01:59:04,435 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 127 transitions, 263 flow [2022-11-23 01:59:04,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 263 flow [2022-11-23 01:59:04,508 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-11-23 01:59:04,508 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:04,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-23 01:59:04,515 INFO L119 LiptonReduction]: Number of co-enabled transitions 2524 [2022-11-23 01:59:14,971 INFO L134 LiptonReduction]: Checked pairs total: 6920 [2022-11-23 01:59:14,972 INFO L136 LiptonReduction]: Total number of compositions: 126 [2022-11-23 01:59:15,004 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 01:59:15,014 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;@1fed880e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 01:59:15,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-23 01:59:15,018 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 01:59:15,018 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:15,019 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:15,020 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 01:59:15,021 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:15,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:15,029 INFO L85 PathProgramCache]: Analyzing trace with hash 555, now seen corresponding path program 1 times [2022-11-23 01:59:15,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:15,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352529649] [2022-11-23 01:59:15,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:15,042 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:15,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:15,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:15,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:15,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 01:59:15,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:15,168 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:15,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:59:15,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 01:59:15,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352529649] [2022-11-23 01:59:15,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352529649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:15,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:15,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 01:59:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523724601] [2022-11-23 01:59:15,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:15,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 01:59:15,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 01:59:15,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 01:59:15,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 01:59:15,217 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 256 [2022-11-23 01:59:15,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 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:15,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:15,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 256 [2022-11-23 01:59:15,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:15,886 INFO L130 PetriNetUnfolder]: 1616/2402 cut-off events. [2022-11-23 01:59:15,887 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-23 01:59:15,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4826 conditions, 2402 events. 1616/2402 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11502 event pairs, 1616 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 4815. Up to 2368 conditions per place. [2022-11-23 01:59:15,915 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2022-11-23 01:59:15,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2022-11-23 01:59:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 01:59:15,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 01:59:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 264 transitions. [2022-11-23 01:59:15,942 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.515625 [2022-11-23 01:59:15,943 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 264 transitions. [2022-11-23 01:59:15,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 264 transitions. [2022-11-23 01:59:15,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:15,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 264 transitions. [2022-11-23 01:59:15,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 132.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:15,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 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:15,965 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 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:15,968 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 264 transitions. [2022-11-23 01:59:15,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2022-11-23 01:59:15,976 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:15,978 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2022-11-23 01:59:15,981 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, 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:15,988 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2022-11-23 01:59:15,989 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2022-11-23 01:59:15,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 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:15,993 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:15,993 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 01:59:16,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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)] Ended with exit code 0 [2022-11-23 01:59:16,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:16,206 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:16,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash 547096, now seen corresponding path program 1 times [2022-11-23 01:59:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:16,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030101770] [2022-11-23 01:59:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:16,208 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:16,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:16,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:16,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:16,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 01:59:16,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:16,357 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:16,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:59:16,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 01:59:16,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030101770] [2022-11-23 01:59:16,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030101770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:16,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:16,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 01:59:16,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357681140] [2022-11-23 01:59:16,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:16,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:59:16,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 01:59:16,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:59:16,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:59:16,370 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 256 [2022-11-23 01:59:16,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:16,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:16,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 256 [2022-11-23 01:59:16,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:16,791 INFO L130 PetriNetUnfolder]: 1263/2021 cut-off events. [2022-11-23 01:59:16,791 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:16,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3930 conditions, 2021 events. 1263/2021 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11276 event pairs, 204 based on Foata normal form. 0/1855 useless extension candidates. Maximal degree in co-relation 3927. Up to 1510 conditions per place. [2022-11-23 01:59:16,803 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 35 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2022-11-23 01:59:16,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 172 flow [2022-11-23 01:59:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:59:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:59:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-11-23 01:59:16,806 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2022-11-23 01:59:16,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2022-11-23 01:59:16,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2022-11-23 01:59:16,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:16,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2022-11-23 01:59:16,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:16,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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:16,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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:16,812 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 388 transitions. [2022-11-23 01:59:16,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 172 flow [2022-11-23 01:59:16,813 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:16,814 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2022-11-23 01:59:16,815 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, 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:16,816 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2022-11-23 01:59:16,816 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2022-11-23 01:59:16,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:16,817 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:16,817 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:16,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:17,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:17,041 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:17,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1776525584, now seen corresponding path program 1 times [2022-11-23 01:59:17,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:17,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857372592] [2022-11-23 01:59:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:17,043 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:17,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:17,045 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:17,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:17,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 01:59:17,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:17,240 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:17,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:59:17,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 01:59:17,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857372592] [2022-11-23 01:59:17,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857372592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:17,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:17,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 01:59:17,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341627816] [2022-11-23 01:59:17,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:17,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:59:17,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 01:59:17,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:59:17,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:59:17,270 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 256 [2022-11-23 01:59:17,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 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:17,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:17,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 256 [2022-11-23 01:59:17,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:17,695 INFO L130 PetriNetUnfolder]: 679/1113 cut-off events. [2022-11-23 01:59:17,695 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-11-23 01:59:17,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2350 conditions, 1113 events. 679/1113 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5364 event pairs, 130 based on Foata normal form. 80/1144 useless extension candidates. Maximal degree in co-relation 2346. Up to 752 conditions per place. [2022-11-23 01:59:17,701 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 31 selfloop transitions, 4 changer transitions 21/59 dead transitions. [2022-11-23 01:59:17,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 250 flow [2022-11-23 01:59:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:59:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:59:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2022-11-23 01:59:17,704 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4828125 [2022-11-23 01:59:17,705 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2022-11-23 01:59:17,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2022-11-23 01:59:17,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:17,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2022-11-23 01:59:17,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 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:17,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 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:17,711 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 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:17,711 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 618 transitions. [2022-11-23 01:59:17,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 250 flow [2022-11-23 01:59:17,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 01:59:17,714 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 90 flow [2022-11-23 01:59:17,714 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-11-23 01:59:17,715 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2022-11-23 01:59:17,715 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 90 flow [2022-11-23 01:59:17,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 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:17,716 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:17,716 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:17,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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)] Ended with exit code 0 [2022-11-23 01:59:17,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:17,929 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:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash -779716459, now seen corresponding path program 1 times [2022-11-23 01:59:17,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:17,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668974835] [2022-11-23 01:59:17,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:17,930 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:17,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:17,932 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:17,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:18,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 01:59:18,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:18,143 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:18,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:59:18,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 01:59:18,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668974835] [2022-11-23 01:59:18,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668974835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:18,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:18,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:59:18,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743791327] [2022-11-23 01:59:18,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:18,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:59:18,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 01:59:18,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:59:18,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:59:18,178 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 256 [2022-11-23 01:59:18,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 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:18,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:18,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 256 [2022-11-23 01:59:18,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:18,550 INFO L130 PetriNetUnfolder]: 274/507 cut-off events. [2022-11-23 01:59:18,551 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2022-11-23 01:59:18,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 507 events. 274/507 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2199 event pairs, 73 based on Foata normal form. 44/535 useless extension candidates. Maximal degree in co-relation 1334. Up to 157 conditions per place. [2022-11-23 01:59:18,554 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 40 selfloop transitions, 7 changer transitions 21/71 dead transitions. [2022-11-23 01:59:18,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 71 transitions, 358 flow [2022-11-23 01:59:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:59:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 01:59:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2022-11-23 01:59:18,558 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4830729166666667 [2022-11-23 01:59:18,559 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2022-11-23 01:59:18,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2022-11-23 01:59:18,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:18,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2022-11-23 01:59:18,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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:18,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 0 states have call successors, (0), 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:18,566 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 0 states have call successors, (0), 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:18,567 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 90 flow. Second operand 6 states and 742 transitions. [2022-11-23 01:59:18,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 71 transitions, 358 flow [2022-11-23 01:59:18,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 71 transitions, 352 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-23 01:59:18,572 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 140 flow [2022-11-23 01:59:18,572 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-11-23 01:59:18,573 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2022-11-23 01:59:18,574 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 140 flow [2022-11-23 01:59:18,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 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:18,575 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:18,575 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:18,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:18,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:18,789 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:18,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:18,790 INFO L85 PathProgramCache]: Analyzing trace with hash -607774531, now seen corresponding path program 1 times [2022-11-23 01:59:18,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:18,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32556358] [2022-11-23 01:59:18,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:18,791 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:18,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:18,793 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:18,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:18,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 01:59:18,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:19,029 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:19,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:59:19,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 01:59:19,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32556358] [2022-11-23 01:59:19,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32556358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:19,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:19,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:59:19,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009704766] [2022-11-23 01:59:19,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:19,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:59:19,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 01:59:19,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:59:19,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:59:19,066 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 256 [2022-11-23 01:59:19,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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:19,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:19,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 256 [2022-11-23 01:59:19,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:19,492 INFO L130 PetriNetUnfolder]: 168/318 cut-off events. [2022-11-23 01:59:19,493 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2022-11-23 01:59:19,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 318 events. 168/318 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1257 event pairs, 68 based on Foata normal form. 11/323 useless extension candidates. Maximal degree in co-relation 906. Up to 129 conditions per place. [2022-11-23 01:59:19,495 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 37 selfloop transitions, 10 changer transitions 11/61 dead transitions. [2022-11-23 01:59:19,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 352 flow [2022-11-23 01:59:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 01:59:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 01:59:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2022-11-23 01:59:19,499 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47098214285714285 [2022-11-23 01:59:19,499 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2022-11-23 01:59:19,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2022-11-23 01:59:19,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:19,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2022-11-23 01:59:19,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 0 states have call successors, (0), 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:19,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 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:19,513 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 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:19,513 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 140 flow. Second operand 7 states and 844 transitions. [2022-11-23 01:59:19,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 352 flow [2022-11-23 01:59:19,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 316 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-11-23 01:59:19,522 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 142 flow [2022-11-23 01:59:19,523 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2022-11-23 01:59:19,525 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2022-11-23 01:59:19,526 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 142 flow [2022-11-23 01:59:19,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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:19,527 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:19,527 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] [2022-11-23 01:59:19,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:19,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:19,748 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:19,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1110614560, now seen corresponding path program 1 times [2022-11-23 01:59:19,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:19,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950396100] [2022-11-23 01:59:19,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:19,750 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:19,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:19,751 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:19,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:19,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 01:59:19,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:20,259 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:20,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:59:20,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 01:59:20,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950396100] [2022-11-23 01:59:20,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950396100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:20,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:20,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:59:20,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130184867] [2022-11-23 01:59:20,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:20,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 01:59:20,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 01:59:20,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 01:59:20,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 01:59:20,329 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-11-23 01:59:20,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 142 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 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:20,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:20,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-11-23 01:59:20,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:20,752 INFO L130 PetriNetUnfolder]: 181/369 cut-off events. [2022-11-23 01:59:20,753 INFO L131 PetriNetUnfolder]: For 398/398 co-relation queries the response was YES. [2022-11-23 01:59:20,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 369 events. 181/369 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1629 event pairs, 17 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1036. Up to 147 conditions per place. [2022-11-23 01:59:20,756 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 63 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2022-11-23 01:59:20,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 488 flow [2022-11-23 01:59:20,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 01:59:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 01:59:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2022-11-23 01:59:20,760 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46372767857142855 [2022-11-23 01:59:20,760 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2022-11-23 01:59:20,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2022-11-23 01:59:20,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:20,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2022-11-23 01:59:20,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 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:20,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 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:20,767 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 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:20,767 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 142 flow. Second operand 7 states and 831 transitions. [2022-11-23 01:59:20,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 488 flow [2022-11-23 01:59:20,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 72 transitions, 402 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-11-23 01:59:20,771 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 128 flow [2022-11-23 01:59:20,771 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2022-11-23 01:59:20,772 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2022-11-23 01:59:20,772 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 128 flow [2022-11-23 01:59:20,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 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:20,773 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:20,773 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] [2022-11-23 01:59:20,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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 01:59:20,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:20,987 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:20,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash 665794036, now seen corresponding path program 2 times [2022-11-23 01:59:20,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:20,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455750310] [2022-11-23 01:59:20,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 01:59:20,989 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:20,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:20,992 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:20,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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 01:59:21,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 01:59:21,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 01:59:21,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 01:59:21,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:21,216 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:21,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:59:21,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 01:59:21,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455750310] [2022-11-23 01:59:21,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455750310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:21,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:21,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 01:59:21,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414227780] [2022-11-23 01:59:21,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:21,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:59:21,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 01:59:21,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:59:21,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:59:21,232 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 256 [2022-11-23 01:59:21,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 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:21,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:21,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 256 [2022-11-23 01:59:21,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:21,516 INFO L130 PetriNetUnfolder]: 318/637 cut-off events. [2022-11-23 01:59:21,517 INFO L131 PetriNetUnfolder]: For 485/485 co-relation queries the response was YES. [2022-11-23 01:59:21,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1806 conditions, 637 events. 318/637 cut-off events. For 485/485 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3153 event pairs, 37 based on Foata normal form. 1/638 useless extension candidates. Maximal degree in co-relation 1797. Up to 306 conditions per place. [2022-11-23 01:59:21,522 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 63 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2022-11-23 01:59:21,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 408 flow [2022-11-23 01:59:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 01:59:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 01:59:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2022-11-23 01:59:21,525 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4873046875 [2022-11-23 01:59:21,525 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2022-11-23 01:59:21,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2022-11-23 01:59:21,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:21,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2022-11-23 01:59:21,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 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:21,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 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:21,530 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 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:21,530 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 128 flow. Second operand 4 states and 499 transitions. [2022-11-23 01:59:21,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 408 flow [2022-11-23 01:59:21,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 397 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 01:59:21,537 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 135 flow [2022-11-23 01:59:21,537 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2022-11-23 01:59:21,538 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2022-11-23 01:59:21,538 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 135 flow [2022-11-23 01:59:21,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 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:21,538 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:21,539 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] [2022-11-23 01:59:21,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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 01:59:21,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:21,755 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:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:21,756 INFO L85 PathProgramCache]: Analyzing trace with hash 142576656, now seen corresponding path program 3 times [2022-11-23 01:59:21,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:21,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503707370] [2022-11-23 01:59:21,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 01:59:21,757 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:21,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:21,758 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:21,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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 01:59:21,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 01:59:21,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 01:59:21,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 01:59:21,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:21,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:21,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:59:21,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 01:59:21,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503707370] [2022-11-23 01:59:21,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503707370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:21,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:21,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 01:59:21,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189552031] [2022-11-23 01:59:21,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:21,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:59:21,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 01:59:21,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:59:21,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:59:21,961 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 256 [2022-11-23 01:59:21,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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:21,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:21,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 256 [2022-11-23 01:59:21,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:22,236 INFO L130 PetriNetUnfolder]: 494/968 cut-off events. [2022-11-23 01:59:22,236 INFO L131 PetriNetUnfolder]: For 841/841 co-relation queries the response was YES. [2022-11-23 01:59:22,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 968 events. 494/968 cut-off events. For 841/841 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5205 event pairs, 138 based on Foata normal form. 1/960 useless extension candidates. Maximal degree in co-relation 2839. Up to 484 conditions per place. [2022-11-23 01:59:22,244 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 51 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2022-11-23 01:59:22,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 337 flow [2022-11-23 01:59:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:59:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:59:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2022-11-23 01:59:22,247 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2022-11-23 01:59:22,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2022-11-23 01:59:22,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2022-11-23 01:59:22,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:22,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2022-11-23 01:59:22,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:22,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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:22,251 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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:22,251 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 135 flow. Second operand 3 states and 380 transitions. [2022-11-23 01:59:22,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 337 flow [2022-11-23 01:59:22,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 01:59:22,259 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 146 flow [2022-11-23 01:59:22,259 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2022-11-23 01:59:22,260 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-11-23 01:59:22,260 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 146 flow [2022-11-23 01:59:22,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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:22,260 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:22,261 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] [2022-11-23 01:59:22,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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 01:59:22,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:22,480 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:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:22,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1979596590, now seen corresponding path program 4 times [2022-11-23 01:59:22,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 01:59:22,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115210147] [2022-11-23 01:59:22,481 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 01:59:22,481 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:22,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 01:59:22,483 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:22,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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 01:59:22,673 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 01:59:22,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 01:59:22,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:59:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:59:22,844 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-23 01:59:22,844 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 01:59:22,845 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-23 01:59:22,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-23 01:59:22,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-23 01:59:22,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-23 01:59:22,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-23 01:59:22,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-23 01:59:22,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-23 01:59:22,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-23 01:59:22,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-23 01:59:22,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-23 01:59:22,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-23 01:59:22,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-23 01:59:22,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-23 01:59:22,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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 01:59:23,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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:23,061 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-11-23 01:59:23,066 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 01:59:23,066 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 01:59:23,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:59:23 BasicIcfg [2022-11-23 01:59:23,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 01:59:23,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 01:59:23,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 01:59:23,202 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 01:59:23,203 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:04" (3/4) ... [2022-11-23 01:59:23,207 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 01:59:23,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 01:59:23,208 INFO L158 Benchmark]: Toolchain (without parser) took 21303.82ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 66.0MB in the beginning and 124.9MB in the end (delta: -58.9MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2022-11-23 01:59:23,208 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 73.4MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:59:23,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 875.85ms. Allocated memory is still 90.2MB. Free memory was 65.8MB in the beginning and 63.1MB in the end (delta: 2.7MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2022-11-23 01:59:23,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.84ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 60.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:59:23,211 INFO L158 Benchmark]: Boogie Preprocessor took 77.52ms. Allocated memory is still 90.2MB. Free memory was 60.5MB in the beginning and 58.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:59:23,213 INFO L158 Benchmark]: RCFGBuilder took 1155.68ms. Allocated memory is still 90.2MB. Free memory was 58.3MB in the beginning and 63.3MB in the end (delta: -5.0MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2022-11-23 01:59:23,214 INFO L158 Benchmark]: TraceAbstraction took 19098.56ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 62.6MB in the beginning and 124.9MB in the end (delta: -62.3MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2022-11-23 01:59:23,214 INFO L158 Benchmark]: Witness Printer took 5.45ms. Allocated memory is still 159.4MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:59:23,216 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.36ms. Allocated memory is still 73.4MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 875.85ms. Allocated memory is still 90.2MB. Free memory was 65.8MB in the beginning and 63.1MB in the end (delta: 2.7MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.84ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 60.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.52ms. Allocated memory is still 90.2MB. Free memory was 60.5MB in the beginning and 58.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1155.68ms. Allocated memory is still 90.2MB. Free memory was 58.3MB in the beginning and 63.3MB in the end (delta: -5.0MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19098.56ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 62.6MB in the beginning and 124.9MB in the end (delta: -62.3MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * Witness Printer took 5.45ms. Allocated memory is still 159.4MB. Free memory is still 124.9MB. 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: 10.5s, 135 PlacesBefore, 42 PlacesAfterwards, 127 TransitionsBefore, 33 TransitionsAfterwards, 2524 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 126 TotalNumberOfCompositions, 6920 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3489, independent: 3296, independent conditional: 0, independent unconditional: 3296, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1821, independent: 1764, independent conditional: 0, independent unconditional: 1764, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1821, independent: 1740, independent conditional: 0, independent unconditional: 1740, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 457, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 407, dependent conditional: 0, dependent unconditional: 407, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3489, independent: 1532, independent conditional: 0, independent unconditional: 1532, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 1821, unknown conditional: 0, unknown unconditional: 1821] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1105; [L844] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1105, ((void *)0), P0, ((void *)0))=0, t1105={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1106; [L846] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1106, ((void *)0), P1, ((void *)0))=1, t1105={3:0}, t1106={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L776] 2 x = 1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L847] 0 pthread_t t1107; [L848] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1107, ((void *)0), P2, ((void *)0))=2, t1105={3:0}, t1106={7:0}, t1107={11:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L779] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L796] 3 y = 2 [L799] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1105={3:0}, t1106={7:0}, t1107={11:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L861] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] 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_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, expression=1, expression=0, 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=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: 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, 159 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: 18.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 278 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 230 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 978 IncrementalHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 12 mSDtfsCounter, 978 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=8, 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, 0.7s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 435 SizeOfPredicates, 13 NumberOfNonLiveVariables, 964 ConjunctsInSsa, 49 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 01:59:23,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2a2a5f-eb28-4831-ae2e-977d2930a89d/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